Divide-and-conquer for Voronoi diagrams revisited

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2009, Pages 189-197

  Aichholzer, Oswin ^a   Aigner, Wolfgang ^a   Aurenhammer, Franz ^a   Hackl, Thomas ^a   Jüttler, Bert ^b   Pilgerstorfer, Elisabeth ^b   Rabl, Margot ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Biarc approximation; Divide and conquer; Medial axis; Motion planning; Trimmed offset; Voronoi diagram

Indexed keywords

ATOMIC STEP; BI-ARC APPROXIMATION; CIRCULAR ARC; CONSTRUCTION ALGORITHMS; DELAUNAY TRIANGULATION METHOD; DIVIDE AND CONQUER; FREE-FORM OBJECT; INCLUSION TEST; INPUT DATAS; MEDIAL AXIS; NUMERICAL STABILITIES; PLANAR DOMAIN; RUNTIMES; VORONOI DIAGRAMS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL EFFICIENCY; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; MOTION PLANNING; NAVIGATION;

COMPUTATIONAL GEOMETRY;

EID: 70849084018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542362.1542401     Document Type: Conference Paper

References (31)

1. O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, and M. Rabl. Medial axis computation for planar free-form shapes. Computer-Aided Design. To appear.
2. O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, M.Oberneder, and Z. Sír. Computational and structural advantages of circular boundary representation. In Springer Lecture Notes in Computer Science, volume 4619, pages 374-385, 2007.
3. H. Alt, O. Cheong, and A. Vigneron. The Voronoi diagram of curved objects. Discrete&Computational Geometry, 34:439-453, 2005.
4. L. Cao and J. Liu. Computation of medial axis and offset curves of curved boundaries in planar domain. Computer-Aided Design, 40(4):465-475, 2008.
5. CGAL. Computational Geometry Algorithms Library. http://www.cgal.org/.
6. >rd> Ann. IEEE Symp. Foundations of Computer Science, pages 339-349, 1982.
7. L.P. Chew and R.L. Drysdale. Voronoi diagrams based on convex distance functions. In Proc. 1st Ann. ACM Symposium on Computational Geometry, pages 235-244, 1985.
8. F.Y.L. Chin, J. Snoeyink, and C.A.Wang. Finding the medial axis of a simple polygon in linear time. Discrete&Computational Geometry, 21:405-420, 1999.
9. H.I. Choi, S.W. Choi, and H.P. Moon. Mathematical theory of medial axis transform. Pacific Journal of Mathematics, 181:57-88, 1997.
10. G. Elber, E. Cohen, and S. Drake. MATHSM: Medial axis transform toward high speed machining of pockets. Computer-Aided Design, 37:241-250, 2005.
11. I.Z. Emiris, E.P. Tsigaridas, and G.M. Tzoumas. The predicates for the Voronoi diagram of ellipses. In Proc. 22nd Ann. ACM Symposium on Computational Geometry, pages 227-236, 2006.
12. S. Fortune. A sweep line algorithm for Voronoi diagrams. Algorithmica, 2:153-174, 1987.
13. M. Held. Voronoi diagrams and offset curves of curvilinear polygons. Computer-Aided Design, 30(4):287-300, 1998.
14. M. Held. VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments. Computational Geometry: Theory and Applications, pages 95-123, 2001.
15. M. Held. Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight line segments. Computer-Aided Design, to appear.
16. M. Held, G. Lukacs, and L. Andor. Pocket machining based on contour-parallel tool paths generated by means of proximity maps. Computer-Aided Design, pages 189-203, 1994.
17. D.G. Kirkpatrick. Efficient computation of continuous skeletons. In Proc. 20th Ann. IEEE Symp. Foundations of Computer Science, pages 18-27, 1979.
18. R. Klein. Concrete and Abstract Voronoi diagrams. Springer Lecture Notes in Computer Science 400, 1990.
19. R. Klein, K. Mehlhorn, and S. Meiser. Randomized incremental construction of abstract Voronoi diagrams. Computational Geometry: Theory and Applications, 3:157-184, 1993.
20. D.T. Lee. Medial axis transformation of a planar shape. IEEE Trans. Pattern Analysis and Machine Intelligence, 4:363-369, 1982.
21. D.T. Lee and R.L.S. Drysdale. Generalization of Voronoi diagrams in the plane. SIAM Journal on Computing, 10:73-87, 1981.
22. M. McAllister, D. Kirkpatrick, and J. Snoeyink. A compact piecewise-linear Voronoi diagram for convex sites in the plane. Discrete&Computational Geometry, 15:73-105, 1996. (Pubitemid 126317930)
23. D. S. Meek and D. J. Walton. Spiral arc spline approximation to a planar spiral. J. Comput. Appl. Math., 107:21-30, 1999.
24. D.S. Meek and D.J. Walton. Approximating smooth planar curves by arc splines. J. Comput. Appl. Math., 59:221-231, 1995.
25. E. Pilgerstorfer. Asymptotischer Vergleich verschiedener Verfahren der Biarc-Approximation. Master Thesis, Johannes Kepler University Linz, Austria, 2008.
26. J-K. Seong, G. Elber, and M-S. Kim. Trimming local and global self-intersections in offset curves/surfaces using distance maps. Computer-Aided Design, 38:183-193, 2006.
27. M.I. Shamos and D. Hoey. Closest-point problems. In Proc. 16th Ann. IEEE Symp. Foundations of Computer Science, pages 151-162, 1975.
28. M. Sharir. Intersection and closest-pair problems for a set of circular discs. SIAM Journal on Computing, 14:448-468, 1985.
29. Z. Šír, R. Feichtinger, and B. Jüttler. Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics. Computer-Aided Design, 38:608-618, 2006.
30. C.-K. Yap. An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete&Computational Geometry, 2:365-393, 1987.
31. C.-K. Yap and H. Alt. Motion planning in the CL-environment. In Lecture Notes In Computer Science 382, pages 373-380, 1989.