STL模型的分层邻接排序快速切片算法_王素.pdfVIP

23 4 V ol . 2 3 N o. 4 2011 4 Jo ur nal of Co mputerA ided Design Computer G raphics Apr. 20 11 STL 王 素, 刘 恒, 朱心雄 ( 100 19 1) ( w ang su 2000@ b uaa . edu . cn) ST L , , ST L . , , 2 , . ST L , , , . , . ST L ; ; ; ; T P39 1. 7 An Algorithm for Rapid Slicing of STL Model Based on Sorting by Triangle Adjacency in Layers Wang Su, L iu H eng , and Zhu Xinxiong (School of Tr ansp ortation Science and E ngineer ing , B eihang University , Beij ing 100 19 1) Abstract A n alg orit hm f or rapid slicing of ST L model b ased o n sort ing by t riang le adjacency in layers is proposed , w hich establishes adjacency relat ionship bet w een tr iangle meshes by ado pt ing met hod of adjacency in sert ion . T he slicing planes int ersect ing w it h t he t riang le meshes are det ermined by slicing precision associat ed w ith minimum and m ax imum values of project ion of each v ert ex of t riangles on no rmal direct ion of t he sl icing plane. T hrough co mparing t he relation ship s bet w een the com mon edge of t w o adjacent t riang le meshes and t he slicing plane, int ersect ion link list s ar e est ablished . In cont rast to ex ist ing algo rit hms based on com plet e t opolo gical infor matio n reco nst ruct io n and g rouping sort , t his algorit hm does not r equ ire complete to po logical inf orm ation and gr oup ing sort but r ecords the adjacency relat ion ship of t riang le meshes int o int ersectio n link list in o rder to save system resources and increase sl icing eff iciency . T he f easibilit y and ef ficiency of this algorit hm is validat ed by t est ing on a ST L model of p ist on . Key words