How to compute the Voronoi diagram of line segments: Theoretical and experimental results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 855 LNCS, Issue , 1994, Pages 227-239

  Burnikel, Christoph ^a   Mehlhorn, Kurt ^a   Schirra, Stefan ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

ALGEBRAIC NUMBERS; EXACT ARITHMETIC; IMPLEMENTATION STRATEGIES; LINE SEGMENT; NUMERICAL PRECISION; ORDERS OF MAGNITUDE; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 85012242791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0049411     Document Type: Conference Paper

References (27)

1. F. Aurenhammer. Voronoi diagrams: a survey of a fundamental geometric data structure. ACM Comput. Surv., 23:345–405, 1991.
2. J.D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Technical report, INRIA, 1990.
3. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete and Computational Geometry, 8:51–71, 1992.
4. M.O. Benouamer, P. Jaillon, D. Michelucci, and J-M. Moreau. A “lazy” solution to imprecision in computational geometry. In 5th Canadian Conf. on Computational Geometry, pages 73–78, 1993.
5. J. Blömer. Computing sums of radicals in polynomial time. In FOCS91, pages 670–677, 1991.
6. J. Blömer. Computing sums of radicals in polynomial time. Technical Report B93-13, Freie Universität Berlin, 1993.
7. B. Butz. Robuste Implementierung eines Algorithmus zur Berechung eines Voronoi-Diagrams für Polygone. Diplomarbeit, 1994.
8. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, pages 387–421, 1989.
9. T. Dube and C.K. Yap. A basis for implementing exact computational geometry. extended abstract, 1994.
10. S. J. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153–174, 1987.
11. S. Fortune. Numerical stability of algorithms for 2d Delaunay triangulations and Voronoi diagrams. In ACM Symposium on Computational Geometry, volume 8, pages 83–92, 1992.
12. S. Fortune and C. van Wyk. Efficient exact arithmetic for computational geometry. Proc. of the 9th Symp. on Computational Geometry, pages 163–171, 1993.
13. S. Fortune and C. van Wyk. Efficient exact arithmetic for computational geometry. In Proc. of the 9th ACM Symp. on Computational Geometry, pages 163–172, 1993.
14. M. Karasick, D. Lieber, and L.R. Nackman. Efficient Delaunay triangulation using rational arithmetic. ACM Transactions on Graphics, 10(1):71–91, 1991.
15. R. Klein, K. Mehlhorn, and S. Meiser. On the construction of abstract Voronoi diagrams ii. In Proc. SIGAL Symp. on Algorithms, Tokyo, 1990. Springer Verlag. LNCS 450.
16. Z. Li and V. Milenkovic. Constructing strongly convex hulls using exact or rounded arithmetic. Algorithmica, 8:345–364, 1992.
17. R. Loos. Computing in algebraic extensions. In B. Buchberger, G.E. Collins, and R. Loos, editors, Computer Algebra, pages 173–187. Springer Verlag, 1982.
18. M. Mignotte. Mathematics for Computer Algebra. Springer Verlag, 1992.
19. K. Mehlhorn and S. Näher. Implementation of a sweep line algorithm for the segment intersection problem. manuscript.
20. A. Okabe, B. Boots, and Sugihara, K. Spatial tessellations: concepts and applications of Voronoi diagrams. Wiley, New York, 1992.
21. T. Ottmann, G. Thiemt, and C. Ullrich. Numerical stability of geometric algorithms. In Proc. of the 3rd ACM Symp. on Computational Geometry, pages 119–125, 1987.
22. C. O’Dúnlaing and C. Yap. A “retraction” method for planning the motion of a disk. Journal of Algorithms, 6:104–111, 1985.
23. M. Seel. Ausarbeitung und Implementierung eines Algorithmus zur Konstruktion abstrakter Voronoi-Diagramme. Diplomarbeit, 1994.
24. K. Sugihara, Y. Ooishi, and T. Imai. Topology-oriented approach to robustness and its applications to several Voronoi-diagram algorithms. In Proc. 2nd Canad. Conf. Comput. Geom., pages 36–39, 1990.
25. C. Yap. An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete and Computational Geometry, 2:365–393, 1987.
26. C.K. Yap. Towards exact geometric computation. In 5th Canadian Conf. on Computational Geometry, pages 405–419, 1993.
27. C.K. Yap. Fundamental Problems in Algorithmic Algebra. Princeton University Press, 1994.