COMPGEOM
2006
ACM
14 years 24 days 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 ...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
I present an algorithm that can provably eliminate slivers in the interior of a tetrahedral mesh, leaving only tetrahedra with dihedral angles between 30 and 135 degrees and radiu...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a fixed-precision representation. In the previous years two variant...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM