메뉴 건너뛰기




Volumn , Issue , 2006, Pages 1144-1153

Fast proximity computation among deformable models using discrete Voronoi diagrams

Author keywords

deformable collisions; distance fields; N body queries; penetration computation; self collisions

Indexed keywords

DEFORMABLE MODELS; DISCRETE VORONOI DIAGRAMS; DISTANCE COMPUTATION; DISTANCE FIELD; DYNAMIC ENVIRONMENTS; NOVEL ALGORITHM; ORDER OF MAGNITUDE; PROXIMITY QUERIES; SEPARATION DISTANCES; UNIFIED APPROACH; VORONOI;

EID: 77954016837     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1179352.1142006     Document Type: Conference Paper
Times cited : (42)

References (38)
  • 4
    • 77953829750 scopus 로고    scopus 로고
    • Robust treament for collisions, contact and friction for cloth animation
    • BRIDSON, R., FEDKIW, R., AND ANDERSON, J. 2002. Robust treament for collisions, contact and friction for cloth animation. Proc. of ACM SIGGRAPH, 594-603.
    • (2002) Proc. of ACM SIGGRAPH , pp. 594-603
    • Bridson, R.1    Fedkiw, R.2    Anderson, J.3
  • 7
    • 0035801068 scopus 로고    scopus 로고
    • Accurate and fast proximity queries between polyhedra using convex surface decomposition
    • EHMANN, S., AND LIN, M. C. 2001. Accurate and fast proximity queries between polyhedra using convex surface decomposition. Computer Graphics Forum (Proc. of Eurographics'2001) 20, 3, 500-510.
    • (2001) Computer Graphics Forum (Proc. of Eurographics'2001) , vol.20 , Issue.3 , pp. 500-510
    • Ehmann, S.1    Lin, M.C.2
  • 15
    • 84877625834 scopus 로고    scopus 로고
    • BD-Tree: Output-sensitive collision detection for reduced deformable models
    • JAMES, D. L., AND PAI, D. K. 2004. BD-Tree: Output-sensitive collision detection for reduced deformable models. Proc. of ACM SIGGRAPH, 393-398.
    • (2004) Proc. of ACM SIGGRAPH , pp. 393-398
    • James, D.L.1    Pai, D.K.2
  • 16
    • 14044277021 scopus 로고    scopus 로고
    • Unified distance queries in a heterogeneous model environment
    • JOHNSON, D. E., AND COHEN, E. 2004. Unified distance queries in a heterogeneous model environment. In ASME DETC.
    • (2004) ASME DETC
    • Johnson, D.E.1    Cohen, E.2
  • 17
    • 84969514471 scopus 로고    scopus 로고
    • Distance computation between non-convex polyhedra at short range based on discrete Voronoi diagrams
    • KAWACHI, K., AND SUZUKI, H. 2000. Distance computation between non-convex polyhedra at short range based on discrete Voronoi diagrams. IEEE Geometric Modeling and Processing, 123-128.
    • (2000) IEEE Geometric Modeling and Processing , pp. 123-128
    • Kawachi, K.1    Suzuki, H.2
  • 19
    • 1942453377 scopus 로고    scopus 로고
    • CInDeR: Collision and interference detection in real-time using graphics hardware
    • KNOTT, D., AND PAI, D. K. 2003. CInDeR: Collision and interference detection in real-time using graphics hardware. Proc. of Graphics Interface, 73-80.
    • (2003) Proc. of Graphics Interface , pp. 73-80
    • Knott, D.1    Pai, D.K.2
  • 21
    • 0038778001 scopus 로고    scopus 로고
    • Collision detection for continuously deforming bodies
    • LARSSON, T., AND AKENINE-MÖLLER, T. 2001. Collision detection for continuously deforming bodies. In Eurographics, 325-333.
    • (2001) Eurographics , pp. 325-333
    • Larsson, T.1    Akenine-Möller, T.2
  • 22
  • 23
    • 3042545450 scopus 로고    scopus 로고
    • Collision and proximity queries
    • 2nd Ed., J. E. Goodman and J. O'Rourke, Eds. CRC Press LLC, Boca Raton, FL, ch. 35
    • LIN, M. C., AND MANOCHA, D. 2004. Collision and proximity queries. In Handbook of Discrete and Computational Geometry, 2nd Ed., J. E. Goodman and J. O'Rourke, Eds. CRC Press LLC, Boca Raton, FL, ch. 35, 787-807.
    • (2004) Handbook of Discrete and Computational Geometry , pp. 787-807
    • Lin, M.C.1    Manocha, D.2
  • 24
    • 0032108781 scopus 로고    scopus 로고
    • V-Clip: Fast and robust polyhedral collision detection
    • July
    • MIRTICH, B. 1998. V-Clip: Fast and robust polyhedral collision detection. ACM Transactions on Graphics 17, 3 (July), 177-208.
    • (1998) ACM Transactions on Graphics , vol.17 , Issue.3 , pp. 177-208
    • Mirtich, B.1
  • 28
    • 34247175021 scopus 로고    scopus 로고
    • A fast method for local penetration depth computation
    • To Appear
    • REDON, S., AND LIN, M. 2006. A fast method for local penetration depth computation. Journal of Graphics Tools, To Appear.
    • (2006) Journal of Graphics Tools
    • Redon, S.1    Lin, M.2
  • 33
    • 33749240683 scopus 로고    scopus 로고
    • Tech. Rep. TR06-011, Dept of Computer Science, University of North Carolina
    • SUD, A., GOVINDARAJU, N., GAYLE, R., AND MANOCHA, D. 2006. Surface distance maps. Tech. Rep. TR06-011, Dept of Computer Science, University of North Carolina.
    • (2006) Surface Distance Maps
    • Sud, A.1    Govindaraju, N.2    Gayle, R.3    Manocha, D.4
  • 37
    • 0001779112 scopus 로고    scopus 로고
    • Efficient collision detection of complex deformable models using AABB trees
    • VAN DEN BERGEN, G. 1997. Efficient collision detection of complex deformable models using AABB trees. Journal of Graphics Tools 2, 4, 1-14.
    • (1997) Journal of Graphics Tools , vol.2 , Issue.4 , pp. 1-14
    • Van Den Bergen, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.