EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON

DOI10.1142/S021819599500026XzbMath0838.68047OpenAlexW2130512060MaRDI QIDQ4858656

No author found.

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

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)

Related Items (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