[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2005, Vol. 31 Issue (12) :1284-1288    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
��Ȩ�Ż�Լ��Delaunay���ǻ��㷨
���ܺ�1, ���2, ����1*
1. �������պ����ѧ �����ѧԺ, ���� 100083;
2. �������պ����ѧ ��е���̼��Զ���ѧԺ, ���� 100083
Conforming Delaunay triangulation optimized by weighted method
Meng Xianhai1, Li Jigang2, Yang Qin1*
1. School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, Beijing 100083, China;
2. School of Mechanical Engineering and Automation, Beijing University of Aeronautics and Astronautics, Beijing 100083, China

ժҪ
�����
�������
Download: PDF (441KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ Delaunayϸ���㷨��Ŀǰ�����Լ��Delaunay���ǻ��㷨����Ҫ˼��,�����Ҫ�������Լ�������в��ܰ����нǽ�С�ļ�ǵ�����,������Delaunayϸ���㷨�����ij������,��ͨ���ڼ�ǵ�ͼ�DZߴ������Ȩ��ʹ�ȨDelaunay��Բ/��׼��ķ��������һ�ִ�Ȩ�Ż�Լ��Delaunay���ǻ��㷨,����˾����ϸ���㷨�ڼ�Ǵ��㷨������ʱ�����븨�����������Լ����ศ���������,���㷨�������Խ����˷���,��������Ӧ���㷨Ӧ��ʵ��,����Ӧ���ڸ��Ӽ��ζ���Ŀ�ѧ����͹��̷���.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� �����ͼ��ѧ   �����ʷ�   �㷨   Լ��Delaunay���ǻ�   Delaunayϸ���㷨   ��Ȩ     
Abstract�� As a conforming Delaunay triangulation (CDT) algorithm, Delaunay refinement method has widely application both in theory and practice. It always fails to terminate when there are some small angles intersected by input geometry constraints, so a sufficient condition for termination of Delaunay refinement method was introduced and a new conforming Delaunay triangulation algorithm was presented, which is based on Delaunay refinement method and optimized by weighted method. The algorithm imposes no angle restrictions on the input geometry domains by setting weight value to point where input constraints intersected with small angles and applying the rule of weighted Delaunay circumcircle/circumsphere claim to generate Delaunay triangular mesh, and it avoids appending any additional complex region and need not adding any Steiner points to mesh. Analysis of termination and some results applied by this algorithm were also presented. This method will be useful in the computation and analysis of complicated geometry objects.
Keywords�� computer graphics   triangulation   algorithms   conforming Delaunay triangulation   Delaunay refinement   weighted     
Received 2004-09-09;
About author: ���ܺ�(1977-),��,������������,��ʿ��,x h meng@sina.com.
���ñ���:   
���ܺ�, ���, ����.��Ȩ�Ż�Լ��Delaunay���ǻ��㷨[J]  �������պ����ѧѧ��, 2005,V31(12): 1284-1288
Meng Xianhai, Li Jigang, Yang Qin .Conforming Delaunay triangulation optimized by weighted method[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2005,V31(12): 1284-1288
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2005/V31/I12/1284
Copyright 2010 by �������պ����ѧѧ��