Two-guarding a rectilinear polygon

DOI10.1007/3-540-61332-3_173zbMath1529.68314MaRDI QIDQ6184685

Binhai Zhu, Xue-Hou Tan

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• A combinatorial theorem in plane geometry
• Computational complexity of art gallery problems
• An Optimal Algorithm for Finding the Kernel of a Polygon

This page was built for publication: Two-guarding a rectilinear polygon