Use of the spatial kD-tree in computational physics applications

Communications in Computational Physics

Volumn 2, Issue 3, 2007, Pages 545-576

  Khamayseh, A ^a   Hansen, G ^b  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

^b IDAHO NATIONAL LABORATORY   (United States)

Author keywords

Bounding volume hierarchy; Containment query; Geometric query; h refinement; Mesh generation; Remapping; SkD tree

Indexed keywords

EID: 36448961086     PISSN: 18152406     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. D. S. Miller, D. E. Burton and J. S. Oliviera, Efficient second order remapping on arbitrary two dimensional meshes, Technical Report UCRL-ID-123530, Lawrence Livermore National Laboratory, 1996.
2. E. Larsen, S. Gottschalk, M. C. Lin and D. Manocha, Fast proximity queries with swept sphere volumes, Technical Report TR99-018, University of North Carolina, Chapel Hill, 1999.
3. S. Gottschalk, M. C. Lin and D. Manocha, OBBTree: A hierarchical structure for rapid interference detection, in: Proceedings of ACM SIGGRAPH'96, 1996, pp. 171-180.
4. P. M. Hubbard, Approximating polyhedra with spheres for time-critical collision detection, ACM T. Graphics, 15(3) (1996), 179-210.
5. P. G. Xavier, A generic algorithm for constructing hierarchical representations of geometric objects, in: Proc. IEEE ICRA 1996, vol. 4, Minneapolis, 1996, pp. 3644-3651.
6. B. C. Ooi, Efficient query processing in geographic information systems, in: Lecture Notes in Computer Science, vol. 471, Spring-Verlag, 1990.
7. J. L. Bentley, Multidimensional binary search trees used for associative searching, Commun. ACM, 18 (1975), 509-517.
8. P. M. Hubbard, Collision detection for interactive graphics applications, PhD thesis, Department of Computer Science, Brown University, 1995.
9. + -tree: A dynamic index for multi-dimensional objects, in: Proc. 13th Int. Conf. Very Large Data Bases, Brighton, 1987, pp. 507-518.
10. D. E. Knuth, The Art of Computer Programming, vol. 3, 2 ed., Addison-Wesley, Reading, 1998.
11. R. L. Floyd and R. W. Rivest, Expected time bounds for selection, Commun. ACM, 18(3) (1975), 165-172.
12. C. A. R. Hoare, Quicksort, Comput. J., 5(1) (1962), 10-15.
13. A. Khamayseh and A. Kuprat, Hybrid curve point distribution algorithms, SIAM J. Sci. Comput., 23 (2002), 1464-1484.
14. R. Li, On multi-mesh h-adaptive methods, J. Sci. Comput., 24(3) (2005), 321-341.
15. J. K. Dukowicz, Conservative rezoning (remapping) for general quadrilateral meshes, J. Comput. Phys., 54 (1984), 411-424.
16. J. D. Ramshaw, Conservative rezoning algorithm for generalized two-dimensional meshes, J. Comput. Phys., 59 (1985), 193-199.
17. X. Jiao and M. T. Heath, Common-refinement-based data transfer between non-matching meshes in multiphysics simulations, Int. J. Numer. Meth. Engrg., 61 (2004), 2402-2427.