DOI: 10.7763/IJCTE.2017.V9.1136
Inclusion Test for Polyhedra Using Depth Value Comparisons on the GPU
Abstract—This paper presents a novel method for testing the inclusion status between the points and boundary representations of polyhedra. The method is executed entirely on the GPU and is characterized by memory efficiency, fast execution and high integrability. It is a variant of the widely known ray-crossing method. However, in our case, the intersections are counted by comparing the depths, obtained from the points and the models' surfaces. The odd-even rule is then applied to determine the inclusion status. The method is conceptually simple and, as most of the work is done implicitly by the GPU, easy to implement. It executes very fast and uses about 75% less GPU memory than the LDI method to which it was compared.
Index Terms—Inclusion test, GPU processing, computational geometry, polyhedron, point containment.
Denis Horvat and Borut Žalik are with the Faculty of Electrical Engineering and Computer Science, Maribor, Slovenia (e-mail: {denis.horvat, borut.zalik}@ um.si).
Cite:D. Horvat and B. Žalik, "Inclusion Test for Polyhedra Using Depth Value Comparisons on the GPU," International Journal of Computer Theory and Engineering vol. 9, no. 2, pp. 137-141, 2017.