2980 search results - page 247 / 596 » Computational Geometry |
199
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
188
click to vote
IPL
2002
15 years 6 months ago
2002
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
186
click to vote
CCDS
2010
15 years 4 months ago
2010
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
225
click to vote
CGF
2010
15 years 4 months ago
2010
We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct a surface approximating these points. This distance function...
191
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to ...