Abstract
Hyperoctree is a popular data structure for organizing multidimensional point data. The main drawback ofthi s data structure is that its size and the run-time of operations supported by it are dependent upon the distribution of the points. Clarkson rectified the distributiondependency in the size of hyperoctrees by introducing compressed hyperoctrees. He presents an O(n log n) expected time randomized algorithm to construct a compressed hyperoctree. In this paper, we give three deterministic algorithms to construct a compressed hyperoctree in O(n log n) time, for any fixed dimension d. We present O(log n) algorithms for point and cubic region searches, point insertions and deletions. We propose a solution to the N-body problem in O(n) time, given the tree. Our algorithms also reduce the run-time dependency on the number ofdi mensions.
This research is supported in part by ARO under DAAG55-97-1-0368, NSF CAREER under CCR-9702991 and Sandia National Laboratories. The content ofthe information does not necessarily reflect the position or the policy of the U.S. federal government, and no official endorsement should be inferred.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aluru, S.: Greengard’s N-body algorithm is not order N. SIAM Journal on Scientific Computing 17 (1996) 773–776.
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. 22
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. 22
Bern, M., Eppstein, D., Teng, S.H.: Parallel construction ofq uadtrees and quality triangulations. Proc. Workshop on Algorithms and Data Structures (1993) 188–199. 22, 25, 31
Bern, M.: Approximate closest-point queries in high dimensions. Information Processing Letters 45 (1993) 95–99. 22
Bespamyatnikh, S.N.: An optimal algorithm for closest-pair maintenance. Discrete Comput. Geom. 19 (1998) 175–195. 22
Callahan, P.B., Kosaraju, S.R.: A decomposition ofm ultidimensional point sets with applications to k-nearest neighbors and N-body potential fields. Journal of the ACM 42 (1995) 67–90. 28
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. 22, 22
Chazelle, B.: A theorem on polygon cutting with applications. Proc. Foundations of Computer Science (1982) 339–349. 22
Clarkson, K.L.: Fast algorithms for the All-Nearest-Neighbors problem. Proc. Foundations ofC omputer Science (1983) 226–232. 22, 23, 23, 31, 31
Cohen, R.F., Tamassia, R.: Combine and conquer. Algorithmica 18 (1997) 51–73. 22
Greengard, L., Rokhlin, V.: A fast algorithm for particle simulations. Journal of Computational Physics 73 (1987) 325–348. 28, 28
Frederickson, G.N.: A data structure for dynamically maintaining rooted trees. Proc. ACM-SIAM Symposium on Discrete Algorithms (1993) 175–194. 22
Mitchell, J.S.B., Mount, D.M., Suri, S.: Query-Sensitive ray shooting. International Journal ofC omputational Geometry and Applications 7 (1997) 317–347. 22
Schwarz, C., Smid, M., Snoeyink, J.: An optimal algorithm for the on-line closestpair problem. Algorithmica 12 (1994) 18–29. 22, 31
Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences 26 (1983) 362–391. 22
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.
Vaidya, P.M.: An O(n log n) algorithm for the All-Nearest-Neighbors problem. Discrete Computational Geometry 4 (1989) 101–115. 22
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aluru, S., Sevilgen, F.E. (1999). Dynamic Compressed Hyperoctrees with Application to the N-body Problem. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_2
Download citation
DOI: https://doi.org/10.1007/3-540-46691-6_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66836-7
Online ISBN: 978-3-540-46691-8
eBook Packages: Springer Book Archive