The multi-LREP decomposition of solids and its application to a point-in-polyhedron inclusion test
- 71 Downloads
This paper presents a scheme for decomposing polyhedra called multi-LREP. The scheme is based on the L-REP decomposition, which classifies the triangular faces of a polyhedron into a set of layered tetrahedra. In the multi-LREP these layered tetrahedra are grouped into regions of a space subdivision. The paper also describes an efficient method for constructing the L-REP decomposition and how the multi-LREP can be applied to speed up two L-REP applications: the point-in-polyhedron inclusion test and the ray-scene intersection. An experimental comparison with other point-in-polyhedron tests is presented as well.
Unable to display preview. Download preview PDF.
- 1.Akenine, M., Haines, E.: Real-time Rendering, 2nd edn. A.K. Peters, Natick (2002), p. 835 Google Scholar
- 5.Glassner, A.S.: Space subdivision for fast ray tracing. IEEE Comput. Graph. Appl. 4(10), 15–22 (1984) Google Scholar
- 6.Haines, E.: Point in polygon strategies. In: Heckbert, P. (ed.) Graphics Gems IV, pp. 24–45. Academic Press, San Diego (1994) Google Scholar