{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:58Z","timestamp":1725663298252},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540159834"},{"type":"electronic","value":"9783540396840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15983-5_7","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:26:30Z","timestamp":1330194390000},"page":"80-92","source":"Crossref","is-referenced-by-count":0,"title":["Computational geometry: Selected algorithms and paradigms"],"prefix":"10.1007","author":[{"given":"Th.","family":"Ottmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TC.1980.1675628","volume":"C-29","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L., and Wood, D.: An Optimal Worst Case Algortihm for Reporting Intersections of Rectangles, IEEE Transactions on Computers C-29, 1980, 563\u2013580","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR2","unstructured":"Edelsbrunner, H.: Dynamic Data Structures for Orthogonal Intersection queries, IIG, Technische Univ. Graz, Austria, Rep. 59, Oct. 1980"},{"key":"7_CR3","unstructured":"Edelsbrunner, H., and van Leeuwen, J.: Multidimensional data structures and algorithms, A bibliography, IIG, Technische Univ. Graz, Rep. 104, 1983"},{"key":"7_CR4","unstructured":"G\u00fcting, R.H., and Schilling W.: A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem, Forschungsbericht 196, 1985, Universit\u00e4t Dortmund"},{"key":"7_CR5","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.: Finding Rectangle Intersections by divide-and-conquer, IEEE Transactions on Computers C-33, 1984, 671\u2013675","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR6","unstructured":"McCreight, E.M.: Efficient Algorithms for Enumerating Intersecting Intervals and Rectangles, Xerox Palo Alto Res. Ctr., Palo Alto, CA, Techn. Report. PARC CSL-80-9, 1980"},{"key":"7_CR7","unstructured":"McCreight, E.M.: Priority Search Trees, Xerox Palo Alto Res. Ctr., Palo Alto, CA, Techn. Report PARC CSL-80-5, 1981"},{"key":"7_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69900-9","volume-title":"Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry, Springer Verlag, N.Y., 1984"},{"issue":"12","key":"7_CR9","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","volume":"c-33","author":"D.T. Lee","year":"1984","unstructured":"Lee, D.T. and Preparata, F.P.: Computational Geometry \u2014 A Survey, IEEE Transactions on Computers, vol. c-33, no 12, 1984, 1072\u20131101","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., and Shamos, M.I.: Computational Geometry, Springer Verlag, N.Y., 1985"},{"key":"7_CR11","unstructured":"Shamos, M.I.: Computational Geometry, Ph. D. Dissertation, Yale University, 1978"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0196-6774(84)90027-0","volume":"5","author":"E. Soisalon-Soininen","year":"1984","unstructured":"Soisalon-Soininen, E., and Wood, D.: An Optimal Algorithm to Compute the Closure of a Set of Iso-Rectangles, J. Algorith., vol. 5, no 2, pp. 199\u2013214, June 1984","journal-title":"J. Algorith."},{"volume-title":"Computational Geometry","year":"1985","key":"7_CR13","unstructured":"Toussaint, G. (Ed.): Computational Geometry, Elsevier North Holland, N.Y., 1985"},{"key":"7_CR14","unstructured":"Wood, D.: An Isothetic View of Computational Geometry, Comp. Sc. Techn. Report CS-84-01, Jan. 1984, Univ. of Waterloo"}],"container-title":["Lecture Notes in Computer Science","EUROCAL '85"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15983-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:35Z","timestamp":1619557235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15983-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159834","9783540396840"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-15983-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}