36 search results - page 4 / 8 » On the Optimality of Planar and Geometric Approximation Sche... |
SMA
2008
ACM
13 years 7 months ago
2008
ACM
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
GMP
2000
IEEE
13 years 11 months ago
2000
IEEE
A geometric approach to the computation of precise or well approximated tolerance zones for CAD constructions is given. We continue a previous study of linear constructions and fr...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...