Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

Intersection algorithms on Cartesian mesh generation

ZHANG Li,HE Bing,FENG Weibing,ZHANG Wu(School of Computer Engineering and Science,Shanghai University,Shanghai 200072,China)  
To study the intersection judgment algorithms on Cartesian meshes and triangle surface meshes in 3D space,that is Alternating Digital Tree(ADT) algorithm and K-Dimensional(KD) tree algorithm,the sphere model and aircraft model are separately used to analyze ADT and KD tree,and the searching efficiency of the two trees during the quick intersection judgment process are compared.The results show that,ADT is more balanced and efficient than KD tree under the same model,and ADT has a less depth;the primary factor that influences the searching time of KD trees is the number of searching times.ADT has a higher performance for the quick intersection judgment.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved