Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons

作者: Gill Barequet , Minati De , Michael T. Goodrich

DOI: 10.1007/S00453-021-00824-9

关键词:

摘要: In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore combinatorial complexity these diagrams, provide efficient algorithms for computing compact representations them.

参考文章(25)
Siu-Wing Cheng, Liam Mencel, Antoine Vigneron, A Faster Algorithm for Computing Straight Skeletons ACM Transactions on Algorithms. ,vol. 12, pp. 44- ,(2016) , 10.1145/2898961
David Kirkpatrick, Jack Snoeyink, Tentative Prune-And-Search For Computing Fixed-Points With Applications To Geometric Computation Fundamenta Informaticae. ,vol. 22, pp. 353- 370 ,(1995) , 10.3233/FI-1995-2243
David Rappaport, Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report) workshop on algorithms and data structures. pp. 57- 66 ,(1989) , 10.1007/3-540-51542-9_7
Franz Aurenhammer, Der-Tsai Lee, Rolf Klein, Voronoi Diagrams and Delaunay Triangulations ,(2013)
Rolf Klein, Derick Wood, Voronoi Diagrams Based on General Metrics in the Plane symposium on theoretical aspects of computer science. pp. 281- 291 ,(1988) , 10.1007/BFB0035852
Oswin Aichholzer, Franz Aurenhammer, Straight skeletons for general polygonal figures in the plane Lecture Notes in Computer Science. pp. 117- 126 ,(1996) , 10.1007/3-540-61332-3_144
Gill Barequet, Michael T Goodrich, Aya Levi-Steiner, Dvir Steiner, Contour interpolation by straight skeletons Graphical Models \/graphical Models and Image Processing \/computer Vision, Graphics, and Image Processing. ,vol. 66, pp. 245- 260 ,(2004) , 10.1016/J.GMOD.2004.05.001
Franz Aurenhammer, Voronoi diagrams—a survey of a fundamental geometric data structure ACM Computing Surveys. ,vol. 23, pp. 345- 405 ,(1991) , 10.1145/116873.116880
Evanthia Papadopoulou, Maksym Zavershynskyi, The Higher-Order Voronoi Diagram of Line Segments Algorithmica. ,vol. 74, pp. 415- 439 ,(2016) , 10.1007/S00453-014-9950-0