{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:28:27Z","timestamp":1760441307295},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_35","type":"book-chapter","created":{"date-parts":[[2015,11,25]],"date-time":"2015-11-25T23:00:57Z","timestamp":1448492457000},"page":"404-414","source":"Crossref","is-referenced-by-count":1,"title":["Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures"],"prefix":"10.1007","author":[{"given":"Elena","family":"Khramtcova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evanthia","family":"Papadopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BF02187749","volume":"4","author":"A Aggarwal","year":"1989","unstructured":"Aggarwal, A., Guibas, L., Saxe, J., Shor, P.: A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom. 4, 591\u2013604 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.ipl.2006.07.008","volume":"100","author":"F Aurenhammer","year":"2006","unstructured":"Aurenhammer, F., Drysdale, R., Krasser, H.: Farthest line segment Voronoi diagrams. Inform. Process. Lett. 100, 220\u2013225 (2006)","journal-title":"Inform. Process. Lett."},{"key":"35_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/8685","volume-title":"Voronoi Diagrams and Delaunay Triangulations","author":"F Aurenhammer","year":"2013","unstructured":"Aurenhammer, F., Klein, R., Lee, D.T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific, Singapore (2013)"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-39206-1_18","volume-title":"Automata, Languages, and Programming","author":"C Bohler","year":"2013","unstructured":"Bohler, C., Cheilaris, P., Klein, R., Liu, C.-H., Papadopoulou, E., Zavershynskyi, M.: On the complexity of higher order abstract Voronoi diagrams. In: Kwiatkowska, M., Peleg, D., Fomin, F.V., Freivalds, R.U. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 208\u2013219. Springer, Heidelberg (2013)"},{"key":"35_CR5","unstructured":"Bohler, C., Klein, R., Liu, C.: Forest-like abstract Voronoi diagrams in linear time. In: Proceedings of the 26th CCCG (2014)"},{"issue":"4","key":"35_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.comgeo.2010.11.004","volume":"44","author":"O Cheong","year":"2011","unstructured":"Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.: Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4), 234\u2013247 (2011)","journal-title":"Comput. Geom."},{"key":"35_CR7","unstructured":"Chew, L.P.: Building Voronoi diagrams for convex polygons in linear expected time. Technical report, Dartmouth College, Hanover, USA (1990)"},{"issue":"3","key":"35_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/PL00009429","volume":"21","author":"F Chin","year":"1999","unstructured":"Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discrete Comput. Geom. 21(3), 405\u2013420 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-58325-4_161","volume-title":"Algorithms and Computation","author":"R Klein","year":"1994","unstructured":"Klein, R., Lingas, A.: Hamiltonian abstract Voronoi diagrams in linear time. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol. 834, pp. 11\u201319. Springer, Heidelberg (1994)"},{"issue":"6","key":"35_CR10","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1142\/S0218195901000663","volume":"11","author":"K Mehlhorn","year":"2001","unstructured":"Mehlhorn, K., Meiser, S., Rasch, R.: Furthest site abstract Voronoi diagrams. Int. J. Comput. Geom. Ap. 11(6), 583\u2013616 (2001)","journal-title":"Int. J. Comput. Geom. Ap."},{"issue":"5","key":"35_CR11","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TCAD.2010.2100550","volume":"30","author":"E Papadopoulou","year":"2011","unstructured":"Papadopoulou, E.: Net-aware critical area extraction for opens in VLSI circuits via higher-order Voronoi diagrams. IEEE T. Comput. Aid. D. 30(5), 704\u2013716 (2011)","journal-title":"IEEE T. Comput. Aid. D."},{"issue":"6","key":"35_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1142\/S0218195913600121","volume":"23","author":"E Papadopoulou","year":"2013","unstructured":"Papadopoulou, E., Dey, S.K.: On the farthest line-segment Voronoi diagram. Int. J. Comput. Geom. Ap. 23(6), 443\u2013459 (2013)","journal-title":"Int. J. Comput. Geom. Ap."},{"key":"35_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9950-0","author":"E Papadopoulou","year":"2014","unstructured":"Papadopoulou, E., Zavershynskyi, M.: The higher-order Voronoi diagram of line segments. Algorithmica (2014). doi:\n                      10.1007\/s00453-014-9950-0","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T14:03:18Z","timestamp":1559311398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}