Sciweavers

28095 search results - page 327 / 5619
» D
Sort
View
WSCG
2004
239views more  WSCG 2004»
15 years 8 months ago
General n-Dimensional Rotations
This paper presents a generalized approach for performing general rotations in the n-Dimensional Euclidean space around any arbitrary (n-2)-Dimensional subspace. It first shows th...
Antonio Aguilera, Ricardo Pérez-Aguila
CORR
2004
Springer
121views Education» more  CORR 2004»
15 years 6 months ago
Worst-Case Optimal Tree Layout in a Memory Hierarchy
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
Erik D. Demaine, John Iacono, Stefan Langerman

Tutorial
5774views
17 years 7 months ago
On the implementation of fast marching methods for 3D lattices
This technical report discusses Sethian's Fast Marching Method and its higher accuracy variant. Both methods may be used to compute the arrival times at the points of a discre...
Jakob Andreas Bærentzen
CVPR
2007
IEEE
16 years 8 months ago
A Benchmark for the Comparison of 3-D Motion Segmentation Algorithms
Over the past few years, several methods for segmenting a scene containing multiple rigidly moving objects have been proposed. However, most existing methods have been tested on a...
René Vidal, Roberto Tron
163
Voted
ICCV
2001
IEEE
16 years 8 months ago
Ambiguous Configurations for the 1D Structure and Motion Problem
In this paper we investigate, determine and classify the critical configurations for solving structure and motion problems for 1D retina vision. We give a complete categorization ...
Fredrik Kahl, Kalle Åström