Fast penetration depth estimation using rasterization hardware and hierarchical refinement

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 386-387

  Kim, Young J ^a   Otaduy, Miguel A ^a   Lin, Ming C ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER HARDWARE; ESTIMATION; QUERY LANGUAGES;

RASTERIZATION HARDWARE;

COMPUTATIONAL GEOMETRY;

EID: 0038037582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777792.777856     Document Type: Conference Paper

References (3)

1. Y. Kim, K. Hoff, M. Lin, and D. Manocha. Closest point query among the union of convex polytopes using rasterization hardware. Journal of Graphics Tools, 7.4, 2002.
2. Y. Kim, M. Lin, and D. Manocha. Fast penetration depth estimation using rasterization hardware and hierarchical refinement. In International Workshop on Foundations of Robotics (WAFR), 12 2002.
3. Y. Kim, M. Otaduy, M. Lin, and D, Manocha. Fast penetration depth computation for physically-based animation. In ACM Symposium on Computer Animation, 2002.