Divide-and-conquer for Voronoi diagrams revisited

Computational Geometry: Theory and Applications

Volumn 43, Issue 8, 2010, Pages 688-699

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

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c 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 GEOMETRY; CONVERGENCE OF NUMERICAL METHODS; MOTION PLANNING; NAVIGATION;

TREES (MATHEMATICS);

EID: 77953139553     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2010.04.004     Document Type: Article

References (33)

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