A fast algorithm for computing sparse visibility graphs

DOI10.1007/BF01840385zbMath0685.68053OpenAlexW2067947381MaRDI QIDQ1262133

S. Sudarshan, C. Pandu Rangan

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01840385

zbMATH Keywords

computational geometryvisibility graph construction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Polyhedra and polytopes; regular figures, division of spaces (51M20) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

Minimal tangent visibility graphs ⋮ Topologically sweeping visibility complexes via pseudotriangulations

Cites Work

• Unnamed Item
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Visibility of disjoint polygons
• Maintenance of configurations in the plane

This page was built for publication: A fast algorithm for computing sparse visibility graphs