{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T22:53:26Z","timestamp":1752101606206},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_8","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"73-85","source":"Crossref","is-referenced-by-count":1,"title":["Balanced Aspect Ratio Trees Revisited"],"prefix":"10.1007","author":[{"given":"Amitabh","family":"Chaudhary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching. In: Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pp. 573\u2013582 (1994)","key":"8_CR1"},{"doi-asserted-by":"crossref","unstructured":"Arya, S., Mount, D.M.: Approximate range searching. In: Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 172\u2013181 (1995)","key":"8_CR2","DOI":"10.1145\/220279.220298"},{"issue":"9","key":"8_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TSE.1979.234200","volume":"5","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Multidimensional binary search trees in database applications. IEEE Trans. Softw. Eng.\u00a0SE-5, 333\u2013340 (1979)","journal-title":"IEEE Trans. Softw. Eng. SE-"},{"doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: K-d trees for semidynamic point sets. In: Proc. 6th Annu. ACM Sympos. Comput. Geom., pp. 187\u2013197 (1990)","key":"8_CR5","DOI":"10.1145\/98524.98564"},{"key":"8_CR6","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 of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM\u00a042, 67\u201390 (1995)","journal-title":"J. ACM"},{"unstructured":"Callahan, P.B., Kosaraju, S.R.: Algorithms for dynamic closest-pair and n-body potential fields. In: Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pp. 263\u2013272 (1995)","key":"8_CR7"},{"unstructured":"Chaudhary, A., Goodrich, M.T.: Balanced aspect ratio trees revisited. Full version of the paper, \n                    \n                      http:\/\/www.cse.nd.edu\/~achaudha\/research","key":"8_CR8"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-45253-2_17","volume-title":"Algorithms - ESA 2000","author":"M. Dickerson","year":"2000","unstructured":"Dickerson, M., Duncan, C.A., Goodrich, M.T.: K-D trees are better when cut on the longest side. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 179\u2013190. Springer, Heidelberg (2000)"},{"unstructured":"Duncan, C.: Balanced Aspect Ratio Trees. PhD thesis, The Johns Hopkins University, Baltimore, Maryland (September 1999)","key":"8_CR10"},{"unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.: Balanced aspect ratio trees: combining the advantages of k-d trees and octrees. In: Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg., pp. 300\u2013309 (1999)","key":"8_CR11"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-37623-2_9","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"1999","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Balanced aspect ratio trees and their use for drawing very large graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 111\u2013124. Springer, Heidelberg (1999)"},{"issue":"3","key":"8_CR13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/964967.801134","volume":"17","author":"H. Fuchs","year":"1983","unstructured":"Fuchs, H., Abrams, G.D., Grant, E.D.: Near real-time shaded display of rigid objects. Comput. Graph.\u00a017(3), 65\u201372 (1983); Proc. SIGGRAPH 1983 (1983)","journal-title":"Comput. Graph."},{"issue":"3","key":"8_CR14","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/965105.807481","volume":"14","author":"H. Fuchs","year":"1980","unstructured":"Fuchs, H., Kedem, Z.M., Naylor, B.: On visible surface generation by a priori tree structures. Comput. Graph.\u00a014(3), 124\u2013133 (1980); Proc. SIGGRAPH 1980 (1980)","journal-title":"Comput. Graph."},{"doi-asserted-by":"crossref","unstructured":"Luebke, D., Erikson, C.: View-dependent simplification of arbitrary polygonal environments. In: Whitted, T. (ed.) SIGGRAPH 1997 Conference Proceedings, ACM SIGGRAPH. Annual Conference Series, pp. 199\u2013208. Addison Wesley, Reading (1997), ISBN 0-89791-896-7","key":"8_CR15","DOI":"10.1145\/258734.258847"},{"unstructured":"Lupton, R., Maley, F.M., Young, N.: Sloan digital sky survey, \n                    \n                      http:\/\/www.sdss.org\/sdss.html","key":"8_CR16"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1006\/jagm.1997.0922","volume":"27","author":"R. Lupton","year":"1998","unstructured":"Lupton, R., Maley, F.M., Young, N.: Data collection for the Sloan Digital Sky Survey\u2014A network-flow heuristic. Journal of Algorithms\u00a027(2), 339\u2013356 (1998)","journal-title":"Journal of Algorithms"},{"key":"8_CR18","volume-title":"Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods","author":"H. Samet","year":"1989","unstructured":"Samet, H.: Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods. Addison-Wesley, Reading (1989)"},{"key":"8_CR19","volume-title":"Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS","author":"H. Samet","year":"1990","unstructured":"Samet, H.: Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading (1990)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:05Z","timestamp":1605643805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11534273_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}