Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs

DOI10.1016/j.comgeo.2010.07.002zbMath1202.65028MaRDI QIDQ709066

Menelaos I. Karavelas

Publication date: 15 October 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.07.002

zbMATH Keywords

triangulation graph; 2-dominance edge guards; curvilinear art galleries; mobile guards; piecewise-convex polygons

Mathematics Subject Classification ID

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

05C10: Planar graphs; geometric and topological aspects of graph theory

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

52C45: Combinatorial complexity of geometric structures

Related Items

Monitoring maximal outerplanar graphs, Guarding curvilinear art galleries with vertex or point guards, Applications of mathematics to maritime search, A tight bound for point guards in piecewise convex art galleries

Cites Work

• Unnamed Item
• Effective computational geometry for curves and surfaces
• Computational geometry in a curved world
• Guarding curvilinear art galleries with vertex or point guards
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• An algorithmic approach to some problems in terrain navigation
• A short proof of Chvatal's Watchman Theorem
• Edge guards in rectilinear polygons
• Protecting convex sets
• A combinatorial theorem in plane geometry
• Hybrid shadow testing scheme for ray tracing
• Illuminating high-dimensional convex sets
• Generalized guarding and partitioning for rectilinear polygons
• Guard placement for efficient point-in-polygon proofs
• Triangulation and shape-complexity
• Computational complexity of art gallery problems
• A combinational approach to polygon similarity