Sciweavers

1801 search results - page 10 / 361
» Pointing without a pointer
Sort
View
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 2 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
WSCG
2004
154views more  WSCG 2004»
13 years 9 months ago
Freeform Object Positioning by 3D Shape Matching Without Artificial Feature Points
Determining the position and orientation of a workpiece relative to a manufacturing device is a prerequisite for machining path planning. If the workpiece is freeform and if it co...
Joris S. M. Vergeest, Yu Song, D. Hartge
ICIP
2008
IEEE
14 years 9 months ago
Using point correspondences without projective deformation for multi-view stereo reconstruction
This paper proposes a novel algorithm to reconstruct a 3D surface from a calibrated set of images. In a first pass, it uses Scale Invariant Features Transform (SIFT) descriptor co...
Adrien Auclair, Nicole Vincent, Laurent D. Cohen
COMGEO
2008
ACM
13 years 7 months ago
Triangulations without pointed spanning trees
Oswin Aichholzer, Clemens Huemer, Hannes Krasser