506 search results - page 45 / 102 » Robust Registration of 2D and 3D Point Sets |
176
click to vote
3DGIS
2006
Springer
16 years 3 days ago
2006
Springer
The needs for three-dimensional (3D) visualization and navigation within 3D-GIS environment are growing and expanding rapidly in a variety of fields. In a steady shift from tradit...
175
click to vote
TOG
2008
15 years 6 months ago
2008
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
154
click to vote
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
157
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
173
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...