Star-contours for efficient hierarchical self-collision detection

ACM Transactions on Graphics

Volumn 29, Issue 4, 2010, Pages

  Schvartzman, Sara C ^a   Pérez, Álvaro G ^a   Otaduy, Miguel A ^a  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION DETECTION; HIERARCHICAL COMPUTATION; HIERARCHICAL DATA STRUCTURE; SELF-COLLISION DETECTION; SELF-INTERSECTIONS; SURFACE PATCHES; TREE TRAVERSAL; TRIANGLE MESH;

ALGORITHMS; DATA STRUCTURES; DRUG PRODUCTS PLANTS; INTERACTIVE COMPUTER GRAPHICS;

TREES (MATHEMATICS);

EID: 77956369909     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/1778765.1778817     Document Type: Article

References (19)

1. ARVO, J., and KIRK, D. B. 1987. Fast ray tracing by ray classification. In Computer Graphics (Proceedings of SIGGRAPH 87), 55-64.
2. AVIS, D., and TOUSSAINT, G. T. 1981. An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognition 13, 6.
3. BACIU, G., and WONG, W. S.-K. 2002. Hardware-assisted selfcollision for deformable surfaces. Proc. of the ACM Symposium on Virtual Reality Software and Technology.
4. GOTTSCHALK, S. 2000. Collision Queries Using Oriented Bounding Boxes. PhD thesis, The University of North Carolina at Chapel Hill.
5. GOVINDARAJU, N., REDON, S., LIN, M., and MANOCHA, D. 2003. CULLIDE: Interactive collision detection between complex models in large environments using graphics hardware. Proc. of ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware, 25-32.
6. GOVINDARAJU, N. K., KNOTT, D., JAIN, N., KABUL, I., TAMSTORF, R., GAYLE, R., LIN, M. C., and MANOCHA, D. 2005. Interactive collision detection between deformable models using chromatic decomposition. Proc. of ACM SIGGRAPH.
7. GRINSPUN, E., and SCHRöDER, P. 2001. Normal bounds for subdivision-surface interference detection. Proc. of IEEE Visualization Conference.
8. JAMES, D. L., and PAI, D. K. 2004. BD-Tree: Output-sensitive collision detection for reduced deformable models. Proc. of ACM SIGGRAPH.
9. KARYPIS, G., and KUMAR, V. 1999. A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20, 1.
10. LEE, D. T., and PREPARATA, F. P. 1979. An optimal algorithm for finding the kernel of a polygon. Journal of the ACM 26, 3.
11. MEZGER, J., KIMMERLE, S., and ETZMUß, O. 2003. Hierarchical techniques in collision detection for cloth animation. Proc. of WSCG.
12. PROVOT, X. 1997. Collision and self-collision handling in cloth model dedicated to design garment. Proc. of 8th Eurographics Workshop on Computer Animation and Simulation, 177-189.
13. SCHVARTZMAN, S. C., GASCON, J., and OTADUY, M. A. 2009. Bounded normal trees for reduced deformations of triangulated surfaces. Proc. of ACM SIGGRAPH/Eurographics Symposium on Computer Animation.
14. SUD, A., GOVINDARAJU, N. K., GAYLE, R., KABUL, I., and MANOCHA, D. 2006. Fast proximity computation among multiple deformable models using discrete voronoi diagrams. Proc. of ACM SIGGRAPH.
15. TANG, M., CURTIS, S., YOON, S.-E., and MANOCHA, D. 2008. Interactive continuous collision detection between deformable models using connectivity-based culling. Proc. of ACM Symposium on Solid and Physical Modeling.
16. TESCHNER, M., HEIDELBERGER, B., MüELLER, M., POMERANETS, D., and GROSS, M. 2003. Optimized spatial hashing for collision detection of deformable objects. Proc. of Vision, Modeling and Visualization.
17. VAN DEN BERGEN, G. 1997. Efficient collision detection of complex deformable models using AABB trees. J. Graphics Tools 2, 4, 1-14.
18. VARADHAN, G., and MANOCHA, D. 2005. Star-shaped roadmaps - a deterministic sampling approach for complete motion planning. Proc. of Robotics: Science and Systems.
19. VOLINO, P., and MAGNENAT-THALMANN, N. 1994. Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity. Eurographics.