EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS

DOI10.1142/S0218195999000066MaRDI QIDQ4513235zbMATH OpenOpenAlexFDO

Authors Xuehou 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

art gallery theoremscomputational geometryedge guardsstraight walkable polygons

Mathematics Subject Classification ID

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

Recommendations

• Edge guards in rectilinear polygons
• Two-Guard Walkability of Simple Polygons
• Edge guarding polyhedral terrains
• Open guard edges and edge guards in simple polygons
• Walkability in polygons by two guards: a revisit
• Edge guards for polyhedra in three-space
• scientific article; zbMATH DE number 4060719
• On the number of guard edges of a polygon
• Guarding in a simple polygon
• Guarding a Polygon Without Losing Touch

Cites work

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

Cited in

(4)

• Edge guards in rectilinear polygons
• On the number of guard edges of a polygon
• Tight bounds for the number of edge guards for spiral polygons
• Open guard edges and edge guards in simple polygons

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

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