Adaptive medial-axis approximation for sphere-tree construction

ACM Transactions on Graphics

Volumn 23, Issue 1, 2004, Pages 1-26

  Bradshaw, Gareth ^a   O'Sullivan, Carol ^a  

^a TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

Animation; Collision handling; Medial axis approximation; Object approximation; Simulation level of detail

Indexed keywords

COLLISION HANDLING; MEDIAL AXIS APPROXIMATION; OBJECT APPROXIMATION; SIMULATION LEVEL-OF-DETAIL;

ALGORITHMS; ANIMATION; APPROXIMATION THEORY; COMPUTER SIMULATION; OBJECT RECOGNITION;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 12844259871     PISSN: 07300301     EISSN: 07300301     Source Type: Journal    
DOI: 10.1145/966131.966132     Document Type: Article

References (29)

1. BLUM, H. AND NAGEL, R. 1978. Shape description using weighted symmetric axis features. Patt. Rec. 10, 167-180.
2. BRADSHAW, G. May 2002. Bounding volume hierarchies for level-of-detail collision handling. Ph.D. dissertation, Trinity College Dublin, Ireland.
3. COHEN, J., LIN, M., MANOCHA, D., AND PONAMGI, M. 1995. I-COLLIDE: An interactive and exact collision detection system for large-scaled environments. In Proceedings of ACM Int. 3D Graphics Conference. ACM, New York, 189-196.
4. DINGLIANA, J. AND O'SULLIVAN, C. 2000. Graceful degradation of collision handling in physically based animation. Computer Graphics Forum (Proceedings, Eurographics 2000) 19, 3, 239-247.
5. GARLAND, M. 1999. Quadric-based polygonal surface simplification. Ph.D. dissertation, Carnegie-Mellon University, Pittsburgh, Pa.
6. GOTTSCHALK, S., LIN, M., AND MANOCHA, D. 1996. OBB-Tree: A hierarchical structure for rapid interference detection. In Proceedings of ACM SIGGRAPH '96. ACM, New York, 171-180.
7. HE, T. 1999. Fast collision detection using QuOSPO trees. In Proceedings of the 1999 Symposium on Interactive 3D graphics. 55-62.
8. HUBBARD, P. 1995a. Collision detection for interactive graphics applications. IEEE Trans. Visual. Comput. Graph. 1,3,218-230.
9. HUBBARD, P. 1995b. Collision detection for interactive graphics applications. Ph.D. dissertation. Dept. of Computer Science, Brown University, Providence, RI.
10. HUBBARD, P. 1995c. Real-time collision detection and time-critical computing. In Workshop On Simulation and Interation in Virtual Environments.
11. HUBBARD, P. 1996a. Approximating polyhedra with spheres for time-critical collision detection. ACM Trans. Graph. 15, 3, 179-210.
12. HUBBARD, P. 1996b. Improving accuracy in a robust algorithm for three-dimensional Voronoi diagrams. J. Graph. Tools 1, 1, 33-17.
13. KLOSOWSKI, J., HELD, M., MITCHELL, J., SOWIZRAL, H., AND ZIKAN, K. 1998. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Trans. Vis. Comput. Graph. 4, 1, 21-36.
14. KRISHNAN, S., GOPI, M., LIN, M., MANOCHA, D., AND PATTEKAR, A. 1998. Rapid and accurate contact determination between spline models using ShellTrees. In Proceedings of Eurographics'98. Vol. 17(3). 315-326.
15. KRISHNAN, S., PATTEKAR, A., LIN, M., AND MANOCHA, D. 1998. Spherical shells: A higher order bounding volume for fast proximity queries. In Proceedings of the 1998 Workshop on the Algorithmic Foundations of Robotics. 122-136.
16. LARSEN, E., GOTTSCHALK, S., LIN, M., AND MANOCHA, D. 1999. Fast proximity queries with swept sphere volumes. Tech. Rep. TR99-018, Dept. of Computer Science, University of North Carolina.
17. MOORE, M. AND WILHELMS, J. 1988. Collision detection and response for computer animation. Comput. Graph. 22 4, 289-298.
18. O'SULLIVAN, C. AND DINGLIANA, J. 1999. Realtime collision detection and response using sphere-trees. In Proceedings of the Spring Conference on Computer Graphics. 83-92.
19. O'SULLIVAN, C. AND DINGLIANA, J. 2001. Collisions and perception. ACM Trans. Graph. 20, 3, 151-168.
20. PALMER, I. AND GRIMSDALE, R. 1995. Collision detection for animation using sphere-trees. Comput. Graph. For. 14, 2, 105-116.
21. PONAMGI, M., MANOCHA, D., AND LIN, M. 1997. Incremental algorithms for collision detection between polygonal models. IEEE Trans. Vis. Comput. Graph. 2, 1, 51-64.
22. QUINLAN, S. 1994. Efficient distance computation between non-convex objects. In Proceedings International Conference on Robotics and Automation. 3324-3329.
23. RITTER, J. 1990. An efficient bounding sphere. In Graphics Gems, A. S. Glassner, Ed. Academic Press, Orlando, Fla., 301-303.
24. RUSINKIEWICZ, S. AND LEVOY, M. 2000. QSplat: A multiresolution point rendering system for large meshes. In Proceedings of ACM SIGGRAPH 2000, K. Akeley, Ed. ACM Press/ACM SIGGRAPH/Addison Wesley Longman, 343-352.
25. RUSINKIEWICZ, S. AND LEVOY, M. 2001. Streaming QSplat: A viewer for networked visualization of large, dense models. 2001 Symposium on Interactive 3D Graphics.
26. VAN DEN BERGEN, G. 1997. Efficient collision detection of complex deformable models using AABB trees. J. Graph. Tools 2, 4, 1-13.
27. WELTZ, E. 1991. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science, H. Maurer, Ed. 359-370.
28. WHITE, D. 2003. Smallest Enclosing Ball of Points /Balls.
29. WILSON, A., LARSEN, E., MANOCHA, D., AND LIN, M. 1998. IMMPACT: A system for interactive proximity queries on massive models. Tech. Rep. TR98-031, Dept. of Computer Science, University of North Carolina.