An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- 1 January 1991
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 31 (1) , 1-17
- https://doi.org/10.1002/nme.1620310102
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fundamental Algorithms for Computer GraphicsPublished by Springer Nature ,1991
- Finite element Euler computations in three dimensionsInternational Journal for Numerical Methods in Engineering, 1988
- Adaptive remeshing for compressible flow computationsJournal of Computational Physics, 1987
- A vectorized “near neighbors” algorithm of order N using a monotonic logical gridJournal of Computational Physics, 1986
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Geometric intersection problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975