EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS

DOI10.1142/S0218195999000066zbMath1020.52008OpenAlexW2100570140MaRDI QIDQ4513235

Xue-Hou Tan

Publication date: 7 November 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195999000066

zbMATH Keywords

computational geometryart gallery theoremsedge guardsstraight walkable polygons

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Triangulating a simple polygon
• A combinatorial theorem in plane geometry
• Computational complexity of art gallery problems
• THE TWO GUARDS PROBLEM
• An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM

This page was built for publication: EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS