Multiple point visibility and related problems

DOI10.1080/00207169608804483zbMath1001.68582OpenAlexW2063435017MaRDI QIDQ2710754

Hyung Lee-Kwang, Kyoung A. Seong

Publication date: 19 December 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169608804483

zbMATH Keywords

computational geometryart gallery problemmultiple point visibility

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Planar graphs: Theory and algorithms
• A short proof of Chvatal's Watchman Theorem
• A combinatorial theorem in plane geometry
• Visibility of a simple polygon
• Computational complexity of art gallery problems
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Computing the visibility polygon from a convex set and related problems

This page was built for publication: Multiple point visibility and related problems