Sciweavers

JCDCG
2004
Springer
15 years 2 months ago
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
Marc Benkert, Alexander Wolff, Florian Widmann
COMPGEOM
2004
ACM
15 years 18 days ago
Continuous path verification in multi-axis NC-machining
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...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...
CAAN
2004
Springer
15 years 2 months ago
Congestion Games, Load Balancing, and Price of Anarchy
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...
Anshul Kothari, Subhash Suri, Csaba D. Tóth...
COMPGEOM
2004
ACM
15 years 2 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
COMPGEOM
2004
ACM
15 years 2 months ago
Deterministic sampling and range counting in geometric data streams
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
Amitabha Bagchi, Amitabh Chaudhary, David Eppstein...
Discrete Geometry
Top of PageReset Settings