A note on visibility-constrained Voronoi diagrams

DOI10.1016/j.dam.2014.04.009zbMath1312.68208OpenAlexW2130299606MaRDI QIDQ400517

Bing Su, Binhai Zhu, Franz Aurenhammer, Yin-Feng Xu

Publication date: 22 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.04.009

zbMATH Keywords

Voronoi diagramvisibilityline arrangement

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete geometry (52C99)

Related Items

Unnamed Item

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity and construction of many faces in arrangements of lines and of segments
• The complexity of many cells in arrangements of planes and related problems
• Extremal problems in discrete geometry
• Combinatorial complexity bounds for arrangements of curves and spheres
• Generalized Delaunay triangulation for planar graphs
• Constrained Delaunay triangulations
• On the geodesic Voronoi diagram of point sites in a simple polygon
• On the zone of a surface in a hyperplane arrangement
• Finding constrained and weighted Voronoi diagrams in the plane
• Voronoi diagram with visual restriction
• Voronoi Diagrams and Delaunay Triangulations
• BASELINE BOUNDED HALF-PLANE VORONOI DIAGRAM
• Semi Voronoi Diagrams
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Computing Many Faces in Arrangements of Lines and Segments
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE