Premium
An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
Author(s) -
Bonet Javier,
Peraire Jaime
Publication year - 1991
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620310102
Subject(s) - intersection (aeronautics) , set (abstract data type) , algorithm , space (punctuation) , mathematics , object (grammar) , tree (set theory) , computer science , combinatorics , artificial intelligence , engineering , programming language , aerospace engineering , operating system
A searching algorithm is presented for determining which members of a set of n points in an N dimensional 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.