Binary Ostensibly‐Implicit Trees for Fast Collision Detection
暂无分享,去创建一个
Taku Komura | Christophe Dubach | Floyd M. Chitalu | Floyd M. Chitalu | T. Komura | Christophe Dubach
[1] Christer Ericson,et al. Real-Time Collision Detection , 2004 .
[2] Geoff Leach,et al. An adaptive octree grid for GPU-based collision detection of deformable objects , 2014, The Visual Computer.
[3] Dinesh Manocha,et al. Fast BVH Construction on GPUs , 2009, Comput. Graph. Forum.
[4] Tomas Akenine-Möller,et al. A dynamic bounding volume hierarchy for generalized collision detection , 2006, Comput. Graph..
[5] Marcus A. Magnor,et al. Geometry Presorting for Implicit Object Space Partitioning , 2012, Comput. Graph. Forum.
[6] Joseph S. B. Mitchell,et al. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..
[7] P. Cochat,et al. Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.
[8] Qi Mo,et al. Work distribution methods on GPUs , 2009 .
[9] Dinesh Manocha,et al. gProximity: Hierarchical GPU‐based Operations for Collision and Distance Queries , 2010, Comput. Graph. Forum.
[10] Andrew S. Grimshaw,et al. Scalable GPU graph traversal , 2012, PPoPP '12.
[11] Kirill Garanzha,et al. Simpler and faster HLBVH with work queues , 2011, HPG '11.
[12] J. Drife,et al. The third edition , 2014 .
[13] Dinesh Manocha,et al. GPU-Based Parallel Collision Detection for Real-Time Motion Planning , 2010, WAFR.
[14] John Salmon,et al. Automatic Creation of Object Hierarchies for Ray Tracing , 1987, IEEE Computer Graphics and Applications.
[15] Tero Karras,et al. Maximizing parallelism in the construction of BVHs, octrees, and k-d trees , 2012, EGGH-HPG'12.
[16] Marcus A. Magnor,et al. The Minimal Bounding Volume Hierarchy , 2010, VMV.
[17] MerrillDuane,et al. Scalable GPU graph traversal , 2012 .
[18] Alexander Keller,et al. Instant ray tracing: the bounding interval hierarchy , 2006, EGSR '06.
[19] Jacopo Pantaleoni,et al. HLBVH: hierarchical LBVH construction for real-time ray tracing of dynamic geometry , 2010, HPG '10.
[20] Dinesh Manocha,et al. PSCC: Parallel Self-Collision Culling with Spatial Hashing on GPUs , 2018, PACMCGIT.
[21] Ciprian Apetrei,et al. Fast and Simple Agglomerative LBVH Construction , 2014, TPCG.
[22] Ronald L. Rivest,et al. Introduction to Algorithms, third edition , 2009 .
[23] Gabriel Zachmann,et al. kDet: Parallel Constant Time Collision Detection for Polygonal Objects , 2017, Comput. Graph. Forum.
[24] Peter van Emde Boas,et al. Preserving order in a forest in less than logarithmic time , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[25] I. Wald,et al. On fast Construction of SAH-based Bounding Volume Hierarchies , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.
[26] Timo Aila,et al. On quality metrics of bounding volume hierarchies , 2013, HPG '13.
[27] Dinesh Manocha,et al. Efficient BVH‐based Collision Detection Scheme with Ordering and Restructuring , 2018, Comput. Graph. Forum.
[28] K. Garanzha. Efficient clustered BVH update algorithm for highly-dynamic models , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.
[29] Dinesh Manocha,et al. CAMA: Contact‐Aware Matrix Assembly with Unified Collision Handling for GPU‐based Cloth Simulation , 2016, Comput. Graph. Forum.
[30] Parris K. Egbert,et al. Lightweight Bounding Volumes for Ray Tracing , 2006, J. Graph. Tools.
[31] Daniel Kopta,et al. Fast, effective BVH updates for animated scenes , 2012, I3D '12.
[32] A. Kensler. Tree rotations for improving bounding volume hierarchies , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.
[33] Dinesh Manocha,et al. Collision-streams: fast GPU-based collision detection for deformable models , 2011, SI3D.
[34] Taku Komura,et al. Bulk-synchronous parallel simultaneous BVH traversal for collision detection on GPUs , 2018, I3D.