Computing the full visibility graph of a set of line segments
From MaRDI portal
Recommendations
- Computing the visibility graph of points within a polygon
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- scientific article; zbMATH DE number 5542506
- Visibility graphs of point sets in the plane
- Visibility graphs of point sets in the plane
- Computing the visibility polygon from a convex set and related problems
- Planar segment visibility graphs
- Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
- A new algorithm for computing visibility graphs of polygonal obstacles in the plane
- Unsolved problems in visibility graphs of points, segments, and polygons
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- A unified approach to visibility representations of planar graphs
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Shortest path solves edge-to-edge visibility in a polygon
- Visibility of disjoint polygons
Cited in
(7)- Computing the visibility graph of points within a polygon
- A fast algorithm for computing sparse visibility graphs
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Line segment visibility with sidedness constraints
- Link distance and shortest path problems in the plane
- Disproving a conjecture on planar visibility graphs
This page was built for publication: Computing the full visibility graph of a set of line segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198072)
