JCDCG
14 years 3 months ago
2004 Springer  COMPGEOM
14 years 3 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
14 years 3 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
14 years 1 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...
CAAN
14 years 3 months ago
2004 Springer 
Imagine a set of self-interested clients, each of whom must choose a server from a permissible set. A server’s latency is inversely proportional to its speed, but it grows linear...
|
Discrete Geometry