[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2005, Vol. 31 Issue (07) :799-804    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
���ټ�����������֮�侫ȷ�Ӵ�λ�õ��㷨
��ѧ��, ������, ����ʤ, ������*
�������պ����ѧ ��е���̼��Զ���ѧԺ, ���� 100083
Algorithm of fast calculate exact contacted position among virtual objects
Chen Xuewen, Liu Jinghua, Chou Wusheng, Wang Tianmiao*
School of Mechanical Engineering and Automation, Beijing University of Aeronautics and Astronautics, Beijing 100083, China

ժҪ
�����
�������
Download: PDF (0KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ �ڴ���������������������ʵϵͳ��,���ټ�����������֮�侫ȷ�Ӵ�λ���Ǵ���������������ײ���ϵͳ��ǰ��.��������ϵͳ�������������Ƕ�����ģ������������ģ��,���ò�ΰ�Χ�з��ж������Ƿ��ཻ,����ཻ,���ñ�������Ķ�������㷨���ټ��������ĽӴ�λ��.���㷨�����ж���Щ�ཻ�����������滹��ͬ��,���������,���һ�������Ϊ�T2������һ��������T1����ƽ��Ľ���,Ȼ�����жϸý�����T1��֮���λ�ù�ϵ,���������Ч���ཻ�߶�;�����ͬ��,��Ҫ�ж�����������֮���໥λ�ù�ϵ,Ȼ��������Ե��������߶�֮��Ľ���,�Ӷ���������ε��ཻ����.�����ʵ����֤�˸��㷨����Ч�Ժ�³����.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� ��ײ���   ��Χ��   �Ӵ�λ��   ������Ƭ     
Abstract�� In the virtual reality interactive system of the force-feedback or touch-feedback,fast calculating exact contacted position among virtual objects is precondition of these collision detection systems. Because the model of these systems is most polygon model, the collision detection algorithm of hierarchy bounding box was taken to determine whether two objects contact or intersect, if intersected, the two-step algorithm was taken to detect thecontact position. At first, determine whether the intersected triangles are in the same plane or in the other plane; if in the other plane, calculate the intersected line of one triangle ��T2�� and the plane of another triangle ��T1��, then determine which line of the triangle ��T1�� that will intersect the intersected line, and calculate the intersected point, now the final intersected line is received at this case; if in the same plane, determine the relationship of the two triangles, and calculate the intersected point of the lines which are intersected, and do not calculate the intersected point of the lines which are not intersected( thus it conduce to the fastness of the algorithm), the final intersected region or lines is received at this case. Three examples show the effectiveness and robustness of the algorithm.
Keywords�� collision detection   bounding box   contacted position   triangle     
Received 2004-10-30;
Fund:

������Ȼ��ѧ����������Ŀ(60205005)

About author: ��ѧ��(1978-),��,����ʮ����,˶ʿ��, cxw@buaa.edu.cn.
���ñ���:   
��ѧ��, ������, ����ʤ, ������.���ټ�����������֮�侫ȷ�Ӵ�λ�õ��㷨[J]  �������պ����ѧѧ��, 2005,V31(07): 799-804
Chen Xuewen, Liu Jinghua, Chou Wusheng, Wang Tianmiao.Algorithm of fast calculate exact contacted position among virtual objects[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2005,V31(07): 799-804
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2005/V31/I07/799
Copyright 2010 by �������պ����ѧѧ��