Incremental algorithms to update visibility polygons

DOI10.1007/978-3-319-53007-9_19MaRDI QIDQ2971649zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Dynamic algorithms for visibility polygons in simple polygons
• Maintaining the visibility graph of a dynamic simple polygon
• Visibility queries and maintenance in simple polygons
• Efficient visibility queries in simple polygons
• scientific article; zbMATH DE number 177567

Cites work

• A linear algorithm for computing the visibility polygon from a point
• An Optimal Algorithm for Computing Visibility in the Plane
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Computing the visibility polygon from a convex set and related problems
• Computing the visibility polygon from an edge
• Corrections to Lee's visibility polygon algorithm
• Efficient visibility queries in simple polygons
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Query point visibility computation in polygons with holes
• The Robot Localization Problem
• Visibility Algorithms in the Plane
• Visibility and intersection problems in plane geometry
• Visibility and ray shooting queries in polygonal domains
• Visibility of a simple polygon
• Visibility of disjoint polygons
• Visibility queries and maintenance in simple polygons
• Visibility queries in a polygonal region

Cited in

(4)

• Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
• Maintaining the visibility graph of a dynamic simple polygon
• Vertex guarding for dynamic orthogonal art galleries
• Dynamic algorithms for visibility polygons in simple polygons

This page was built for publication: Incremental algorithms to update visibility polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971649)