{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:28Z","timestamp":1725456748345},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029604","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"165-172","source":"Crossref","is-referenced-by-count":0,"title":["Separating sets of hyperrectangles"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"d'Amore","sequence":"first","affiliation":[]},{"given":"Paolo Giulio","family":"Franciosa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"The Design of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho A. V., Hopcroft J. E. and Ullman J. D., The Design of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974."},{"issue":"9","key":"13_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. L. Bentley","year":"1975","unstructured":"Bentley J. L., \u201cMultidimensional binary search trees used for associative searching\u201d, Comm. ACML 18, 9 (Sept. 1975), 509\u2013517.","journal-title":"Comm. ACM"},{"issue":"2","key":"13_CR3","first-page":"179","volume":"2","author":"H. S. Baird","year":"1978","unstructured":"Baird H. S., \u201cFast Algorithms for LSI Artwork Analysis\u201d, Design Automat. Fault-Tolerant Comput. 2, 2 (1978), 179\u2013209.","journal-title":"Design Automat. Fault-Tolerant Comput."},{"key":"13_CR4","unstructured":"d'Amore F. and Franciosa P. G., \u201cStatic and Dynamic Management of Polylines in Geographical Applications\u201d, Dept. Computer and System Science, Univ. of Rome \u201cLa Sapienza\u201d, RAP.12.89, June 1989."},{"issue":"2","key":"13_CR5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0306-4379(89)90041-0","volume":"14","author":"C. Faloutsos","year":"1989","unstructured":"Faloutsos C. and Rego W., \u201cTri-cell\u2014A data structure for spatial objects\u201d, Information Systems, 14, 2 (1989), 131\u2013139.","journal-title":"Information Systems"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Guttman A., \u201cR-trees: a dynamic index structure for spatial searching\u201d, Proc. ACM SIGMOD, 1984.","DOI":"10.1145\/602259.602266"},{"issue":"7","key":"13_CR7","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1109\/TC.1984.5009341","volume":"c-33","author":"R. H. G\u00fcting","year":"1984","unstructured":"G\u00fcting R. H. and Wood D., \u201cFinding Rectangle Intersections by Divide-and-Conquer\u201d, IEEE Transactions on Computers c-33, 7 (1984), 671\u2013675.","journal-title":"IEEE Transactions on Computers"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Hasset J. E., \u201cAutomated Layout in ASHLER: an Approach to the Problem of General Cell Layout for VLSI\u201d, Proc. 19 th Design Automation Conference ACM, SIGDA, IEEE, 1982, 777\u2013784.","DOI":"10.1109\/DAC.1982.1585584"},{"key":"13_CR9","unstructured":"Hinrichs K. and Nievergelt J., \u201cThe grid file: a data structure designed to support proximity queries on spatial objects\u201d, Proc. Workshop on Graph Theoretic Concepts in Computer Science, Osnabruck, 1983, 100\u2013113."},{"issue":"3","key":"13_CR10","first-page":"241","volume":"2","author":"U. Lauther","year":"1978","unstructured":"Lauther U., \u201c4-dimensional Binary Search Trees as a mean to speed up associative searches in design-rule verification of integrated circuits\u201d, Design Automat. Fault-Tolerant Comput. 2, 3 (1978), 241\u2013247.","journal-title":"Design Automat. Fault-Tolerant Comput."},{"issue":"2","key":"13_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"Lipton R. J. and Tarjan R. E., \u201cA Separator Theorem for Planar Graphs\u201d, SIAM J. Appl. Math. 36, 2 (1979), 177\u2013189.","journal-title":"SIAM J. Appl. Math."},{"key":"13_CR12","volume-title":"Introduction to VLSI systems","author":"C. A. Mead","year":"1979","unstructured":"Mead C. A. and Conway L., Introduction to VLSI systems, Addison-Wesley, Reading, Mass., 1979."},{"issue":"3","key":"13_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0734-189X(84)90215-9","volume":"26","author":"T. Matsuyama","year":"1984","unstructured":"Matsuyama T., Hao L. and Nagao M., \u201cA file organization for geographic information systems based on spatial proximity\u201d, Comp. Vision and Image Process. 26, 3 (1984), 303\u2013318.","journal-title":"Comp. Vision and Image Process."},{"issue":"1","key":"13_CR14","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt J., Hinterberger H. and Sevcik K. C., \u201cThe Grid File: An Adaptable, Symmetric Multikey File Structure\u201d, ACM Trans. on Database Systems 9, 1 (March 1984), 38\u201371.","journal-title":"ACM Trans. on Database Systems"},{"issue":"2","key":"13_CR15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1145\/356770.356777","volume":"11","author":"G. Nagy","year":"1979","unstructured":"Nagy G. and Wagle S., \u201cGeographic data processing\u201d, ACM Computing Surveys 11, 2 (1979), 139\u2013181.","journal-title":"ACM Computing Surveys"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Robinson J. T., \u201cThe K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes\u201d, Proc. ACM SIGMOD, Ann Arbor, Michigan, 1981.","DOI":"10.1145\/582318.582321"},{"issue":"4","key":"13_CR17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/50020.50021","volume":"20","author":"H. Samet","year":"1988","unstructured":"Samet H., \u201cHierarchical Representation of Collections of Small Polygons\u201d, ACM Computing Surveys 20, 4 (1988), 271\u2013309.","journal-title":"ACM Computing Surveys"},{"key":"13_CR18","unstructured":"Samet H., Rosenfeld A., Shaffer C. A. and Webber R. E., \u201cUse of hierarchical data structures in geographic information systems\u201d, Proc. of the Int. Symp. on Spatial Data Handling, Zurich 1984, vol. 2, edited by Marble, Brassle, Peuquet and Kishomoto, 392\u2013411."},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BF01933636","volume":"20","author":"H. W. Six","year":"1980","unstructured":"Six H. W. and Wood D., \u201cThe rectangle intersection problem revisited\u201d, BIT 20, 1980, 426\u2013433.","journal-title":"BIT"},{"issue":"3","key":"13_CR20","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/282957.282966","volume":"4","author":"H. Samet","year":"1985","unstructured":"Samet H. and Webber E., \u201cStoring a collection of polygons using quadtrees\u201d, ACM Trans. on Graphics 4, 3 (1985), 182\u2013222.","journal-title":"ACM Trans. on Graphics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:32Z","timestamp":1586592932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0029604","relation":{},"subject":[]}}