A linear algorithm for computing the visibility polygon from a point
From MaRDI portal
Publication:3910036
DOI10.1016/0196-6774(81)90019-5zbMath0459.68057OpenAlexW2033775003WikidataQ29391117 ScholiaQ29391117MaRDI QIDQ3910036
Publication date: 1981
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(81)90019-5
Computing methodologies and applications (68U99) Discrete mathematics in relation to computer science (68R99)
Related Items
Optimally computing a shortest weakly visible line segment inside a simple polygon, Optimum placement of guards, Generalized Delaunay triangulation for planar graphs, Simulation of pedestrian route choice with local view: a potential field approach, Ray shooting in polygons using geodesic triangulations, Computing the intersection-depth to polyhedra, Minimal link visibility paths inside a simple polygon, Visibility of disjoint polygons, Approximate guarding of monotone and rectilinear polygons, Graphics in flatland revisited, Star unfolding of a polytope with applications, Visibility between two edges of a simple polygon, Guarding galleries and terrains, A linear algorithm for eliminating hidden-lines from a polygonal cylinder, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Solving visibility problems on MCCs of smaller size, Corrections to Lee's visibility polygon algorithm, An algorithm for generalized point location and its applications, 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 THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS, On decomposing polygons into uniformly monotone parts, On geodesic properties of polygons relevant to linear time triangulation, On the correctness of a linear-time visibility polygon algorithm∗, \(\alpha\)-kernel problem with fuzzy visibility, Recognizing weakly convex visible polygons, Visibility with multiple diffuse reflections, Optimal Area Polygonization by Triangulation and Visibility Search, Topological art in simple galleries, Incremental Algorithms to Update Visibility Polygons, Some chain visibility problems in a simple polygon, Computing the longest diagonal of a simple polygon, Dynamic Algorithms for Visibility Polygons in Simple Polygons, Query point visibility computation in polygons with holes, Planar lower envelope of monotone polygonal chains, A note on the combinatorial structure of the visibility graph in simple polygons, Computing bushy and thin triangulations, Computing the visibility polygon of an island in a polygonal domain, An upper bound for conforming Delaunay 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, Visibility and ray shooting queries in polygonal domains, A linear time algorithm to remove winding of a simple polygon, Parametric search: three new applications, Visibility with multiple reflections, Computing the \(k\)-visibility region of a point in a polygon, Towards a definition of higher order constrained Delaunay triangulations, CLEARING A POLYGON WITH TWO 1-SEARCHERS, Approximation Algorithms for Edge-Covering Problem, On determining optimal strategies in pursuit games in the plane, Voronoi diagrams with barriers and on polyhedra for minimal path planning, GUARD PLACEMENT FOR MAXIMIZING L-VISIBILITY EXTERIOR TO A CONVEX POLYGON, Universal Limit Laws for Depths in Random Trees, Applications of a two-dimensional hidden-line algorithm to other geometric problems, Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane, Efficient visibility queries in simple polygons
