{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:09:22Z","timestamp":1743084562512,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_9","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"100-111","source":"Crossref","is-referenced-by-count":9,"title":["The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains"],"prefix":"10.1007","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shripad","family":"Thite","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv.\u00a023, 345\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"key":"9_CR2","volume-title":"Handbook of Computational Geometry, ch. 5","author":"F. Aurenhammer","year":"1999","unstructured":"Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, ch. 5. Elsevier, Amsterdam (1999)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"de Berg, M.: Improved bounds for the union complexity of fat objects. Discr. Comput. Geom. (in print, 2008)","DOI":"10.1007\/s00454-007-9029-7"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00453-002-0961-x","volume":"34","author":"M. de Berg","year":"2002","unstructured":"de Berg, M., van der Stappen, A.F., Vleugels, J., Katz, M.J.: Realistic input models for geometric algorithms. Algorithmica\u00a034, 81\u201397 (2002)","journal-title":"Algorithmica"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1142\/S0218195996000095","volume":"6","author":"J. Chen","year":"1996","unstructured":"Chen, J., Han, Y.: Shortest paths on a polyhedron. Int. J. Comput. Geom. Appl.\u00a06, 127\u2013144 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9_CR6","volume-title":"Handbook of Discrete and Computational Geometry, ch. 23","author":"S. Fortune","year":"2004","unstructured":"Fortune, S.: Voronoi diagrams and Delaunay triangulations. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch. 23. CRC Press, Boca Raton (2004)"},{"key":"9_CR7","unstructured":"Moet, E.: Computation and complexity of visibility in geometric environments. PhD thesis, Utrecht University (2008)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Moet, E., van Kreveld, M., van der Stappen, A.F.: On realistic terrains. In: Proc. 22nd ACM Sympos. Comput. Geom., pp. 177\u2013186 (2006)","DOI":"10.1145\/1137856.1137885"},{"key":"9_CR9","volume-title":"Spatial tesselations: Concepts and applications of Voronoi diagrams","author":"A. Okabe","year":"1992","unstructured":"Okabe, A., Boots, B., Sugihara, K.: Spatial tesselations: Concepts and applications of Voronoi diagrams. John Wiley & Sons, Chichester (1992)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"J.S.B. Mitchell","year":"1987","unstructured":"Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput.\u00a016, 647\u2013668 (1987)","journal-title":"SIAM J. Comput."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Schreiber, Y.: Shortest paths on realistic polyhedra. In: Proc. 23rd ACM Sympos. Comput. Geom., pp. 74\u201383 (2007)","DOI":"10.1145\/1247069.1247081"},{"key":"9_CR12","unstructured":"Schreiber, Y.: Personal communication (April 2008)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"van der Stappen, A.F.: Motion planning amidst fat obstacles. Ph.D.\u00a0thesis, Utrecht University (1994)","DOI":"10.1145\/177424.177453"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:20:44Z","timestamp":1715059244000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}