Two-guarding a rectilinear polygon

DOI10.1007/3-540-61332-3_173MaRDI QIDQ6184685zbMATH OpenFDO

Authors Xuehou Tan, Binhai Zhu

Publication date 29 January 2024

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

Full work available at URL https://doi.org/10.1007/3-540-61332-3_173

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4060719
• THE TWO GUARDS PROBLEM
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Approximate guarding of monotone and rectilinear polygons
• Automata, Languages and Programming

Cites work

• A combinatorial theorem in plane geometry
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Computational complexity of art gallery problems
• Finding the upper envelope of n line segments in O(n log n) time
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 177562 (Why is no real title available?)

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

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