Guard placement for efficient point-in-polygon proofs

DOI10.1145/1247069.1247075zbMath1221.68267OpenAlexW1973622621MaRDI QIDQ3602853

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) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (max. 100)

A tight bound for point guards in piecewise convex art galleries ⋮ Improved Bounds for Wireless Localization ⋮ Coverage with \(k\)-transmitters in the presence of obstacles ⋮ Modem illumination of monotone polygons ⋮ Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon ⋮ Guarding curvilinear art galleries with vertex or point guards ⋮ Improved bounds for wireless localization ⋮ Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs ⋮ 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

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