{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:12Z","timestamp":1720624932658},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4380,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s1571-0661(04)80982-4","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"133-145","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Computing Large Planar Regions in Terrains"],"prefix":"10.1016","volume":"46","author":[{"given":"Katharina","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Ray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Wendt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80982-4_NEWBIB1","doi-asserted-by":"crossref","unstructured":"P. K. Agarwal, T. Hagerup, R. Ray, M. Sharir, M. Smid, and E. Welzl. Translating a planar object to maximize point containment: exact and approximation algorithms. Manuscript, 2001.","DOI":"10.1007\/3-540-45749-6_8"},{"key":"10.1016\/S1571-0661(04)80982-4_NEWBIB2","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1137\/S0097539794269801","article-title":"Surface approximation and geometric partitions","volume":"27","author":"Agarwal","year":"1998","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S1571-0661(04)80982-4_NEWBIB3","unstructured":"N. M. Amato, M. T. Goodrich, and E. A. Ramos. Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pages 705\u2013706, 2000."},{"key":"10.1016\/S1571-0661(04)80982-4_NEWBIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02238188","article-title":"On a circle placement problem","volume":"36","author":"Chazelle","year":"1986","journal-title":"Computing"},{"key":"10.1016\/S1571-0661(04)80982-4_NEWBIB5","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S1571-0661(04)80982-4_NEWBIB6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","article-title":"On a class of O(n2) problems in computational geometry","volume":"5","author":"Gajentaan","year":"1995","journal-title":"Comput. Geom. Theory Appl"},{"key":"10.1016\/S1571-0661(04)80982-4_NEWBIB7","doi-asserted-by":"crossref","unstructured":"J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proc. 30th Annu. ACM Sympos. Theory Comput, pages 79\u201389, 1998.","DOI":"10.1145\/276698.276715"},{"key":"10.1016\/S1571-0661(04)80982-4_NEWBIB8","series-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"Mehlhorn","year":"1999"},{"key":"10.1016\/S1571-0661(04)80982-4_NEWBIB9","doi-asserted-by":"crossref","unstructured":"M. Thorup. Near-optimal fully-dynamic graph connectivity. In Proc. 32nd Annu. ACM Sympos. Theory Comput., 2000.","DOI":"10.1145\/335305.335345"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809824?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809824?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:10:55Z","timestamp":1585897855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104809824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":9,"alternative-id":["S1571066104809824"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80982-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}