Sciweavers

ESA
2001
Springer
97views Algorithms» more  ESA 2001»
14 years 4 months ago
Splitting a Delaunay Triangulation in Linear Time
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
Bernard Chazelle, Olivier Devillers, Ferran Hurtad...
ESA
2001
Springer
61views Algorithms» more  ESA 2001»
14 years 4 months ago
A Separation Bound for Real Algebraic Expressions
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for int...
Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, S...
ESA
2001
Springer
104views Algorithms» more  ESA 2001»
14 years 4 months ago
Smallest Color-Spanning Objects
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and...
Manuel Abellanas, Ferran Hurtado, Christian Icking...