Computing a visibility polygon using few variables

DOI10.1016/j.comgeo.2014.04.001zbMath1306.65166OpenAlexW1978331593MaRDI QIDQ396475

Rodrigo I. Silveira, Matias Korman, Stefan Langerman, Luis Barba

Publication date: 13 August 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.04.001

zbMATH Keywords

algorithmfacility locationroboticsvisibilitycomputational geometrydivide-and-conquersimple polygonconvex vertexreflex vertexvisibility polygon

Mathematics Subject Classification ID

Kinematics of mechanisms and robots (70B15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational issues in computer and robotic vision (65D19)

Related Items (8)

Time-space trade-offs for triangulations and Voronoi diagrams ⋮ Time-Space Trade-offs for Triangulations and Voronoi Diagrams ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon ⋮ Space-time trade-offs for stack-based algorithms ⋮ A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon ⋮ A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A generalized Winternitz theorem
• Selection from read-only memory and sorting with minimum data movement
• Multi-pass geometric algorithms
• Geodesic ham-sandwich cuts
• Upper bounds for time-space trade-offs in sorting and selection
• Corrections to Lee's visibility polygon algorithm
• Selection and sorting with limited storage
• On the identification of the convex hull of a finite set of points in the plane
• Geodesic Order Types
• Space-Time Trade-offs for Stack-Based Algorithms
• Computing the Visibility Polygon Using Few Variables
• Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
• Improved upper bounds for time-space tradeoffs for selection with limited storage
• Computational Complexity
• Visibility Algorithms in the Plane

This page was built for publication: Computing a visibility polygon using few variables