387 search results - page 6 / 78 » Towards in-place geometric algorithms and data structures |
153
Voted
ADG
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we study the problem of reconstructing the polyhedral structures and geometric positions of a general nD polyhedral scene from a single 2D line drawing. With the ide...
112
click to vote
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
95
Voted
BILDMED
2008
15 years 1 months ago
2008
Abstract. This work presents an approach towards reconstructing ligament and tendon attachment sites from 3D medical image data. We apply statistical shape models with an additiona...