102291 search results - page 393 / 20459 » Computability in Computational Geometry |
198
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
Differential operators are required to compute several characteristics for continuous surfaces, as e.g. tangents, curvature, flatness, shape descriptors. We propose to replace diff...
148
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
203
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
155
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
203
click to vote
COMPGEOM
2005
ACM
15 years 8 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...