Fast collision detection between high resolution polygonal models
Graphical abstract
Display Omitted
References
[1]
A. Aguilera-García, F.J. Melero, F.R. Feito-Higueruela, Out-of-core real-time haptic interaction on very large models, Comput-Aided Des 77 (2016) 98–106,.
[2]
T. Akenine-Möller, E. Haines, N. Hoffman, Real-time rendering, CRC Press, ISBN 9781439865293, 2008.
[3]
Lin M., S. Gottschalk, Collision detection between geometric models: a survey, Proceedings of the IMA conference on mathematics of surfaces, 1, 1998, pp. 602–608.
[4]
O.S. Lawlor, L.V. Kalée, A voxel-based parallel collision detection algorithm, Proceedings of the 16th international conference on supercomputing, ACM, 2002, pp. 285–293.
[5]
J. Savall, D. Borro, J.J. Gil, L. Matey, Description of a haptic system for virtual maintainability in aeronautics, Proceedings of the IEEE/RSJ international conference on intelligent robots and systems, 3, 2002, pp. 2887–2892,.
[6]
A. Wilson, E. Larsen, D. Manocha, Lin M.C., Partitioning and handling massive models for interactive collision detection, Proceedings of the computer graphics forum, 18, Wiley Online Library, 1999, pp. 319–330.
[7]
A. Garcia-Alonso, N. Serrano, J. Flaquer, Solving the collision detection problem, IEEE Comput Graph Appl 14 (3) (1994) 36–43,.
[8]
D. Ayala, P. Brunet, R. Juan, I. Navazo, Object representation by means of nonminimal division quadtrees and octrees, ACM Trans Graph 4 (1) (1985) 41–59,.
[9]
H. Samet, M. Tamminen, Efficient component labeling of images of arbitrary dimension represented by linear bintrees, IEEE Trans Pattern Anal Mach Intell 10 (4) (1988) 579–586.
[10]
M. Held, J.T. Klosowski, J.S. Mitchell, Evaluation of collision detection methods for virtual reality fly-throughs, Proceedings of the Canadian conference on computational geometry, 1995, pp. 205–210.
[11]
H. Fuchs, Z.M. Kedem, B.F. Naylor, On visible surface generation by a priori tree structures, Proceedings of the ACM SIGGRAPH computer graphics, 14, ACM, 1980, pp. 124–133.
[12]
E. Welzl, Smallest enclosing disks (balls and ellipsoids), New results and new trends in computer science, Springer, 1991, pp. 359–370.
[13]
G.v.d. Bergen, Efficient collision detection of complex deformable models using AABB trees, J Graph Tools 2 (4) (1997) 1–13.
[14]
J. O’Rourke, Finding minimal enclosing boxes, Int J Comput Inf Sci 14 (3) (1985) 183–199.
[15]
J.T. Klosowski, M. Held, J.S. Mitchell, H. Sowizral, K. Zikan, Efficient collision detection using bounding volume hierarchies of k-dops, IEEE Trans Vis Comput Graph 4 (1) (1998) 21–36.
[16]
P.M. Hubbard, Real-time collision detection and time-critical computing, SIVE 95 (1995) 92–96.
[17]
S. Gottschalk, Lin M.C., D. Manocha, OBBTtree: a hierarchical structure for rapid interference detection, Proceedings of the 23rd annual conference on computer graphics and interactive techniques, ACM, 1996, pp. 171–180.
[18]
G. Zachmann, Rapid collision detection by dynamically aligned dop-trees, Proceedings of the 1998 Virtual Reality Annual International Symposium, IEEE, 1998, pp. 90–97.
[19]
S.-E. Yoon, B. Salomon, Lin M., D. Manocha, Fast collision detection between massive models using dynamic simplification, Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on geometry processing, ACM, 2004, pp. 136–146.
[20]
C. Ericson, Real-time collision detection, CRC Press, 2004.
[21]
E.G. Gilbert, D.W. Johnson, S.S. Keerthi, A fast procedure for computing the distance between complex objects in three-dimensional space, IEEE J Robot Autom 4 (2) (1988) 193–203.
[22]
Wang H., Defending continuous collision detection against errors, ACM Trans Graph 33 (4) (2014) 122:1–122:10,.
[23]
J.J. Jiménez, R.J. Segura, Collision detection between complex polyhedra, Comput Graph 32 (4) (2008) 402–411.
[24]
Chen Y., Wang C.C., Uniform offsetting of polygonal model based on layered depth-normal images, Comput-Aided Des 43 (1) (2011) 31–46.
[25]
D. Pavić, M. Campen, L. Kobbelt, Hybrid booleans, Computer graphics forum, 29, Wiley Online Library, 2010, pp. 75–87.
[26]
Douze M., Franco J.-S., Raffin B. QuickCSG: fast arbitrary Boolean combinations of n solids. arXiv preprint:1706015582017.
[27]
I. Carlbom, I. Chakravarty, D. Vanderschel, A hierarchical data structure for representing the spatial decomposition of 3d objects, in: Kunii T.L. (Ed.), Frontiers in computer graphics, Springer, Tokyo, Japan, ISBN 978-4-431-68025-3, 1985, pp. 2–12.
[28]
D. Ayala, P. Brunet, Juan R., I. Navazo, Object representation by means of nonminimal division quadtrees and octrees, ACM Trans Graph (TOG) 4 (1) (1985) 41–59.
[29]
N.K. Govindaraju, S. Redon, Lin M.C., D. Manocha, CULLIDE: interactive collision detection between complex models in large environments using graphics hardware, Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on graphics hardware, HWWS ’03, Eurographics Association, Aire-la-Ville, Switzerland, Switzerland, ISBN 1-58113-739-7, 2003, pp. 25–32. http://dl.acm.org/citation.cfm?id=844174.844178.
[30]
R. Weller, N. Debowski, G. Zachmann, kdet: Parallel constant time collision detection for polygonal objects, Comput Graph Forum 36 (2) (2017) 131–141,.
[31]
Wang T., Liu Z., Tang M., Tong R., D. Manocha, Efficient and reliable self-collision culling using unprojected normal cones, Proceedings of the computer graphics forum, 36, Wiley Online Library, 2017, pp. 487–498.
[32]
Wang Z., Tang M., Tong R., D. Manocha, TightCCD: efficient and robust continuous collision detection using tight error bounds, Comput Graph Forum 34 (7) (2015) 289–298,.
[33]
Tang M., D. Manocha, Lin J., Tong R., Collision-streams: fast GPU-based collision detection for deformable models, in: Garland M., Wang R. (Eds.), Proceedings of the symposium on interactive 3D graphics and games, I3D ’11, ACM, 2011, pp. 63–70,. http://doi.acm.org/10.1145/1944745.1944756.
[34]
Wang X., Tang M., D. Manocha, Tong R., Efficient BVH-based collision detection scheme with ordering and restructuring, Comput Graph Forum 37 (2) (2018) 227–237,.
[35]
Tang M., Liu Z., Tong R., D. Manocha, et al., I-Cloth: incremental collision handling for GPU-based interactive cloth simulation, Proceedings of the SIGGRAPH Asia 2018 technical papers, ACM, 2018, p. 204.
[36]
Lin M.C., J.F. Canny, A fast algorithm for incremental distance calculation, Proceedings of the 1991 IEEE international conference on robotics and automation, 1991, pp. 1008–1014vol.2,.
[37]
T. Möller, B. Trumbore, Fast, minimum storage ray/triangle intersection, Proceedings of the ACM SIGGRAPH 2005 Courses, SIGGRAPH ’05, ACM, New York, NY, USA, 2005, p. 7,. http://doi.acm.org/10.1145/1198555.1198746.
[38]
P. Cignoni, M. Callieri, M. Corsini, M. Dellepiane, F. Ganovelli, G. Ranzuglia, MeshLab: an open-source mesh processing tool, in: Scarano V., Chiara R.D., Erra U. (Eds.), Proceedings of the eurographics Italian chapter conference, The Eurographics Association, ISBN 978-3-905673-68-5, 2008,.
[39]
Larsen E, Gottschalk S, Lin MC, Manocha D. PQP -- a proximity query package; 1999 (accessed February 1, 2018). URL http://gamma.cs.unc.edu/SSV/.
[40]
Ehmann SA, Lin MC. SWIFT++: speedy walking via improved feature testing for non-convex objects; 2001 (accessed February 1, 2018). URL http://gamma.cs.unc.edu/SWIFT++/.
[41]
Lauterbach C, Mo Q, Manocha D. gProximity: hierarchical GPU-based operations for collision and distance queries; 2010 (accessed February 1, 2018). URL http://gamma.cs.unc.edu/GPUCOL/.
[42]
Tang M., Tong R., Wang Z., D. Manocha, Fast and exact continuous collision detection with Bernstein sign classification, ACM Trans Graph (TOG) 33 (6) (2014) 186.
[43]
S. Trenkel, R. Weller, G. Zachmann, A benchmarking suite for static collision detection algorithms, Proceedings of the international conference in central Europe on computer graphics, visualization and computer vision, 2007.
Index Terms
- Fast collision detection between high resolution polygonal models
Index terms have been assigned to the content through auto-classification.
Recommendations
Fast collision detection between massive models using dynamic simplification
SGP '04: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processingWe present a novel approach for collision detection between large models composed of tens of millions of polygons. Each model is represented as a clustered hierarchy of progressive meshes (CHPM). The CHPM is a dual hierarchy of the original model: it ...
Comparative investigation of GPU-accelerated triangle-triangle intersection algorithms for collision detection
AbstractEfficient collision detection is critical in 3D geometric modeling. In this paper, we first implement three parallel triangle-triangle intersection algorithms on a GPU and then compare the computational efficiency of these three GPU-accelerated ...
Fast collision detection for deformable models using representative-triangles
I3D '08: Proceedings of the 2008 symposium on Interactive 3D graphics and gamesWe present a new approach to accelerate collision detection for deformable models. Our formulation applies to all triangulated models and significantly reduces the number of elementary tests between features of the mesh, i.e., vertices, edges and faces. ...
Comments
Information & Contributors
Information
Published In
Elsevier Ltd.
Publisher
Pergamon Press, Inc.
United States
Publication History
Published: 01 October 2019
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Feb 2025