1 C. Lauterbach, "gproximity: Hierarchical gpu-based operations for collision and distance queries" 2010
2 H. Samet, "The Design and Analysis of Spatial Data Structures" Addision-Wesley 1989
3 신하용, "Self-intersection removal in triangular mesh offsetting" Computer Aided Design Solutions 1 (1): 477-484, 2004
4 V. Milenkovic, "Robust minkowski sums of polyhedra via controlled linear perturbation" 23-30, 2010
5 X. Zhang, "Reliable sweeps" ACM 373-378, 2009
6 K. Zhou, "Real-time kd-tree construction on graphics hardware" 27 (27): 126:1-126:11, 2008
7 M. Campen, "Polygonal boundary evaluation of minkowski sums and swept volums" 29 (29): 1613-1622, 2010
8 M. Harris, "Parallel prefix sum (scan) with cuda" Addison Wesley 851-876, 2007
9 I.Wald, "On building fast kd-trees for ray tracing, and on doing that in o(n log n)" 61-69, 2006
10 S. Gottschalk, "Obbtree: A hierarchical structure for rapid interference detection" ACM 171-180, 1996
1 C. Lauterbach, "gproximity: Hierarchical gpu-based operations for collision and distance queries" 2010
2 H. Samet, "The Design and Analysis of Spatial Data Structures" Addision-Wesley 1989
3 신하용, "Self-intersection removal in triangular mesh offsetting" Computer Aided Design Solutions 1 (1): 477-484, 2004
4 V. Milenkovic, "Robust minkowski sums of polyhedra via controlled linear perturbation" 23-30, 2010
5 X. Zhang, "Reliable sweeps" ACM 373-378, 2009
6 K. Zhou, "Real-time kd-tree construction on graphics hardware" 27 (27): 126:1-126:11, 2008
7 M. Campen, "Polygonal boundary evaluation of minkowski sums and swept volums" 29 (29): 1613-1622, 2010
8 M. Harris, "Parallel prefix sum (scan) with cuda" Addison Wesley 851-876, 2007
9 I.Wald, "On building fast kd-trees for ray tracing, and on doing that in o(n log n)" 61-69, 2006
10 S. Gottschalk, "Obbtree: A hierarchical structure for rapid interference detection" ACM 171-180, 1996
11 Y. J. Kim, "Fast swept volume approximation of complex polyhedral models" Pergamon Press Ltd. 36 (36): 1013-1027, 200409
12 C. Lauterbach, "Fast bvh construction on gpus" 28 (28): 1-10, 2009
13 M. Campen, "Exact and robust (self) intersections for polygonal meshes" 29 (29): 397-406, 2010
14 P. Volino, "Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity" 13 (13): 155-166, 1994
15 S. Abrams, "Computing swept volumes" 11 (11): 82-, 2000
16 A. Requicha, "Boolean operations in solid modeling: Boundary evaluation and merging algorithms" 30-44, 1985
17 O. Tropp, "A fast triangle to triangle intersection test for collision detection" 17 : 527-535, 2006