VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
From MaRDI portal
Publication:4762913
DOI10.1142/S0218195900000309zbMath0968.68122OpenAlexW2116409181MaRDI QIDQ4762913
Mark J. Keil, David M. Mount, Stephen K. Wismath
Publication date: 13 September 2001
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195900000309
Related Items
Uses Software
Cites Work
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Visibility of disjoint polygons
- A tight lower bound on the size of visibility graphs
- An optimal visibility graph algorithm for triangulated simple polygons
- Triangulating a simple polygon in linear time
- Computing the full visibility graph of a set of line segments
- On the identification of the convex hull of a finite set of points in the plane
- Minimal visibility graphs
- Shortest path solves edge-to-edge visibility in a polygon
- THE VISIBILITY COMPLEX