A linear algorithm for computing the visibility polygon from a point

DOI10.1016/0196-6774(81)90019-5zbMATH Open0459.68057DBLPjournals/jal/ElGindyA81OpenAlexW2033775003WikidataQ29391117 ScholiaQ29391117MaRDI QIDQ3910036FDOQ3910036

Cited In (60)

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

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)