EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON

DOI10.1142/S021819599500026XzbMATH Open0838.68047OpenAlexW2130512060MaRDI QIDQ4858656FDOQ4858656

Authors:

Publication date: 18 December 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819599500026x

Recommendations

• Guarding in a simple polygon
• Efficient visibility queries in simple polygons
• Computing the longest diagonal of a simple polygon
• Finding a shortest diagonal of a simple polygon in linear time
• Visibility queries and maintenance in simple polygons

zbMATH Keywords

weak visibilitydiagonal visibilityguard diagonal

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Cited In (3)

• Characterizing LR-visibility polygons and related problems
• Finding the shortest boundary guard of a simple polygon
• Guarding in a simple polygon

This page was built for publication: EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON

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