Visibility of a simple polygon
From MaRDI portal
Publication:3315016
DOI10.1016/0734-189X(83)90065-8zbMath0532.68071OpenAlexW2019236084MaRDI QIDQ3315016
No author found.
Publication date: 1983
Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0734-189x(83)90065-8
computer graphicsoptimal algorithmcomputational geometryhidden line problem in the planevisible polygon
Polyhedra and polytopes; regular figures, division of spaces (51M20) Discrete mathematics in relation to computer science (68R99)
Related Items
Generalized Delaunay triangulation for planar graphs, Visibility of disjoint polygons, Approximate guarding of monotone and rectilinear polygons, Visibility between two edges of a simple polygon, A linear-time algorithm for constructing a circular visibility diagram, 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, On the correctness of a linear-time visibility polygon algorithm∗, Computing \(L_1\) shortest paths among polygonal obstacles in the plane, Recognizing weakly convex visible polygons, Visibility with multiple diffuse reflections, The influence of nucleus mechanics in modelling adhesion-independent cell migration in structured and confined environments, Reflective guarding a gallery, Visiting a Polygon on the Optimal Way to a Query Point, Optimal Area Polygonization by Triangulation and Visibility Search, Incremental Algorithms to Update Visibility Polygons, Some chain visibility problems in a simple polygon, An optimal algorithm for computing a minimum nested nonconvex polygon, How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments, Multiple point visibility and related problems, Dynamic Algorithms for Visibility Polygons in Simple Polygons, Query point visibility computation in polygons with holes, Query-point visibility constrained shortest paths in simple polygons, 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, Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach, Characterizing LR-visibility polygons and related problems, Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees, Approximation algorithms for art gallery problems in polygons, 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 extension via mirror-edges to cover invisible segments, TOWARDS WEB-BASED COMPUTING, Computing the \(k\)-visibility region of a point in a polygon, An approximate algorithm for the minimal vertex nested polygon problem, Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane, Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects, Efficient visibility queries in simple polygons, Routing in Polygonal Domains, A workbench for computational geometry, A constant-factor approximation algorithm for vertex guarding a WV-polygon
