Incremental Algorithms to Update Visibility Polygons

DOI10.1007/978-3-319-53007-9_19zbMath1485.68269OpenAlexW2583132780MaRDI QIDQ2971649

Rajasekhar Inkulu, Nitish P. Thakur

Publication date: 7 April 2017

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_19

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Vertex Guarding for Dynamic Orthogonal Art Galleries ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane

Cites Work

• Visibility queries in a polygonal region
• Visibility and intersection problems in plane geometry
• Visibility of disjoint polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Corrections to Lee's visibility polygon algorithm
• Visibility queries and maintenance in simple polygons
• Efficient visibility queries in simple polygons
• Visibility and ray shooting queries in polygonal domains
• Weak visibility queries of line segments in simple polygons
• Query point visibility computation in polygons with holes
• Computing the visibility polygon from an edge
• Visibility of a simple polygon
• A linear algorithm for computing the visibility polygon from a point
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• An Optimal Algorithm for Computing Visibility in the Plane
• The Robot Localization Problem
• Visibility Algorithms in the Plane
• Computing the visibility polygon from a convex set and related problems
• Unnamed Item

This page was built for publication: Incremental Algorithms to Update Visibility Polygons