Guarding curvilinear art galleries with vertex or point guards

DOI10.1016/j.comgeo.2008.11.002zbMath1169.65019OpenAlexW2065425028MaRDI QIDQ924067

Csaba D. Tóth, Elias P. Tsigaridas, Menelaos I. Karavelas

Publication date: 27 July 2009

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

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

zbMATH Keywords

algorithmnumerical examplesart galleryvertex guardspiecewise-convex polygonscurvilinear polygonspiecewise-concave polygonspoint guards

Mathematics Subject Classification ID

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

Related Items (3)

A tight bound for point guards in piecewise convex art galleries ⋮ Improved Bounds for Wireless Localization ⋮ Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
• Effective computational geometry for curves and surfaces
• Computational geometry in a curved world
• An algorithmic approach to some problems in terrain navigation
• Triangulating a simple polygon in linear time
• A short proof of Chvatal's Watchman Theorem
• A combinatorial theorem in plane geometry
• Hybrid shadow testing scheme for ray tracing
• Traditional Galleries Require Fewer Watchmen
• Guard placement for efficient point-in-polygon proofs
• Triangulation and shape-complexity
• Computational complexity of art gallery problems
• A combinational approach to polygon similarity
• Polygons Have Ears
• Location of a Point in a Planar Subdivision and Its Applications
• Illumination of convex discs

This page was built for publication: Guarding curvilinear art galleries with vertex or point guards