A fast algorithm for computing sparse visibility graphs

DOI10.1007/BF01840385zbMath0685.68053MaRDI QIDQ1262133

C. Pandu Rangan, S. Sudarshan

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

computational geometry; visibility graph construction

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68U99: Computing methodologies and applications

51M20: Polyhedra and polytopes; regular figures, division of spaces

52A30: Variants of convex sets (star-shaped, ((m, n))-convex, etc.)

68R99: Discrete mathematics in relation to computer science

Related Items

Topologically sweeping visibility complexes via pseudotriangulations, Minimal tangent visibility graphs

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