Visibility of a simple polygon
From MaRDI portal
Recommendations
Cited in
(62)- Generalized Delaunay triangulation for planar graphs
- Visibility of disjoint polygons
- Reconstructing visible regions from visible segments
- Visibility between two edges of a simple polygon
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Algorithms for minimum length partitions of polygons
- Corrections to Lee's visibility polygon algorithm
- Solving visibility and separability problems on a mesh-of-processors
- Recognizing polygons, or how to spy
- On geodesic properties of polygons relevant to linear time triangulation
- Minimum-link paths among obstacles in the plane
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach
- A workbench for computational geometry
- Recognizing weakly convex visible polygons
- Visibility with multiple diffuse reflections
- Numerically robust computation of circular visibility
- An approximate algorithm for the minimal vertex nested polygon problem
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
- Efficient visibility queries in simple polygons
- The problem of polygons with hidden vertices
- A linear-time algorithm for constructing a circular visibility diagram
- Computing the \(k\)-visibility region of a point in a polygon
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- A constant-factor approximation algorithm for vertex guarding a WV-polygon
- Visibility and ray shooting queries in polygonal domains
- Parametric search: three new applications
- Visibility extension via mirror-edges to cover invisible segments
- Approximate guarding of monotone and rectilinear polygons
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Query point visibility computation in polygons with holes
- Query-point visibility constrained shortest paths in simple polygons
- A linear time algorithm to remove winding of a simple polygon
- Multiple point visibility and related problems
- Incremental algorithms to update visibility polygons
- How to extend visibility polygons by mirrors to cover invisible segments
- A simple linear hidden-line algorithm for star-shaped polygons
- scientific article; zbMATH DE number 3876624 (Why is no real title available?)
- Visiting a Polygon on the Optimal Way to a Query Point
- scientific article; zbMATH DE number 3958767 (Why is no real title available?)
- scientific article; zbMATH DE number 4043246 (Why is no real title available?)
- scientific article; zbMATH DE number 4050998 (Why is no real title available?)
- On the correctness of a linear-time visibility polygon algorithm∗
- TOWARDS WEB-BASED COMPUTING
- An exact algorithm for minimizing vertex guards on art galleries
- On representing a simple polygon perceivable to a blind person
- Computing the visibility polygon of an island in a polygonal domain
- Routing in polygonal domains
- Dynamic algorithms for visibility polygons in simple polygons
- CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
- Characterizing LR-visibility polygons and related problems
- The influence of nucleus mechanics in modelling adhesion-independent cell migration in structured and confined environments
- Reflective guarding a gallery
- Optimal Area Polygonization by Triangulation and Visibility Search
- Approximation algorithms for the two-watchman route in a simple polygon
- Non-crossing Hamiltonian paths and cycles in output-polynomial time
- An upper bound for conforming Delaunay triangulations
- A proportion of visibility polygon's surface to the entire polygon's surface: a lower bound of the proportion derived for general polygons of any shape and orthogonal polygons
- Visibility extension via reflection
- Some chain visibility problems in a simple polygon
- An optimal algorithm for computing a minimum nested nonconvex polygon
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- Approximation algorithms for art gallery problems in polygons
This page was built for publication: Visibility of a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315016)
