Visibility Algorithms in the Plane
From MaRDI portal
Recommendations
Cited in
(95)- Visibility maps and spherical algorithms
- FO model checking on geometric graphs
- Randomized approximation algorithms for planar visibility counting problem
- Visibility graphs, dismantlability, and the cops and robbers game
- Geometric path problems with violations
- Computational complexity aspects of point visibility graphs
- Mapping simple polygons: how robots benefit from looking back
- A fast shortest path algorithm on terrain-like graphs
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- The partial visibility curve of the Feigenbaum cascade to chaos
- Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
- Routing among convex polygonal obstacles in the plane
- Reachable region query and its applications
- A time-space trade-off for computing the k-visibility region of a point in a polygon
- Visibility testing and counting
- Weak visibility counting in simple polygons
- A fixed-parameter algorithm for guarding 1.5D terrains
- Walking in streets with minimal sensing
- Approximability of guarding weak visibility polygons
- Connecting guards with minimum Steiner points inside simple polygons
- Minimization of the maximum distance between the two guards patrolling a polygonal region
- Simple agents learn to find their way: an introduction on mapping polygons
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
- Characterizing and recognizing LR-visibility polygons
- Grid obstacle representation of graphs
- On rainbow quadrilaterals in colored point sets
- Point visibility graph recognition is NP-hard
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
- Walking in Streets with Minimal Sensing
- Incremental algorithms to update visibility polygons
- Time-space trade-off for finding the k-visibility region of a point in a polygon
- Diffuse reflection diameter in simple polygons
- Visibility testing and counting
- A complete algorithm for searchlight scheduling
- Graphs with large obstacle numbers
- Soft computing methods for WiMAX network planning on 3D geographical information systems
- Gender-aware facility location in multi-gender world
- Reconstructing visibility graphs with simple robots
- Algorithms for Computing Diffuse Reflection Paths in Polygons
- A new upper bound for the VC-dimension of visibility regions
- Computing a visibility polygon using few variables
- scientific article; zbMATH DE number 1182918 (Why is no real title available?)
- Reconstructing visibility graphs with simple robots
- scientific article; zbMATH DE number 1984330 (Why is no real title available?)
- Obstacle numbers of planar graphs
- Weak visibility queries of line segments in simple polygons and polygonal domains
- Online algorithms for searching and exploration in the plane
- scientific article; zbMATH DE number 2087475 (Why is no real title available?)
- Relative convex hulls in semi-dynamic arrangements
- An exact algorithm for minimizing vertex guards on art galleries
- scientific article; zbMATH DE number 1424307 (Why is no real title available?)
- Space-time trade-offs for stack-based algorithms
- Reconstructing generalized staircase polygons with uniform step length
- A framework for n-dimensional visibility computations
- On finding a shortest isothetic path and its monotonicity inside a digital object
- 1.5D terrain guarding problem parameterized by guard range
- Parameterized Analysis of Art Gallery and Terrain Guarding
- Vertex guarding for dynamic orthogonal art galleries
- Visibility Graphs of Anchor Polygons
- Path Counting for Grid-Based Navigation
- Guarding a Polygon Without Losing Touch
- FO model checking of geometric graphs
- Computing shortest paths in the plane with removable obstacles
- Recognition and complexity of point visibility graphs
- On colourability of polygon visibility graphs
- Dynamic algorithms for visibility polygons in simple polygons
- Approximate Shortest Paths in Polygons with Violations
- On the bar visibility number of complete bipartite graphs
- Algorithm 966: A practical iterative algorithm for the art gallery problem using integer linear programming
- An optimal algorithm for reconstructing point set order types from radial orderings
- Mapping a Polygon with Holes Using a Compass
- Optimal placement of UV-based communications relay nodes
- Optimization of mixture models on time series networks encoded by visibility graphs: an analysis of the US electricity market
- Optimal Area Polygonization by Triangulation and Visibility Search
- Kernel-based construction operators for Boolean sum and ruled geometry
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
- On colourability of polygon visibility graphs
- One-sided terrain guarding and chordal graphs
- A polygon is determined by its angles
- Voronoi-based splinegon decomposition and shortest-path tree computation
- On the structure of graphs with low obstacle number
- Routing among convex polygonal obstacles in the plane
- Some new results on bar visibility of digraphs
- The two-guard problem on curvilinear polygons
- Feasible minimum distance feedback-based-navigation for a differential drive robot in an environment with obstacles
- Computing pseudotriangulations via branched coverings
- On the classification of planar-rips complexes and their corresponding unit disk graphs
- Compact representation of semilinear and terrain-like graphs
- Routing among convex polygonal obstacles in the plane using a simplified domain
- Mapping a polygon with holes using a compass
- The embracing Voronoi diagram and closest embracing number
- Near optimal line segment queries in simple polygons
- Visibility and intersection problems in plane geometry
- Approximation algorithms for art gallery problems in polygons
This page was built for publication: Visibility Algorithms in the Plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444161)
