A linear algorithm for computing the visibility polygon from a point
From MaRDI portal
Cited in
(62)- Towards a definition of higher order constrained Delaunay triangulations
- Generalized Delaunay triangulation for planar graphs
- Visibility of disjoint polygons
- Visibility between two edges of a simple polygon
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Corrections to Lee's visibility polygon algorithm
- Solving visibility and separability problems on a mesh-of-processors
- Recognizing polygons, or how to spy
- Computing the link center of a simple polygon
- On decomposing polygons into uniformly monotone parts
- On geodesic properties of polygons relevant to linear time triangulation
- Computing bushy and thin triangulations
- Minimum-link paths among obstacles in the plane
- Parallel methods for visibility and shortest-path problems in simple polygons
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach
- On determining optimal strategies in pursuit games in the plane
- Optimum placement of guards
- Ray shooting in polygons using geodesic triangulations
- Recognizing weakly convex visible polygons
- Visibility with multiple diffuse reflections
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- Applications of a two-dimensional hidden-line algorithm to other geometric problems
- Efficient visibility queries in simple polygons
- \(\alpha\)-kernel problem with fuzzy visibility
- Computing the \(k\)-visibility region of a point in a polygon
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- Visibility and ray shooting queries in polygonal domains
- Parametric search: three new applications
- Computing the intersection-depth to polyhedra
- Minimal link visibility paths inside a simple polygon
- Approximate guarding of monotone and rectilinear polygons
- Query point visibility computation in polygons with holes
- A linear time algorithm to remove winding of a simple polygon
- Solving visibility problems on MCCs of smaller size
- An algorithm for generalized point location and its applications
- Incremental algorithms to update visibility polygons
- Guard placement for maximizing L-visibility exterior to a convex polygon
- CLEARING A POLYGON WITH TWO 1-SEARCHERS
- Approximation Algorithms for Edge-Covering Problem
- On the correctness of a linear-time visibility polygon algorithm∗
- Universal Limit Laws for Depths in Random Trees
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Planar lower envelope of monotone polygonal chains
- Visibility with multiple reflections
- Graphics in flatland revisited
- Star unfolding of a polytope with applications
- Computing the visibility polygon of an island in a polygonal domain
- Dynamic algorithms for visibility polygons in simple polygons
- Optimal Area Polygonization by Triangulation and Visibility Search
- Topological art in simple galleries
- Computing in linear time a chord from which a simple polygon is weakly internally visible
- Approximation algorithms for the two-watchman route in a simple polygon
- A note on the combinatorial structure of the visibility graph in simple polygons
- An upper bound for conforming Delaunay triangulations
- m-watchmen's routes in minbar and generalized minbar polygons
- Polynomial-time algorithms for contiguous art gallery and related problems
- Simulation of pedestrian route choice with local view: a potential field approach
- Guarding galleries and terrains
- Some chain visibility problems in a simple polygon
- Computing the longest diagonal of a simple polygon
This page was built for publication: A linear algorithm for computing the visibility polygon from a point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3910036)
