Ellipsoid-tree construction for solid objects

Proceedings - SPM 2007: ACM Symposium on Solid and Physical Modeling

Volumn , Issue , 2007, Pages 303-308

  Liu, Shengjun ^a   Wang, Charlie C L ^b   Hui, Kin Chuen ^b   Jin, Xiaogang ^a   Zhao, Hanli ^a  

^a ZHEJIANG UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bounding volume hierarchy; Ellipsoid tree; Shape approximation; Solid models; Volume approximation

Indexed keywords

BOUNDING VOLUME HIERARCHY; SHAPE APPROXIMATION; SOLID MODELS; VOLUME APPROXIMATION;

ALGORITHMS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; OBJECT RECOGNITION; OPTIMIZATION; ROBOTICS;

TREES (MATHEMATICS);

EID: 35348871020     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1236246.1236289     Document Type: Conference Paper

References (16)

1. BRADSHAW, G., AND O'SULLIVAN, C. 2002. Sphere-tree construction using dynamic medial axis approximation. In Proceedings of the 2002 ACM SIGGRAPH/Euro graphics symposium on Computer animation, ACM Press, New York, NY, USA, 33-40.
2. BRADSHAW, G., AND O'SULLIVAN, C. 2004. Adaptive medialaxis approximation for sphere-tree construction. ACM Transactions on Graphics 23, 1, 1-26.
3. CHOI, Y.-K., WANG, W., LIU, Y., AND KIM, M.-S. 2006. Continuous collision detection for elliptic disks. IEEE Transactions on Robotics 22, 2, 213-224.
4. COHEN-STEINER, D., ALLIEZ, P., AND DESBRUN, M. 2004. Variational shape approximation. ACM Transactions on Graphics 23, 3, 905-914.
5. GOTTSCHALK, S., LIN, M. C., AND MANOCHA, D. 1996. OBB-Tree: a hierarchical structure for rapid interference detection. In Proceedings of SIGGRAPH '96, ACM Press, New York, NY, USA, 171-180.
6. HUBBARD, P. M. 1995. Collision detection for interactive graphics applications. PhD thesis, Brown University.
7. HUBBARD, P. M. 1996. Approximating polyhedra with spheres for time-critical collision detection. ACM Transactions on Graphics 15, 3, 179-210.
8. KRISHNAN, S., PATTEKAR, A., LIN, M. C., AND MANOCHA, D. 1998. Spherical shell: a higher order bounding volume for fast proximity queries. In Proceedings of the Third Workshop on the Algorithmic Foundations of Robotics on Robotics: the Algorithmic Perspective, A. K. Peters, Ltd., Natick, MA, USA, 177-190.
9. LARSEN, E., GOTTSCHALK, S., LIN, M. C., AND MANOCHA, D. 2000. Fast distance queries with rectangular swept sphere volumes. In Proceedings of IEEE International Conference on Robotics and Automation, IEEE Press, 3719-3726.
10. LENGYEL, E. 2004. Mathematics for 3D Game Programming and Computer Graphics (2nd ed.). Hingham, Mass.: Charles River Media.
11. LLOYD, S. 1982. Least squares quantization in PCM. IEEE Transactions on Information Theory 28, 2, 129-137.
12. PALMER, I., AND GRIMSDALE, R. 1995. Collision detection for animation using sphere-trees. Computer Graphics Forum 14, 2, 105-116.
13. QUINLAN, S. 1994. Efficient distance computation between nonconvex object. In Proceedings of IEEE International Conference on Robotics and Automation, IEEE Press, 3324-3329.
14. VAN DEN BERGEN, G. 1997. Efficient collision detection of complex deformable models using AABB trees. Journal of Graphical Tools 2, 4, 1-13.
15. WANG, W., CHOI, Y.-K., CHAN, B., KIM, M.-S., AND WANG, J. 2004. Efficient collision detection for moving ellipsoids using separating planes. Computing 72, 1-2, 235-246.
16. WELTZ, E. 1991. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science, Springer-Verlag, H. Maurer, Ed., vol. 555 of Lecture Notes in Compututer Science, 359-370.