{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:29Z","timestamp":1760441069182},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625926"},{"type":"electronic","value":"9783540683230"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62592-5_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:43:17Z","timestamp":1330296197000},"page":"100-109","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maintaining maxima under boundary updates"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"d'Amore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo Giulio","family":"Franciosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Giaccio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"10_CR1","volume-title":"Technical report","author":"F. d'Amore","year":"1996","unstructured":"F. d'Amore and R. Giaccio. Simplified hive-graphs with boundary updates. Technical report, Univ. \u201cLa Sapienza,\u201d Roma, 1996. Submitted."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187797","volume":"5","author":"G. Frederickson","year":"1990","unstructured":"G. Frederickson and S. Rodger. A new approach to the dynamic maintenance of maximal points in a plane. Discrete Comput. Geom., 5:365\u2013374, 1990.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0196-6774(89)90011-4","volume":"10","author":"R. H. G\u00fcting","year":"1989","unstructured":"R. H. G\u00fcting, O. Nurmi, and T. Ottmann. Fast algorithms for direct enclosures and direct dominances. J. Algorithms, 10:170\u2013186, 1989.","journal-title":"J. Algorithms"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci., Lecture Notes in Computer Science, pages 8\u201321, 1978.","DOI":"10.1109\/SFCS.1978.3"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0190(91)90010-F","volume":"40","author":"R. Janardan","year":"1991","unstructured":"R. Janardan. On the dynamic maintenance of maximal points in the plane. Inform. Process. Lett., 40:59\u201364, 1991.","journal-title":"Inform. Process. Lett."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"S. Kapoor. Dynamic maintenance of maximas of 2-d point sets. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 140\u2013149, 1994.","DOI":"10.1145\/177424.177591"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. H. Overmars","year":"1981","unstructured":"M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23:166\u2013204, 1981.","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0196-6774(88)90028-4","volume":"9","author":"M. H. Overmars","year":"1988","unstructured":"M. H. Overmars and D. Wood. On rectangular visibility. J. Algorithms, 9:372\u2013390, 1988.","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62592-5_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:00:28Z","timestamp":1578528028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62592-5_64"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625926","9783540683230"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-62592-5_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}