Abstract
In this paper, we discuss the problem of 0D feature-in-3D planar polygon. It has been recognized that 3D union and 3D intersections are among important spatial operators in 3D GIS. A 0D feature-in-polygon test is one of the problems in 3D GIS. Though it is a classic problem, however, it has not been addressed appropriately in the literature. Moreover, the 0D feature-in-polygon query is rather complicated if it is implemented into 3D spatial information system. From the aspect of 3D spatial analysis, the general 0D feature-in-3D planar polygon problem should be formulated in a suitable way. Our basic idea is to solve a general 0D feature-in-3D planar polygon problem that includes all special conditions. The method addresses an essential mathematical algorithm that applicable for real objects and provides an approach for implementation in further 3D analytical operation, e.g. 3D union or 3D intersection for 3D GIS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foley, J.D., A. van Dam, S.K. Feiner, J.F. Hughes (1990), ComputGraphics: Principles and Practice, 2nd Edition, Addison-Wesley.
Franklin, R. (2005), PNPOLY-Point inclusion in polygon test, http://www.ecse.rpi.edu/Homepages/wrf/geom/pnpoly.html
Haines, E. (1994a), point in polygon inside/outside code, http://www.acm.org/tog/GraphicsGems/gemsiv/ptpoly_haines/ptinpoly.c
Haines, E. (1994b), Point in polygon strategies, In: P. Heckbert (Ed.), Graphic Gems IV, Academic Press, Boston, MA, pp. 24–46.
Harrington, S. (1983), Computer Graphics: A Programming Approach, McGraw-Hill.
Mehlhorn, K., and S. Näher, (1999), LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press.
Nievergelt, J., and K. Hinrichs (1993), Algorithms and data structures: with applications to graphics and geometry, Prentice-Hall.
O’Rourke, J. (1998), Computational geometry in C, 2nd Edition, Cambridge University Press.
Sedgewick, R. (1998), Algorithms, 2nd Edition, Addison-Wesley.
Stein, B. (1997), A point about polygons, Linux Journal 35.
Theoharis, T., and A. Böhm (1999), Computer graphics: principles & algorithms, Symmetria.
Weiler, K. (1994), An incremental angle point in polygon test, In: P. Heckbert (Ed.), Graphic Gems IV, Academic Press, Boston, MA, pp. 16–23.
Woo, M., J. Neider, and T. Davis (1997), OpenGL programming guide, 2nd Edition, Addison-Wesley.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Khuan, C.T., Abdul-Rahman, A. (2006). 0-D Feature in 3D Planar Polygon Testing for 3D Spatial Analysis. In: Abdul-Rahman, A., Zlatanova, S., Coors, V. (eds) Innovations in 3D Geo Information Systems. Lecture Notes in Geoinformation and Cartography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36998-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-36998-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36997-4
Online ISBN: 978-3-540-36998-1
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)