An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
From MaRDI portal
Publication:283875
DOI10.1016/J.COMGEO.2015.11.002zbMATH Open1342.65094OpenAlexW2187533684MaRDI QIDQ283875FDOQ283875
Authors: Sang Won Bae 
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
Recommendations
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (extended abstract)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Constructing the Voronoi diagram of a set of line segments in parallel
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- scientific article; zbMATH DE number 140455
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concrete and abstract Voronoi diagrams
- Title not available (Why is that?)
- Farthest-polygon 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
- 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 (extended abstract)
- Detecting weakly simple polygons
- Randomized incremental construction of abstract Voronoi diagrams
Cited In (13)
- Optimal computation of the Voronoi diagram of disjoint clusters
- The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
- Aspect-ratio Voronoi diagram and its complexity bounds
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (extended abstract)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Constructing the internal Voronoi diagram of polygonal figure using the sweepline method
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
- Robustness of \(k\)-gon Voronoi diagram construction
- Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
This page was built for publication: An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283875)
