The point in polygon problem for arbitrary polygons

Computational Geometry: Theory and Applications

Volumn 20, Issue 3, 2001, Pages 131-144

  Hormann, Kai ^a   Agathos, Alexander ^b  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Computational geometry; Integer algorithms; Point containment; Polygons; Winding number

Indexed keywords

EID: 0035499103     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00012-8     Document Type: Article

References (14)

1. Foley J.D., van Dam A., Feiner S.K., Hughes J.F. Computer Graphics: Principles and Practice. 2nd Edition :1990;Addison-Wesley.
2. R. Franklin, pnpoly, http://www.ecse.rpi.edu/Homepages/wrf/geom/pnpoly.html.
3. E. Haines, CrossingsMultiplyTest, http://www.acm.org/tog/GraphicsGems/gemsiv/ptpoly_haines/ptinpoly.c.
4. Haines E. Point in polygon strategies. Heckbert P. Graphic Gems IV. 1994;24-46 Academic Press, Boston, MA.
5. Harrington S. Computer Graphics: A Programming Approach. 1983;McGraw-Hill.
6. Mehlhorn K., Näher S. LEDA: A Platform for Combinatorial and Geometric Computing. 1999;Cambridge University Press.
7. Nievergelt J., Hinrichs K. Algorithms and Data Structures: With Applications to Graphics and Geometry. 1993;Prentice-Hall.
8. O'Rourke J. Computational Geometry in C. 2nd Edition :1998;Cambridge University Press.
9. Rogers D.F. Procedural Elements for Computer Graphics. 1985;McGraw-Hill.
10. Sedgewick R. Algorithms. 2nd Edition :1988;Addison-Wesley.
11. Stein B. A point about polygons. Linux Journal. 35:March 1997.
12. Theoharis T., Böhm A. Computer Graphics: Principles & Algorithms. 1999;Symmetria. (in Greek).
13. Weiler K. An incremental angle point in polygon test. Heckbert P. Graphic Gems IV. 1994;16-23 Academic Press, Boston, MA.
14. Woo M., Neider J., Davis T. OpenGL Programming Guide. 2nd Edition :1997;Addison-Wesley.