45 search results - page 7 / 9 » compgeom 2006 |
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
The medial axis of a shape is known to carry a lot of information about it. In particular a recent result of Lieutier establishes that every bounded open subset of Rn has the same...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
COMPGEOM
2006
ACM
14 years 2 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...