Point in solid strategies

Testing whether a point is inside a solid is a basic operation in computer graphics. This document presents a variety of strategies for triangle meshes, a widely used data structure in computer graphics. We discuss some issues about the capabilities of each approach depending on the situation, taking into account memory and CPU usage. A practical comparison of the performance of several strategies is also presented, with implementation issues and time tables showing the performance of each algorithm. The tests highlight the strengths and weaknesses of each approach.

[1]  Jeff Lane,et al.  An efficient point in polyhedron algorithm , 1984, Comput. Vis. Graph. Image Process..

[2]  Michael Abrash,et al.  Michael Abrash's Graphics Programming Black Book, with CD: The Complete Works of Graphics Master, Michael Abrash , 1997 .

[3]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[4]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[5]  Andrew S. Glassner,et al.  Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

[6]  Carlos Ureña,et al.  An Efficient Parametric Algorithm for Octree Traversal , 2000, WSCG.

[7]  Yehuda E. Kalay.  Determining the spatial containment of a point in general polyhedra , 1982, Comput. Graph. Image Process..

[8]  Andrew S. Glassner,et al.  An introduction to ray tracing , 1989 .

[9]  Alan Watt,et al.  3D Computer Graphics , 1993 .

[10]  Dean L. Taylor,et al.  A theorem to determine the spatial containment of a point in a planar polyhedron , 1989, Comput. Vis. Graph. Image Process..

[11]  Yehuda E. Kalay,et al.  Determining the spatial containment of a point in general polyhedra , 1982, Comput. Graph. Image Process..

[12]  Francisco R. Feito-Higueruela,et al.  Orientation, simplicity, and inclusion test for planar polygons , 1995, Comput. Graph..

[13]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[14]  Pere Brunet,et al.  Solid representation and operation using extended octrees , 1990, TOGS.

[15]  Tomas Akenine-Möller,et al.  Fast, Minimum Storage Ray-Triangle Intersection , 1997, J. Graphics, GPU, & Game Tools.

[16]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[17]  Daniel Cohen-Or,et al.  Volume graphics , 1993, Computer.

[18]  Shuhong Chen,et al.  Front-to-back display of BSP trees , 1991, IEEE Computer Graphics and Applications.

[19]  Irene Gargantini,et al.  Ray Tracing an Octree: Numerical Evaluation of the First Intersection , 1993, Comput. Graph. Forum.

[20]  Francisco R. Feito-Higueruela,et al.  Inclusion test for general polyhedra , 1997, Comput. Graph..