{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:44Z","timestamp":1725456044975},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540543430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028255","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:52:14Z","timestamp":1132638734000},"page":"117-128","source":"Crossref","is-referenced-by-count":4,"title":["Shallow interdistance selection and interdistance enumeration"],"prefix":"10.1007","author":[{"given":"Jeffrey S.","family":"Salowe","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"P. K. Agarwal, B. Aronov, M. Sharir and S. Suri, Selecting Distances in the Plane, Sixth ACM Symposium on Computational Geometry, 1990, pp. 321\u2013331.","DOI":"10.1145\/98524.98597"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(77)90070-9","volume":"6","author":"J. Bentley","year":"1977","unstructured":"J. Bentley, D. Stanat and E. Williams, The Complexity of Finding Fixed-Radius Near Neighbors, Inf. Proc. Letters,\n6, 1977, pp. 209\u2013213.","journal-title":"Inf. Proc. Letters"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/BF00263295","volume":"24","author":"B. Chazelle","year":"1987","unstructured":"B. Chazelle, Some Techniques for Geometric Searching with Implicit Set Representations, Acta Informatica,\n24, 1987, pp. 565\u2013582.","journal-title":"Acta Informatica"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(90)90056-4","volume":"35","author":"M. T. Dickerson","year":"1990","unstructured":"M. T. Dickerson and R. L. S. Drysdale, Fixed-Radius Near Neighbors Search Algorithms for Points and Segments, Inf. Proc. Letters,\n35, 1990, pp. 269\u2013273.","journal-title":"Inf. Proc. Letters"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"M. T. Dickerson and R. L. S. Drysdale, Enumerating k Distances for n Points in the Plane, Seventh ACM Symposium on Computational Geometry, 1991.","DOI":"10.1145\/109648.109674"},{"key":"12_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer Verlag, New York, NY, 1985."},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0020-0190(89)90166-X","volume":"30","author":"J. S. Salowe","year":"1989","unstructured":"J. S. Salowe, L-Infinity Interdistance Selection by Parametric Search, Inf. Proc. Letters,\n30, 1989, pp. 9\u201314.","journal-title":"Inf. Proc. Letters"},{"key":"12_CR8","unstructured":"M. Smid, Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time, Universitat des Saarlandes 13\/90, 1990."},{"key":"12_CR9","unstructured":"M. Smid, Maintaining the Minimal Distance of a Point Set in Less Than Linear Time, Universitat des Saarlandes 06\/90, 1990."},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P. M. Vaidya","year":"1989","unstructured":"P. M. Vaidya, An O(n log n) Algorithm for the All-Nearest-Neighbors Problem, Discrete Comput. Geom.,\n4, 1989, pp. 101\u2013115.","journal-title":"Discrete Comput. Geom."},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A. C. Yao","year":"1982","unstructured":"A. C. Yao, On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems, Siam J. on Computing,\n11, 1982, pp. 721\u2013736.","journal-title":"Siam J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028255.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:58:32Z","timestamp":1607551112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540543430"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0028255","relation":{},"subject":[]}}