메뉴 건너뛰기




Volumn 5, Issue 2, 2011, Pages 230-237

An improved bounding box algorithm to collision detection for virtual environment

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; GEOMETRY; LEARNING ALGORITHMS; VIRTUAL REALITY;

EID: 79952801553     PISSN: 19759339     EISSN: None     Source Type: Journal    
DOI: 10.4156/jdcta.vol5.issue2.27     Document Type: Article
Times cited : (10)

References (23)
  • 1
    • 77950232773 scopus 로고    scopus 로고
    • Scalable parallel collion detection simulation
    • Ilan Grinberg, Yair Wiseman,Scalable parallel collion detection simulation. IIE Transactions,pp11-15,2006
    • (2006) IIE Transactions , pp. 11-15
    • Grinberg, I.1    Wiseman, Y.2
  • 4
    • 28444489586 scopus 로고    scopus 로고
    • Detection of collisions and self-collisions using image-space techniques
    • B. Heidelberger, M. Teschner and M. Gross. Detection of collisions and self-collisions using image-space techniques.In Proceedings of WSCG'04,pp.145-152,2004.
    • (2004) Proceedings of WSCG'04 , pp. 145-152
    • Heidelberger, B.1    Teschner, M.2    Gross, M.3
  • 5
    • 3042537690 scopus 로고    scopus 로고
    • Collision detection in interactive 3D environments
    • Morgan Kaufmann Publishers. Elsevier, San Francisco
    • G. Bergen. Collision Detection in Interactive 3D Environments. Morgan Kaufmann Publishers. Elsevier, San Francisco,2004.
    • (2004)
    • Bergen, G.1
  • 6
    • 84867950842 scopus 로고    scopus 로고
    • Algorithms for optimal area triangulations of a convex polygon
    • J.M. Keil, T. Vassilev, Algorithms for optimal area triangulations of a convex polygon,Computational Geometry:Theory and Ap-plications, vol. 35, no.3, pp.173-187, 2008.
    • (2008) Computational Geometry:Theory and Ap-plications , vol.35 , Issue.3 , pp. 173-187
    • Keil, J.M.1    Vassilev, T.2
  • 7
    • 0000940859 scopus 로고    scopus 로고
    • Finding the intersection of two convex polyhdra[J]
    • Muller D E, Preparat F.P. Finding the intersection of two convex polyhdra[J]. Theoretical Computer Science,vol.11,no.7,pp217-236,1999
    • (1999) Theoretical Computer Science , vol.11 , Issue.7 , pp. 217-236
    • Muller, D.E.1    Preparat, F.P.2
  • 8
    • 0024062045 scopus 로고
    • Collision detection and response for computer animation
    • Moore M, Wilhelms J. Collision detection and response for computer animation. Computer Fraphics, vol.22,no.4,pp289-298,1988
    • (1988) Computer Fraphics , vol.22 , Issue.4 , pp. 289-298
    • Moore, M.1    Wilhelms, J.2
  • 10
    • 8644271115 scopus 로고    scopus 로고
    • A fast algorithm to determine whether the intersection of the two convex regions is empty
    • Ren Shijun, Hong Bingrong, Men Qingxin. A Fast Algorithm to Determine Whether The Intersection of the two Convex Regions is Empty. Software Journal[J], vol.11,no.4,pp563-568,2000
    • (2000) Software Journal[J] , vol.11 , Issue.4 , pp. 563-568
    • Shijun, R.1    Bingrong, H.2    Qingxin, M.3
  • 14
    • 46749118954 scopus 로고    scopus 로고
    • Adjacency-based culling for continuous collision detection [J]
    • Springer
    • MIN TAMG, SEAN CURTIS, SUNG-EUI YOON, DINESH MANOCHA. Adjacency-based culling for continuous collision detection [J], The Visual Computer, Springer,Vol 24, no.7, pp.545-553,2008
    • (2008) The Visual Computer , vol.24 , Issue.7 , pp. 545-553
    • Tamg, M.1    Curtis, S.2    Yoon, S.-E.3    Manocha, D.4
  • 16
    • 33745767920 scopus 로고    scopus 로고
    • Adaptive stochastic collision detection between deformable objects using particle swarm optimization[C]
    • WANG TIANZHU. Adaptive Stochastic Collision Detection between Deformable Objects using Particle Swarm Optimization[C]. In Proceedings of EvoWorkshops 2006, EvoIASP, Budapest, Hungary, April 10-12. LNCS, Vol. 39,no.07,pp.450-459,2006.
    • (2006) Proceedings of EvoWorkshops 2006, EvoIASP, Budapest, Hungary, April 10-12. LNCS , vol.39 , Issue.7 , pp. 450-459
    • Tianzhu, W.1
  • 18
    • 33751508370 scopus 로고    scopus 로고
    • A fast triangle to triangle intersection test for collision detection
    • O. Tropp, A. Tal and I. Shimshoni, A fast triangle to triangle intersection test for collision detection, Computer Animation and Virtual Worlds. Vol. 17,no,5, pp. 527-535,2006.
    • (2006) Computer Animation and Virtual Worlds , vol.17 , Issue.5 , pp. 527-535
    • Tropp, O.1    Tal, A.2    Shimshoni, I.3
  • 19
    • 0035124984 scopus 로고    scopus 로고
    • Exact collision detection for a virtual manufacturing imulator
    • Rade Besic, Pat Banerjee, Exact collision detection for a virtual manufacturing imulator,IIE Transactions.pp.43-54,2006.
    • (2006) IIE Transactions , pp. 43-54
    • Besic, R.1    Banerjee, P.2
  • 20
    • 63749131778 scopus 로고    scopus 로고
    • Research of dynamic collision detection algorithm based on entity behaviors
    • Tian Zun-hua, Zhao Long, Research of dynamic collision detection algorithm based on entity behaviors,Journal of System Simulation.vol.21,no.5,pp.1380-1383,2009.
    • (2009) Journal of System Simulation , vol.21 , Issue.5 , pp. 1380-1383
    • Zun-hua, T.1    Long, Z.2
  • 22
    • 78651549754 scopus 로고    scopus 로고
    • A Parallel [22] Guowei Xue, Yan Zhang, a parallel backprojection algorithm for spiral cone-beam CT exact reconstruction
    • Guowei Xue, Yan Zhang, A Parallel [22] Guowei Xue, Yan Zhang, A Parallel Backprojection Algorithm for Spiral Cone-Beam CT Exact Reconstruction, JDCTA, Vol. 4, No. 6, pp. 134 - 143, 2010
    • (2010) JDCTA , vol.4 , Issue.6 , pp. 134-143
    • Xue, G.1    Zhang, Y.2
  • 23
    • 78651577203 scopus 로고    scopus 로고
    • 3D Face Recognition Using Face Feature Points Based on Parallel Stereo Vision
    • Li Wei, Eung-Joo Lee, 3D Face Recognition Using Face Feature Points Based on Parallel Stereo Vision, JDCTA, Vol. 4, No. 1, pp. 86 ~ 95, 2010
    • (2010) JDCTA , vol.4 , Issue.1 , pp. 86-95
    • Wei, L.1    Lee, E.-J.2


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