Convex hull covering of polygonal scenes for accurate collision detection in games

Proceedings - Graphics Interface

Volumn , Issue , 2008, Pages 203-210

  Liu, Rong ^a   Zhang, Hao ^a   Busby, James ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b Radical Entertainment ^*  (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION DETECTIONS; COMPLEX OBJECTS; CONSTRUCTION ALGORITHMS; CONVEX DECOMPOSITIONS; CONVEX HULLS; CONVEX OBJECTS; CONVEX POLYHEDRONS; DECOMPOSITION ALGORITHMS; GAME DEVELOPMENT; GAME ENVIRONMENTS; GEOMETRY PROBLEMS; REAL EXAMPLES; REAL-WORLD GAMES; SURFACE DECOMPOSITIONS;

GAME THEORY; MODEL STRUCTURES;

DECOMPOSITION;

EID: 63549114759     PISSN: 07135424     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. C. L. Bajaj and T. K. Dey. Convex decomposition of polyhedra and robustness. SIAM J. Comput., 21(2):339-364, 1992.
2. C. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hulls. ACM Trans. Math. Softw., 22(4):469-483, 1996. http://www.qhull.org.
3. B. Chazelle. Convex partitions of polyhedra: a lower bound and worst-case optima] algorithm. SIAM J. Comput., 13(3):488-507, 1984.
4. B. Chazelle, D. P. Dobkin, N. Shouraboura, and A. Tal. Strategies for polyhedral surface decomposition: An experimental study. In Proc. of Symposium on Computational Geometry, pages 297-305, 1995.
5. S. A. Ehmann and M. C. Lin. Accurate and fast proximity queries between polyhedra using convex surface decomposition. In Proc. of Eurographics' 01, volume 20, pages 500-510, 2001.
6. C. Ericson. Real-Time Collison Detection. Morgan Kaufmann, 2005.
7. E. Gilbert, D. Johnson, and S. S. Keerthis. A fast procedure for computing the distance between convex objects in three-dimensional space. IEEE Journal of Robotics and Automation, 4(2): 193-203, 1988.
8. P. Jimenez, F. Thomas, and C. Torras. 3d collision detection: a survey. Computers and Graphics, 25:269-285, 2001.
9. V. Kreavoy, D. Julius, and A. Sheffer. Model composition from interchangeable components. In Proc. of Pacific Graphics, pages 129-138, 2007.
10. J.-M. Lien and N. M. Amato. Approximate convex decomposition of polyhedra. In Proc. of ACM Symposium on Solid and Physical Modeling, pages 121-131, 2007.
11. M. Lin and S. Gottschalk. Collision detection between geometric models: a survey. In Proceedings of IMA, Conference of mathematics of surfaces, pages 602-608, 1998.
12. M. Lin and D. Manocha. Collision detection. In J. E. Goodman and J. O'Rourke, editors, Handbook of discrete and computational geometry, pages 787-807. Chapman & Hall, 2004.
13. L. Lu, Y. Choi, W. Wang, and M.-S. Kim. Variational 3d shape segmentation for bounding volume computation. Computer Graphics Forum, 26(3):329-338, 2007.
14. A. Mangan and R. Whitaker. Partitioning 3D surface meshes using watershed segmentation. IEEE Trans, on Visualization and Computer Graphics, 5(4):308-321, 1999.
15. S. Quinlan. Efficient distance computation between non-convex objects. In Proc. of Robotics and Automation, pages 3324-3329, 1994.
16. J. Ruppert and R. Seidel. On the difficulty of triangulating three-dimensional nonconvex polyhedra. Discrete Comput. Geom., 7(3):227-253, 1992.
17. A. Shamir. Segmentation and shape extraction of 3D boundary meshes. In Eurographics STAR, 2006.
18. O. Sorkine, D. Cohen-Or, R. Goldenthal, and D. Lischinski. Bounded-distortion piecewise mesh parameterization. In Proc. of IEEE Visualization, pages 355-362, 2002.
19. R. Wang, K. Zhou, J. Snyder, X. Liu, H. Bao, Q. Peng, and B. Guo. Variational sphere set approximation for solid objects. Vis. Comput., 22(9):612-621,2006.
20. H. Zhang and R. Liu. Mesh segmentation via recursive and visually salient spectral cuts. In Proc. of Vision, Modeling, and Visualization, pages 429-436, 2005.
21. E. Zuckerberger, A. Tal, and S. Shlafman. Polyhedral surface decomposition with applications. Computer and Graphics. 26(5):733-743, 2002.