{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:41:39Z","timestamp":1754487699976},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540548911"},{"type":"electronic","value":"9783540464594"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54891-2_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:16:38Z","timestamp":1330211798000},"page":"249-263","source":"Crossref","is-referenced-by-count":10,"title":["The TR*-tree: A new representation of polygonal objects supporting spatial queries and operations"],"prefix":"10.1007","author":[{"given":"Ralf","family":"Schneider","sequence":"first","affiliation":[]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Asano, Ta. & Te. Asano, \u2018Minimum Partition of Polygonal Regions into Trapezoids', in Proc. 24th IEEE Annual Symposium on Foundations of Computer Science, 233\u2013241, 1983.","DOI":"10.1109\/SFCS.1983.34"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger:\u2019 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles', Proc. ACM SIGMOD Int. Conf. on Management of Data, 322\u2013331, 1990.","DOI":"10.1145\/93597.98741"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"P.A. Burrough:\u2019 Principles of Geographical Information Systems for Land Resources Assessment', Oxford University Press, 1986","DOI":"10.1080\/10106048609354060"},{"key":"19_CR4","unstructured":"D.G. Gorny & Russ Carter World Data Bank II, General users Guide. Technical Report, U.S. Central Intelligence Agency, 1987."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Guttman A.,\u2019 R-trees: a dynamic index structure for spatial searching', in Proc. ACM SIGMOD Int. Conf. on Management of Data, 47\u201357, June 1984.","DOI":"10.1145\/602259.602266"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"H.-P. Kriegel, T. Brinkhoff, R. Schneider:\u2019 An Efficient Map Overlay Algorithm based on Spatial Access Methods and Computational Geometry', Proc. Int. Workshop on DBMS's for geographical applications, Capri, May 16\u201317, 1991","DOI":"10.1007\/978-3-642-77605-2_11"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"H.-P. Kriegel, P. Heep, S. Heep, M. Schiwietz, R. Schneider:\u2019 An Access Method Based Query Processor for Spatial Database Systems', Proc. Int. Workshop on DBMS's for geographical applications, Capri, May 16\u201317, 1991","DOI":"10.1007\/978-3-642-77605-2_15"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., H. Horn & M. Schiwietz:\u2019 The Performance of Object Decomposition Techniques for Spatial Query Processing', Proc. 2nd Symposium on Large Spatial Databases, Zurich, August 28\u201330, 1991","DOI":"10.1007\/3-540-54414-3_42"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"H.-P. Kriegel, M. Schiwietz, R. Schneider, B. Seeger:\u2019 Performance Comparison of Point and Spatial Access Methods', Proc. 1st Symp. on the Design of Large Spatial Databases, 1989 (Lecture Notes in Computer Science 409, Springer, 89\u2013114, 1990)","DOI":"10.1007\/3-540-52208-5_23"},{"issue":"No.10","key":"19_CR10","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","volume":"25","author":"J. Nievergelt","year":"1982","unstructured":"J. Nievergelt, F.P. Preparata:\u2019 Plane-Sweep Algorithms for Intersecting Geometric Figures', Comm. of the ACM, Vol. 25, No. 10, 739\u2013747, 1982","journal-title":"Comm. of the ACM"},{"key":"19_CR11","unstructured":"P.J.M. Oosterom:\u2019 Reactive Data Structures for Geographic Information Systems', PhD-thesis, Department of Computer Science at Leiden University, 1990"},{"key":"19_CR12","unstructured":"F.P. Preparata, M.I. Shamos:\u2019 Computational Geometry', Springer, 1988"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Scholl, M. & A. Voisard,\u2019 Thematic Map Modelling', in Proc. \u201cSymposium on the Design and Implementation of Large Spatial Databases\u201d, 167\u2013190, Santa Barbara, USA, July 1989.","DOI":"10.1007\/3-540-52208-5_27"},{"issue":"No.10","key":"19_CR14","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1109\/TC.1980.1675470","volume":"C-29","author":"R. B. Tilove","year":"1980","unstructured":"R.B. Tilove:\u2019 Set Membership Classification: A Unified Approach to Geometric Intersection Problems', IEEE Trans. on Computers, Vol. C-29, No. 10, 874\u2013883, 1980","journal-title":"IEEE Trans. on Computers"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry-Methods, Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54891-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:00:25Z","timestamp":1640923225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54891-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540548911","9783540464594"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-54891-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}