COMPGEOM
2006
ACM
14 years 5 months ago
2006
ACM
COMPGEOM
2006
ACM
14 years 5 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
COMPGEOM
2006
ACM
14 years 5 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
COMPGEOM
2006
ACM
14 years 5 months ago
2006
ACM
COMPGEOM
2006
ACM
14 years 5 months ago
2006
ACM
COMPGEOM
2006
ACM
14 years 5 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 5 months ago
2006
ACM
The overlay of 2 ≤ m ≤ d minimization diagrams of n surfaces in Rd is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in Rd+m−1 . ...
COMPGEOM
2006
ACM
14 years 5 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
COMPGEOM
2006
ACM
14 years 5 months ago
2006
ACM
COMPGEOM
2006
ACM
14 years 5 months ago
2006
ACM
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...