{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:25:11Z","timestamp":1725488711921},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668367"},{"type":"electronic","value":"9783540466918"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46691-6_2","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:42:24Z","timestamp":1186692144000},"page":"21-33","source":"Crossref","is-referenced-by-count":11,"title":["Dynamic Compressed Hyperoctrees with Application to the N-body Problem"],"prefix":"10.1007","author":[{"given":"Srinivas","family":"Aluru","sequence":"first","affiliation":[]},{"given":"Fatih E.","family":"Sevilgen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,6,9]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1137\/S1064827593272031","volume":"17","author":"S. Aluru","year":"1996","unstructured":"Aluru, S.: Greengard\u2019s N-body algorithm is not order N. SIAM Journal on Scientific Computing 17 (1996) 773\u2013776.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"2_CR2","unstructured":"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\u2013582. 22"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"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\u2013923. 22","journal-title":"Journal of the ACM"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bern, M., Eppstein, D., Teng, S.H.: Parallel construction ofq uadtrees and quality triangulations. Proc. Workshop on Algorithms and Data Structures (1993) 188\u2013199. 22, 25, 31","DOI":"10.1007\/3-540-57155-8_247"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(93)90222-U","volume":"45","author":"M. Bern","year":"1993","unstructured":"Bern, M.: Approximate closest-point queries in high dimensions. Information Processing Letters 45 (1993) 95\u201399. 22","journal-title":"Information Processing Letters"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/PL00009340","volume":"19","author":"S.N. Bespamyatnikh","year":"1998","unstructured":"Bespamyatnikh, S.N.: An optimal algorithm for closest-pair maintenance. Discrete Comput. Geom. 19 (1998) 175\u2013195. 22","journal-title":"Discrete Comput. Geom."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"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\u201390. 28","journal-title":"Journal of the ACM"},{"key":"2_CR8","unstructured":"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\u2013272. 22, 22"},{"key":"2_CR9","unstructured":"Chazelle, B.: A theorem on polygon cutting with applications. Proc. Foundations of Computer Science (1982) 339\u2013349. 22"},{"key":"2_CR10","unstructured":"Clarkson, K.L.: Fast algorithms for the All-Nearest-Neighbors problem. Proc. Foundations ofC omputer Science (1983) 226\u2013232. 22, 23, 23, 31, 31"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/PL00009160","volume":"18","author":"R.F. Cohen","year":"1997","unstructured":"Cohen, R.F., Tamassia, R.: Combine and conquer. Algorithmica 18 (1997) 51\u201373. 22","journal-title":"Algorithmica"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0021-9991(87)90140-9","volume":"73","author":"L. Greengard","year":"1987","unstructured":"Greengard, L., Rokhlin, V.: A fast algorithm for particle simulations. Journal of Computational Physics 73 (1987) 325\u2013348. 28, 28","journal-title":"Journal of Computational Physics"},{"key":"2_CR13","unstructured":"Frederickson, G.N.: A data structure for dynamically maintaining rooted trees. Proc. ACM-SIAM Symposium on Discrete Algorithms (1993) 175\u2013194. 22"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1142\/S021819599700020X","volume":"7","author":"J.S.B. Mitchell","year":"1997","unstructured":"Mitchell, J.S.B., Mount, D.M., Suri, S.: Query-Sensitive ray shooting. International Journal ofC omputational Geometry and Applications 7 (1997) 317\u2013347. 22","journal-title":"International Journal ofC omputational Geometry and Applications"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/BF01377181","volume":"12","author":"C. Schwarz","year":"1994","unstructured":"Schwarz, C., Smid, M., Snoeyink, J.: An optimal algorithm for the on-line closestpair problem. Algorithmica 12 (1994) 18\u201329. 22, 31","journal-title":"Algorithmica"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences 26 (1983) 362\u2013391. 22","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1137\/S1064827595288942","volume":"19","author":"S.H. Teng","year":"1998","unstructured":"Teng, S.H.: Provably good partitioning and load balancing algorithms for parallel adaptive N-body simulations. SIAM Journal on Scientific Computing 19 (1998) 635\u2013656.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P.M. Vaidya","year":"1989","unstructured":"Vaidya, P.M.: An O(n log n) algorithm for the All-Nearest-Neighbors problem. Discrete Computational Geometry 4 (1989) 101\u2013115. 22","journal-title":"Discrete Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46691-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T06:13:04Z","timestamp":1547878384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46691-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668367","9783540466918"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-46691-6_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}