Dynamic compressed hyperoctrees with application to the N-body problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1738, Issue , 1999, Pages 21-33

  Aluru, Srinivas ^a   Sevilgen, Fatih E ^b  

^a IOWA STATE UNIVERSITY   (United States)

^b SYRACUSE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; SOFTWARE ENGINEERING;

DETERMINISTIC ALGORITHMS; EXPECTED TIME; HEIDELBERG; N BODY PROBLEM; POINT DATA; POINT INSERTIONS; RANDOMIZED ALGORITHMS; REGION SEARCHES;

ALGORITHMS;

EID: 84958776347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46691-6_2     Document Type: Conference Paper

References (18)

1. Aluru, S.: Greengard’s N-body algorithm is not order N. SIAM Journal on Scientific Computing 17 (1996) 773-776.
2. Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching. Proc. ACM-SIAM Symposium on Discrete Algorithms (1994) 573-582.
3. Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of the ACM 45 (1998) 891-923.
4. Bern, M., Eppstein, D., Teng, S.H.: Parallel construction of quadtrees and quality triangulations. Proc. Workshop on Algorithms and Data Structures (1993) 188-199.
5. Bern, M.: Approximate closest-point queries in high dimensions. Information Processing Letters 45 (1993) 95-99.
6. Bespamyatnikh, S.N.: An optimal algorithm for closest-pair maintenance. Discrete Comput. Geom. 19 (1998) 175-195.
7. Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest neighbors and N-body potential fields. Journal of the ACM 42 (1995) 67-90.
8. Callahan, P.B., Kosaraju, S.R.: Algorithms for dynamic closest pair and n-body potential fields. Proc. ACM-SIAM Symposium on Discrete Algorithms (1995) 263-272.
9. Chazelle, B.: A theorem on polygon cutting with applications. Proc. Foundations of Computer Science (1982) 339-349.
10. Clarkson, K.L.: Fast algorithms for the All-Nearest-Neighbors problem. Proc. Foundations of Computer Science (1983) 226-232.
11. Cohen, R.F., Tamassia, R.: Combine and conquer. Algorithmica 18 (1997) 51-73.
12. Greengard, L., Rokhlin, V.: A fast algorithm for particle simulations. Journal of Computational Physics 73 (1987) 325-348.
13. Frederickson, G.N.: A data structure for dynamically maintaining rooted trees. Proc. ACM-SIAM Symposium on Discrete Algorithms (1993) 175-194.
14. Mitchell, J.S.B., Mount, D.M., Suri, S.: Query-Sensitive ray shooting. International Journal of Computational Geometry and Applications 7 (1997) 317-347.
15. Schwarz, C., Smid, M., Snoeyink, J.: An optimal algorithm for the on-line closest-pair problem. Algorithmica 12 (1994) 18-29.
16. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences 26 (1983) 362-391.
17. Teng, S.H.: Provably good partitioning and load balancing algorithms for parallel adaptive N-body simulations. SIAM Journal on Scientific Computing 19 (1998) 635-656.
18. Vaidya, P.M.: An O(n log n) algorithm for the All-Nearest-Neighbors problem. Discrete Computational Geometry 4 (1989) 101-115.