Guard placement for efficient point-in-polygon proofs

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 27-36

  Eppstein, David ^a   Goodrich, Michael T ^a   Sitchinava, Nodari ^a  

^a Irvine   (United States)

Author keywords

Angle guards; Approximation algorithm; Art gallery problem; Floodlights; Localization

Indexed keywords

MATHEMATICAL MODELS; OPTIMAL CONTROL SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

ANGLE GUARDS; APPROXIMATION ALGORITHM; ART GALLERY PROBLEMS; FLOODLIGHTS;

COMPUTATIONAL GEOMETRY;

EID: 35348858672     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247075     Document Type: Conference Paper

References (23)

1. L. Bao and J. Garcia-Luna-Aceves. Transmission scheduling in ad hoc networks with directional antennas, 2002.
2. P. Bose, L. J. Guibas, A. Lubiw, M. H. Overmars, D. L. Souvaine, and J. Urrutia. The floodlight problem. International Journal of Computational Geometry and Applications, 7(1/2):153-163, 1997.
3. N. Bulusu, J. Heidemann, and D. Estrin. GPS-less low cost outdoor localization for very small devices, 2000.
4. K. Chakrabarty, S. Iyengar, H. Qi, and E. Cho. Grid coverage of surveillance and target location in distributed sensor networks, 2002.
5. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485-524, 1991.
6. Y. Cho, L. Bao, and M. Goodrich. LAAC: A location-aware access control protocol. In International Workshop on Ubiquitous Access Control (IWUAC 2006), 2006.
7. V. Chvátal. A combinatorial theorem in plane geometry. J. Combin. Theory Ser. B, 18:39-41, 1975.
8. D. P. Dobkin, L. Guibas, J. Hershberger, and J. Snoeyink. An efficient algorithm for finding the CSG representation of a simple polygon. Algorithmica, 10:1-23, 1993.
9. V. Estivill-Castro, J. O'Rourke, J. Urrutia, and D. Xu. Illumination of polygons with vertex lights. Information Processing Letters, 56:9-13, 1995.
10. Z. Füredi and D. Kleitman. The prison yard problem. Combinatorica, 14:287-300, 1994.
11. M. T. Goodrich. Planar separators and parallel polygon triangulation. J. Comput. Syst. Sci., 51(3):374-389, 1995.
12. M. T. Goodrich. An improved ray shooting method for constructive solid geometry models via tree contraction. Internat. J. Comput. Geom. Appl., 8(1):1-24, 1998.
13. T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher. Range-free localization schemes in large scale sensor networks, 2003.
14. A. Howard, M. Mataric, and G. Sukhatme. Mobile sensor network deployment using potential fields: A distributed, 2002.
15. Y.-B. Ko, V. Shankarkumar, and N. H. Vaidya. Medium access control protocols using directional antennas in ad hoc networks. In INFOCOM (1), pages 13-21, 2000.
16. J. O'Rourke. Art Gallery Theorems and Algorithms. Number 3 in Int. Ser. Monographs on Computer Science. Oxford Univ. Press, 1987.
17. J. O'Rourke. Visibility. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 25, pages 467-480. CRC Press LLC, Boca Raton, FL, 1997.
18. J. O'Rourke. Computational Geometry Column 48. SIGACT News, 37(3):55-57, 2006.
19. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29(7):669-679, July 1986.
20. A. Sawides, C.-C. Han, and M. B. Strivastava. Dynamic fine-grained localization in ad-hoc networks of sensors. In Mobile Computing and Networking, pages 166-179, 2001.
21. W. Steiger and I. Streinu. Illumination by floodlights. Computational Geometry. Theory and Applications, 10(1):57-70, 1998.
22. J. Urrutia. Art gallery and illumination problems. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 973-1027. North-Holland, 2000.
23. R. J. Walker and J. Snoeyink. Practical point-in-polygon tests using CSG representations of polygons. In M. T. Goodrich and C. C. McGeoch, editors, Algorithm Engineering and Experimentation (Proc. ALENEX '99), volume 1619 of Lecture Notes Comput. Sci., pages 114-123. Springer-Verlag, 1999.