空间散乱点集Delaunay四面体剖分切割算法.pdfVIP

14 1 V ol. 14, No. 1 2002 1 JO U RN A L O F COM PU T ER-AI DED DESIGN CO M PU T ER G RA PHICS Jan., 2002 　 Delaunay 陈学工　　 潘　 懋 　　 10087 1) 　., Delaunay ,, Dela unay . “” 3 4 ) . De- la unay . 　 , Dela unay ,,, 　 O 18 Delaunay Triangulation Cutting Algorithm for A Set of Irregularly Located Spatial Points Chen X ueg ong　 Pan Mao Dep art ment of Geology , P ek in g Un iversity , B e ij ing　 10087 1) 　　 - - Abstract M aximum empty circle conv ex po lyg o n a nd maximum empty sphe re co nv ex po ly hedr on a re int roduced to co mpute triang ula tio n o n a set of irr egularly lo ca ted spatia l points. The domain bo unded by the conv ex hull o f a - , set o f spatia l points is div ided to ma ximum empty spher e co nv ex polyhedro ns fir stly then the triang ula tio n is fol- lo w ed inside these polyhedro ns . This me tho d successfully so lv es the deg eneracy pro blem o f mo re than thr ee po ints o n a pla ne sharing a co mmo n cir cle o r mo re tha n fo ur spa tial po ints sharing a commo n spher e. A po ssible er ro r o c- curring in a class o f triangulatio n alg o rithm s is pr esented in this paper. Key words　 ir reg ular ly lo ca ted points, Delaunay criterion , ma ximum empty-circle co nv ex po ly go n , maximum emp- - , ty spher e co nv ex polyhedro n conv ex hull , Delauna y 1　　　 . ,