COMPGEOM
13 years 11 months ago
2004 ACM 
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
COMPGEOM
13 years 11 months ago
2004 ACM 
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
COMPGEOM
13 years 10 months ago
2004 ACM 
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
COMPGEOM
13 years 11 months ago
2004 ACM 
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
COMPGEOM
13 years 11 months ago
2004 ACM 
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
|
Discrete Geometry