Corrections to Lee's visibility polygon algorithm
From MaRDI portal
Publication:1102120
DOI10.1007/BF01937271zbMath0643.68098WikidataQ29541514 ScholiaQ29541514MaRDI QIDQ1102120
Publication date: 1987
Published in: BIT (Search for Journal in Brave)
Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)
Related Items
Approximate guarding of monotone and rectilinear polygons, Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons, A linear-time algorithm for constructing a circular visibility diagram, Corrections to Lee's visibility polygon algorithm, On the correctness of a linear-time visibility polygon algorithm∗, Computing \(L_1\) shortest paths among polygonal obstacles in the plane, Computing a visibility polygon using few variables, Recognizing weakly convex visible polygons, The influence of nucleus mechanics in modelling adhesion-independent cell migration in structured and confined environments, A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes, Triangle-Based Heuristics for Area Optimal Polygonizations, On Voronoi visibility maps of 1.5D terrains with multiple viewpoints, Visiting a Polygon on the Optimal Way to a Query Point, Optimal Area Polygonization by Triangulation and Visibility Search, How to Draw a Planarization, Incremental Algorithms to Update Visibility Polygons, Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon, Dynamic Algorithms for Visibility Polygons in Simple Polygons, Space-time trade-offs for stack-based algorithms, Planar lower envelope of monotone polygonal chains, Query-point visibility constrained shortest paths in simple polygons, A data modeling abstraction for describing triangular mesh algorithms, Computing the visibility polygon of an island in a polygonal domain, An exact algorithm for minimizing vertex guards on art galleries, An upper bound for conforming Delaunay triangulations, Minimum-link paths among obstacles in the plane, GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS, How to Draw a Planarization, Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees, Deriving the accumulation density function with parabolic trajectories of particles for arbitrary lines, Visibility and ray shooting queries in polygonal domains, A linear time algorithm to remove winding of a simple polygon, Parametric search: three new applications, Computing accumulation density of particles on a line with parabolic trajectories., A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon, LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS, Computing the \(k\)-visibility region of a point in a polygon, GUARDING ART GALLERIES BY GUARDING WITNESSES, Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane, TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS, On circularly-hidden surface removal., Efficient visibility queries in simple polygons, Routing in Polygonal Domains, A constant-factor approximation algorithm for vertex guarding a WV-polygon
Cites Work
- Unnamed Item
- Corrections to Lee's visibility polygon algorithm
- Visibility of a simple polygon
- Triangular meshes for regions of complicated shape
- A linear algorithm for computing the visibility polygon from a point
- Decomposition of Polygons into Convex Sets
- An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line Problem
