Guard placement for efficient point-in-polygon proofs

DOI10.1145/1247069.1247075MaRDI QIDQ3602853zbMATH OpenOpenAlexFDO

Authors David Eppstein, Nodari Sitchinava, Michael T. Goodrich

Publication date 12 February 2009

Published in Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1247069.1247075

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Art gallery theorems for guarded guards.
• An efficient algorithm for guard placement in polygons with holes
• scientific article; zbMATH DE number 177851
• Guards, Galleries, Fortresses, and the Octoplex
• COMPUTATIONAL GEOMETRY COLUMN 15

Cited in

(10)

• Modem illumination of monotone polygons
• Coverage with k-transmitters in the presence of obstacles
• A time-space trade-off for computing the k-visibility region of a point in a polygon
• Solving the natural wireless localization problem to optimality efficiently
• A tight bound for point guards in piecewise convex art galleries
• Time-space trade-off for finding the k-visibility region of a point in a polygon
• Improved Bounds for Wireless Localization
• Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
• Guarding curvilinear art galleries with vertex or point guards
• Improved bounds for wireless localization

This page was built for publication: Guard placement for efficient point-in-polygon proofs

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