Maintaining the visibility graph of a dynamic simple polygon

DOI10.1007/978-3-030-11509-8_4MaRDI QIDQ2326564zbMATH OpenOpenAlexFDO

Authors Tameem Choudhury, Rajasekhar Inkulu

Publication date 10 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-11509-8_4

zbMATH Keywords

computational geometrydynamic algorithmsvisibility

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Dynamic algorithms for visibility polygons in simple polygons
• Incremental algorithms to update visibility polygons
• scientific article; zbMATH DE number 177567
• Maintaining visibility of a polygon with a moving point of view
• Visibility queries and maintenance in simple polygons

Cited in

(8)

• Visibility queries and maintenance in simple polygons
• Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
• Incremental algorithms to update visibility polygons
• scientific article; zbMATH DE number 177567 (Why is no real title available?)
• Vertex guarding for dynamic orthogonal art galleries
• Dynamic algorithms for visibility polygons in simple polygons
• Optimal Area Polygonization by Triangulation and Visibility Search
• Nearest neighbor searching in a dynamic simple polygon

This page was built for publication: Maintaining the visibility graph of a dynamic simple polygon

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