메뉴 건너뛰기




Volumn , Issue , 2009, Pages 205-212

A framework for benchmarking interactive collision detection

Author keywords

Benchmark; Collision detection; Framework

Indexed keywords

APPLICATION SCENARIO; BENCHMARK; COLLISION DETECTION; COLLISION DETECTION ALGORITHM; DEVELOPMENT TIME; FRAMEWORK; INTERACTIVE APPLICATIONS; MYRIAD FIELDS; OPEN SOURCES; TEST SPACE;

EID: 79958712234     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1980462.1980501     Document Type: Conference Paper
Times cited : (5)

References (39)
  • 2
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • BENTLEY, J. L. 1975. Multidimensional binary search trees used for associative searching. Communications of the ACM 18, 9 (Sept.), 509-517.
    • (1975) Communications of the ACM , vol.18 , Issue.9 SEPT. , pp. 509-517
    • Bentley, J.L.1
  • 3
    • 42549172448 scopus 로고    scopus 로고
    • 8 Feb.
    • BOOST, 2009. Boost C++ libraries, 8 Feb. http://www.boost.org/.
    • (2009) Boost C++ Libraries
  • 4
    • 79953055967 scopus 로고    scopus 로고
    • Master's thesis, Simon Fraser University, Burnaby, British Columbia, Canada
    • CAO, X. R. 2006. A Framework for Benchmarking Haptic Systems. Master's thesis, Simon Fraser University, Burnaby, British Columbia, Canada.
    • (2006) A Framework for Benchmarking Haptic Systems
    • Cao, X.R.1
  • 9
    • 79958703623 scopus 로고    scopus 로고
    • FUTUREMARK, 2009. 3DMark Vantage. http://www.futuremark.com/benchmarks/ 3dmarkvantage/introduction/.
    • (2009) 3DMark Vantage
  • 10
    • 0025385673 scopus 로고
    • Computing the distance between general convex objects in three-dimensional space
    • GILBERT, E. G., AND FOO, C.-P. 1990. Computing the distance between general convex objects in three-dimensional space. IEEE Transactions on Robotics and Automation 6, 1 (Feb.), 53-61.
    • (1990) IEEE Transactions on Robotics and Automation , vol.6 , Issue.1 FEB. , pp. 53-61
    • Gilbert, E.G.1    Foo, C.-P.2
  • 11
    • 0023998710 scopus 로고
    • A fast proceedure for computing the distance between complex objects in three-dimensional space
    • DOI 10.1109/56.2083
    • GILBERT, E. G., JOHNSON, D. W., AND KEERTHI, S. S. 1988. A fast proceedure for computing the distance between complex objects in three-dimensional space. IEEE Journal of Robotics and Automation 4, 2 (Apr.), 193-203. (Pubitemid 18639119)
    • (1988) IEEE journal of robotics and automation , vol.4 , Issue.2 , pp. 193-203
    • Gilbert Elmer, G.1    Johnson Daniel, W.2    Keerthi S.Sathiya3
  • 14
    • 0002885456 scopus 로고
    • A proposal for standard graphics environments
    • HAINES, E. 1987. A proposal for standard graphics environments. IEEE Computer Graphics and Applications 7, 11 (Nov.), 3-5.
    • (1987) IEEE Computer Graphics and Applications , vol.7 , Issue.11 NOV. , pp. 3-5
    • Haines, E.1
  • 16
    • 0035311963 scopus 로고    scopus 로고
    • 3D collision detection: A survey
    • DOI 10.1016/S0097-8493(00)00130-8, PII S0097849300001308
    • JIMÉNEZ, P., THOMAS, F., AND TORRAS, C. 2001. 3D collision detection: a survey. Computers & Graphics 25, 2 (Apr.), 269-285. (Pubitemid 32272850)
    • (2001) Computers and Graphics (Pergamon) , vol.25 , Issue.2 , pp. 269-285
    • Jimenez, P.1    Thomas, F.2    Torras, C.3
  • 17
    • 79958753755 scopus 로고    scopus 로고
    • Draft technical report on C++ library extensions
    • JTC1/SC22/WG21., 24 June
    • JTC1/SC22/WG21. 2005. Draft technical report on C++ library extensions. Tech. Rep. DTR 19768, ISO/IEC, 24 June.
    • (2005) Tech. Rep. DTR 19768, ISO/IEC
  • 18
    • 79958733127 scopus 로고    scopus 로고
    • KHRONOS GROUP, 20 Mar
    • KHRONOS GROUP, 2009. OpenGL, 20 Mar. http://www.opengl.org/.
    • (2009) OpenGL
  • 25
    • 3042545450 scopus 로고    scopus 로고
    • Collision and proximity queries
    • second ed, J. E. Goodman and J. O'Rourke, Eds. Chapman & Hall/CRC, Boca Raton, Florida, USA
    • LIN, M. C., AND MANOCHA, D. 2004. Collision and proximity queries. In Handbook of Discrete and Computational Geometry, second ed, J. E. Goodman and J. O'Rourke, Eds. Chapman & Hall/CRC, Boca Raton, Florida, USA, 787-807.
    • (2004) Handbook of Discrete and Computational Geometry , pp. 787-807
    • Lin, M.C.1    Manocha, D.2
  • 27
    • 0003095280 scopus 로고    scopus 로고
    • Efficient algorithms for two-phase collision detection
    • K. Gupta and A. P. del Pobil, Eds. Wiley, Chichester, Sussex, UK
    • MIRTICH, B. 1998. Efficient algorithms for two-phase collision detection. In Practical Motion Planning in Robotics: Current Approaches and Future Directions, K. Gupta and A. P. del Pobil, Eds. Wiley, Chichester, Sussex, UK, 203-223.
    • (1998) Practical Motion Planning in Robotics: Current Approaches and Future Directions , pp. 203-223
    • Mirtich, B.1
  • 28
    • 0032108781 scopus 로고    scopus 로고
    • V-Clip: Fast and robust polyhedral collision detection
    • 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 JULY , pp. 177-208
    • Mirtich, B.1
  • 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가 분석하여 추출한 것입니다.