Minimal tangent visibility graphs
From MaRDI portal
Publication:1924714
DOI10.1016/0925-7721(95)00016-XzbMath0857.68103MaRDI QIDQ1924714
Publication date: 20 October 1996
Published in: Computational Geometry (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (12)
Tight degree bounds for pseudo-triangulations of points ⋮ Minimum weight pseudo-triangulations ⋮ Convexity minimizes pseudo-triangulations ⋮ Alternating paths along axis-parallel segments ⋮ Segment endpoint visibility graphs are Hamiltonian ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ MEASURING THE QUALITY OF SURVEILLANCE IN A WIRELESS SENSOR NETWORK ⋮ On the number of pseudo-triangulations of certain point sets ⋮ Pointed binary encompassing trees: simple and optimal ⋮ Topologically sweeping visibility complexes via pseudotriangulations ⋮ Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time ⋮ On the minimum size of visibility graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Shortest paths in the plane with convex polygonal obstacles
- Visibility of disjoint polygons
- Time and space efficient algorithms for shortest paths between convex polygons
- A tight lower bound on the size of visibility graphs
- Topologically sweeping an arrangement
- A fast algorithm for computing sparse visibility graphs
- A note on minimal visibility graphs
- Topologically sweeping visibility complexes via pseudotriangulations
- Minimal visibility graphs
- Rotation and Winding Numbers for Planar Polygons and Curves
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Theory of Maps on Orientable Surfaces
- COMPUTATIONAL GEOMETRY COLUMN 18
This page was built for publication: Minimal tangent visibility graphs
