An Output-Sensitive Algorithm for Computing Visibility Graphs
From MaRDI portal
Recommendations
Cited in
(62)- Algorithms for Computing Diffuse Reflection Paths in Polygons
- The vertex-edge visibility graph of a polygon
- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures
- Computing Simple Paths on Points in Simple Polygons
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
- Density-Based Clustering Based on Topological Properties of the Data Set
- Altitude terrain guarding and guarding uni-monotone polygons
- A new algorithm for Euclidean shortest paths in the plane
- Geometric Knapsack problems
- Computing minimum length paths of a given homotopy class
- The visibility-Voronoi complex and its applications
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
- Finding exact solutions for the geometric firefighter problem in practice
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon
- Approximate Shortest Paths in Polygons with Violations
- Area requirement of visibility representations of trees
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Minimum-link watchman tours
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
- Weak visibility counting in simple polygons
- A Computational Geometric Approach to Visual Hulls
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field
- Topologically sweeping visibility complexes via pseudotriangulations
- Three dimensional weak visibility: Complexity and applications
- Computing the maximum clique in the visibility graph of a simple polygon
- Can visibility graphs be represented compactly?
- A visibility graph averaging aggregation operator
- On the union of fat wedges and separating a collection of segments by a line
- Shortest paths in the plane with obstacle violations
- Continuous visible query for three-dimensional objects in spatial databases
- Reconstructing generalized staircase polygons with uniform step length
- An exact geometry-based algorithm for path planning
- Spiderman graph: visibility in urban regions
- Link distance and shortest path problems in the plane
- Minimal tangent visibility graphs
- A novel approach for modeling order picking paths
- Locating guards for visibility coverage of polygons
- Shortest paths in the plane with obstacle violations
- Visibility testing and counting
- Weighted minimum backward Fréchet distance
- Randomized approximation algorithms for planar visibility counting problem
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Enclosing points with geometric objects
- An efficient algorithm for facility location in the presence of forbidden regions
- Computing the full visibility graph of a set of line segments
- Minimum-link paths among obstacles in the plane
- Segment endpoint visibility graphs are Hamiltonian
- Disproving a conjecture on planar visibility graphs
- Fastest-path planning for direction-dependent speed functions
- Pizza sharing is PPA-hard
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Computing the visibility polygon of an island in a polygonal domain
- Incremental algorithms to update visibility polygons
- Planar rectilinear shortest path computation using corridors
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
- Three-dimensional weak visibility: Complexity and applications
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- Geometric path problems with violations
- Visibility testing and counting
- Dynamic algorithms for visibility polygons in simple polygons
- A note on the combinatorial structure of the visibility graph in simple polygons
- Perfect binary space partitions
This page was built for publication: An Output-Sensitive Algorithm for Computing Visibility Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982713)
