An optimal algorithm for finding the edge visibility polygon under limited visibility

DOI10.1016/0020-0190(94)00220-SzbMath0875.68896OpenAlexW2066813664MaRDI QIDQ673918

Seung-Hak Choi, Sung-Ho Kim, Sung Yong Shin, Jung-Heum Park, Kyung-Yong Chwa

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00220-s

zbMATH Keywords

Computational geometryVisibility

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Triangulating a simple polygon in linear time
• Watchman routes under limited visibility

This page was built for publication: An optimal algorithm for finding the edge visibility polygon under limited visibility