An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
From MaRDI portal
Publication:283875
DOI10.1016/j.comgeo.2015.11.002zbMath1342.65094OpenAlexW2187533684MaRDI QIDQ283875
Publication date: 17 May 2016
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.11.002
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Farthest-polygon Voronoi diagrams
- Randomized incremental construction of abstract Voronoi diagrams
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- A sweepline algorithm for Voronoi diagrams
- Triangulating a simple polygon in linear time
- Concrete and abstract Voronoi diagrams
- On the computational geometry of pocket machining
- Finding the medial axis of a simple polygon in linear time
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
- The Voronoi diagram of curved objects
- Medial Axis Transformation of a Planar Shape
- Optimal Search in Planar Subdivisions
- An optimal algorithm for intersecting line segments in the plane
- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments
- Detecting Weakly Simple Polygons
