Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
From MaRDI portal
Publication:2971631
DOI10.1007/978-3-319-53007-9_3zbMath1485.68259OpenAlexW2584518789MaRDI QIDQ2971631
Publication date: 7 April 2017
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_3
line segmentsconvex polygonal sitesfarthest-site Voroni diagramnearest-site Voroni diagrampolygon-offset distance function
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Farthest-polygon Voronoi diagrams
- Farthest line segment Voronoi diagrams
- Planning a purely translational motion of a convex object in two- dimensional space using generalized 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
- Concrete and abstract Voronoi diagrams
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- On the complexity of higher order abstract Voronoi diagrams
- Voronoi Diagrams and Delaunay Triangulations
- ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM
- FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
- Voronoi diagrams for convex polygon-offset distance functions
This page was built for publication: Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function