Root comparison techniques applied to computing the additively weighted Voronoi diagram

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 320-329

  Karavelas, Menelaos I ^a   Emiris, Ioannis Z ^a,b  

^a INRIA   (France)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Algebraic predicates; Computational geometry; Symbolic computation; Voronoi diagrams

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DECISION THEORY; DIGITAL ARITHMETIC; DYNAMIC PROGRAMMING; NUMBER THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; QUADRATIC PROGRAMMING;

ALGEBRAIC PREDICATES; DYNAMIC ALGORITHMS; POLYNOMIAL FACTORIZATION; POLYNOMIAL STURN SEQUENCE; QUADRATIC ALGEBRAIC NUMBERS; QUADRATIC POLYNOMIALS; ROOT COMPARISON TECHNIQUES; SYMBOLIC COMPUTATION; VORONOI DIAGRAM;

COMPUTATIONAL GEOMETRY;

EID: 0038754161     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. P. Angelier. Algorithmique des Graphes de Visibilité. PhD thesis, Université Paris VII, 2002.
2. F. Anton, J.-D. Boissonnat, D. Mioc, and M. Yvinec. An exact predicate for the optimal construction of the additively weighted Voronoi diagram. In Europ. Workshop Comput. Geom., 2002.
3. F. Aurenhammer. Power diagrams: properties, algorithms and applications. SIAM J. Comp., 16:78-96, 1987.
4. J.-D. Boissonnat and M. I. Karavelas. On the combinatorial complexity of euclidean voronoi cells and convex hulls of d-dimensional spheres. These proceedings.
5. J.-D. Boissonnat and F. P. Preparata. Robust plane sweep for intersecting segments. SIAM J. Comp., 29(5):1401-1421, 2000.
6. C. Burnikel. Exact Computation of Voronoi Diagrams and Line Segment Intersections. Ph.D thesis, Universität des Saarlandes, March 1996.
7. The CGAL Manual, 2002. Release 2.4.
8. D. Cox, J. Little, and D. O'Shea. Using Algebraic Geometry. Number 185 in Graduate Texts in Mathematics. Springer-Verlag, New York, 1998.
9. O. Devillers, A. Fronville, B. Mourrain, and M. Teillaud. Algebraic methods and arithmetic filtering for exact predicates on circle arcs. Comp. Geom: Theory & Appl., Spec. Issue, 22:119-142, 2002.
10. R. L. Drysdale, III and D. T. Lee. Generalized Voronoi diagrams in the plane. In Proc. 16th Allerton Conf. Commun. Control Comput., pages 833-842, 1978.
11. Z. Du, S. Pion, and C. Yap. The CORE Library, 1.5 edition, 2002. http://www.cs.nyu.edu/exact/core.
12. S. Fortune. A sweepline algorithm for Voronoi diagrams. In Proc. 2nd Annu. ACM Sympos. Comput. Geom., pages 313-322, 1986.
13. T. Granlund. GMP, the GNU multiple precision arithmetic library. http://www.swox.com/gmp/.
14. M. I. Karavelas and I. Z. Emiris. Predicates for the planar additively weighted Voronoi diagram. Technical Report ECG-TR-122201-01, INRIA, 2002. http://www.inria.fr/prisme/ECG/Results.
15. M. I. Karavelas and M. Yvinec. Dynamic additively weighted Voronoi diagrams in 2D. In Proc. ESA, pages 586-598, Also INRIA Tech. Report RR-4466, INRIA Sophia-Antipolis.
16. J. Keyser, T. Culver, D. Manocha, and S. Krishnan. MAPC: A library for efficient and exact manipulation of algebraic points and curves. In Proc. ACM Symp. Comput. Geometry, pages 360-369, 1999.
17. D.-S. Kim, D. Kim, and K. Sugihara. Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology. CAGD, 18:541-562, 2001.
18. R. Klein, K. Mehlhorn, and S. Meiser. Randomized incremental construction of abstract Voronoi diagrams. Comp. Geom: Theory & Appl., 3(3):157-184, 1993.
19. G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: An illustration of degree-driven algorithm design. SIAM J. Comp., 28:864-889, 1999.
20. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000.
21. D. Perrucci. Personal communication, 2002.
22. S. Pion. Interval arithmetic: An efficient implementation and an application to computational geometry. In Workshop on Appl. of Interval Analysis to Systems and Control, pages 99-110, 1999.
23. M. Sharir. Intersection and closest-pair problems for a set of planar discs. SIAM J. Comp., 14:448-468, 1985.
24. C. K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, New York, 2000.