An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
作者:
Javier Bonet,
Jaime Peraire,
期刊:
International Journal for Numerical Methods in Engineering
(WILEY Available online 1991)
卷期:
Volume 31,
issue 1
页码: 1-17
ISSN:0029-5981
年代: 1991
DOI:10.1002/nme.1620310102
出版商: John Wiley&Sons, Ltd
数据来源: WILEY
摘要:
AbstractA searching algorithm is presented for determining which members of a set ofnpoints in anNdimensional space lie inside a prescribed space subregion. The algorithm is then extended to handle finite size objects as well as points. In this form it is capable of solving problems such as that of finding the objects from a given set which intersect with a prescribed object. The suitability of the algorithm is demonstrated for the problem of three dimensional unstructured mesh generation using the advancing front method.
点击下载:
PDF
(950KB)
返 回