Browse > Article

Robust GPU-based intersection algorithm for a large triangle set  

Kyung, Min-Ho (Ajou University)
Kwak, Jong-Geun (UDMTEK)
Choi, Jung-Ju (Ajou University)
Abstract
Computing triangle-triangle intersections has been a fundamental task required for many 3D geometric problems. We propose a novel robust GPU algorithm to efficiently compute intersections in a large triangle set. The algorithm has three stages:k-d tree construction, triangle pair generation, and exact intersection computation. All three stages are executed on GPU except, for unsafe triangle pairs. Unsafe triangle pairs are robustly handled by CLP(controlled linear perturbation) on a CPU thread. They are identified by floating-point filtering while exact intersection is computed on GPU. Many triangles crossing a split plane are duplicated in k-d tree construction, which form a lot of redundant triangle pairs later. To eliminate them efficiently, we use a split index which can determine redundancy of a pair by a simple bitwise operation. We applied the proposed algorithm to computing 3D Minkowski sum boundaries to verify its efficiency and robustness.
Keywords
triangle intersection; GPU; k-d tree; robustness; fioating-point filtering; CLP;
Citations & Related Records
연도 인용수 순위
  • Reference
1 I. Wald and V. Havran, "On building fast kd-trees for ray tracing, and on doing that in o(nlogn)," in Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, Jan 2006, pp. 61-69.
2 K. Zhou, Q. Hou, R. Wang, and B. Guo, "Real-time kd-tree construction on graphics hardware," ACM Transactions on Graphics, vol. 27, no. 5, pp. 126:1-126:11, Dec 2008.
3 W. Jung, H. Shin, and B. K. Choi, "Self-intersection removal in triangular mesh offsetting;' Computer-Aided Design and Applications, vol. 1, pp. 477-484, Jan 2004.   DOI
4 P. Volino and N. M. Thalmann, "Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity," Computer Graphics Forum, vol. 13, no. 3, pp. 155-166, August 1994.   DOI
5 M. Campen and L. Kobbelt, "Exact and robust (self) intersections for polygonal meshes," Computer Graphics Forum, vol. 29, no. 2, pp. 397-406, Jan 2010.
6 M. Campen and L. Kobbelt, "Polygonal boundary evaluation of minkowski sums and swept volums," Computer Graphics Forum, vol. 29, no. 5, pp. 1613-1622, 2010.
7 V. Milenkovic, E. Sacks, and M.-H. Kyung, "Robust minkowski sums of polyhedra via controlled linear perturbation," in Proceedings of Symposium on Solid and Physical Modeling 2010, Jan 2010, pp. 23-30.
8 M. Harris, S. Sengupta, and J. D. Owens, "Parallel prefix sum (scan) with cuda," in GPU Gems 3, H. Nguyen, Ed. Addison Wesley, August 2007, ch. 39, pp. 851-876.
9 S. Gottschalk, M.C. Lin, and D. Manocha, "Obbtree: A hierarchical structure for rapid interference detection," in Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, ser. SIGGRAPH'96. ACM, Jun 1996, pp. 171-180.
10 C. Lauterbach, M. Garland, S. Sengupta, D. Luebke, and D. Manocha, "Fast bvh construction on gpus," Eurographics 2009, vol. 28, no. 2, pp. 1-10, Dec 2009.
11 C. Lauterbach, Q. Mo, and D. Manocha, "gproximity: Hierarchical gpu-based operations for collision and distance queries," Computer Graphics Forum, Jan 2010.
12 H. Samet, The Design and Analysis of Spatial Data Structures. Addision-Wesley, 1989.
13 X. Zhang, Y. J. Kim, and D. Manocha, "Reliable sweeps," in 2009 SIAMIACM Joint Conference on Geometric and Solid Modeling. ACM, Aug 2009, pp. 373-378.
14 O. Tropp, A. Tal, and I. Shimshoni, "A fast triangle to triangle intersection test for collision detection," Computer Animation and Virtual Worlds, vol. 17, pp. 527-535, 2006.   DOI   ScienceOn
15 S. Abrams and P. K. Alien, "Computing swept volumes," Journal of Visualization and Computer Animation, vol. 11, pp. 69-82, Jan 2000.   DOI   ScienceOn
16 A. Requicha and H. Voelcker, "Boolean operations in solid modeling: Boundary evaluation and merging algorithms," in Proceedings of the IEEE, Jan 1985, pp. 30-44.
17 Y. J. Kim, G. Varadhan, M. C. Lin, and D. Manocha, "Fast swept volume approximation of complex polyhedral models," Computer-Aided Design, vol. 36, pp. 1013-1027, Jun 2004.   DOI   ScienceOn