{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:08:25Z","timestamp":1764364105742},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_22","type":"book-chapter","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T20:59:41Z","timestamp":1355432381000},"page":"187-196","source":"Crossref","is-referenced-by-count":3,"title":["On the Farthest Line-Segment Voronoi Diagram"],"prefix":"10.1007","author":[{"given":"Evanthia","family":"Papadopoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep Kumar","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"22_CR1","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.L.S., Krasser, H.: Farthest line segment Voronoi diagrams. Information Processing Letters\u00a0100(6), 220\u2013225 (2006)","journal-title":"Information Processing Letters"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF02712873","volume":"16","author":"T.M. Chan","year":"1996","unstructured":"Chan, T.M.: Optimal output-sensitive convex-hull algorithms in two and three dimensions. Discrete and Computational Geometry\u00a016, 361\u2013368 (1996)","journal-title":"Discrete and Computational Geometry"},{"issue":"12","key":"22_CR3","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1016\/0010-4485(93)90103-U","volume":"25","author":"L.L. Chen","year":"1993","unstructured":"Chen, L.L., Chou, S.Y., Woo, T.C.: Parting directions for mould and die design. Computer-Aided Design\u00a025(12), 762\u2013768 (1993)","journal-title":"Computer-Aided Design"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.S.: Farthest-Polygon Voronoi Diagrams. arXiv:1001.3593v1 (cs.CG) (2010)","DOI":"10.1016\/j.comgeo.2010.11.004"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Dey, S.K., Papadopoulou, E.: The L\n                  \u2009\u221e\u2009 farthest line segment Voronoi diagram. In: Proc. 9th Int. Symposium on Voronoi Diagrams in Science and Engineering (2012)","DOI":"10.1109\/ISVD.2012.27"},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/BF01934440","volume":"22","author":"H. Edelsbrunner","year":"1982","unstructured":"Edelsbrunner, H., Maurer, H.A., Preparata, F.P., Rosenberg, A.L., Welzl, E., Wood, D.: Stabbing Line Segments. BIT\u00a022(3), 274\u2013281 (1982)","journal-title":"BIT"},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/322217.322219","volume":"27","author":"D.T. Lee","year":"1980","unstructured":"Lee, D.T.: Two-dimensional Voronoi diagrams in the L\n                  \n                    p\n                   metric. J. ACM\u00a027(4), 604\u2013618 (1980)","journal-title":"J. ACM"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0210006","volume":"10","author":"D.T. Lee","year":"1981","unstructured":"Lee, D.T., Drysdale, R.L.S.: Generalization of Voronoi Diagrams in the Plane. SIAM J. Comput.\u00a010(1), 73\u201387 (1981)","journal-title":"SIAM J. Comput."},{"key":"22_CR10","unstructured":"Karavelas, M.I.: A robust and efficient implementation for the segment Voronoi diagram. In: Proc. 1st. Int. Symposium on Voronoi Diagrams in Science and Engineering, pp. 51\u201362 (2004)"},{"issue":"6","key":"22_CR11","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. of Comput. Geometry and Applications\u00a011(6), 583\u2013616 (2001)","journal-title":"Int. J. of Comput. Geometry and Applications"},{"issue":"5","key":"22_CR12","doi-asserted-by":"crossref","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 Trans. on CAD\u00a030(5), 704\u2013716 (2011)","journal-title":"IEEE Trans. on CAD"},{"issue":"6","key":"22_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1142\/S0218195904001536","volume":"14","author":"E. Papadopoulou","year":"2004","unstructured":"Papadopoulou, E., Lee, D.T.: The Hausdorff Voronoi diagram of polygonal objects: A divide and conquer approach. Int. J. of Computational Geometry and Applications\u00a014(6), 421\u2013452 (2004)","journal-title":"Int. J. of Computational Geometry and Applications"},{"issue":"5","key":"22_CR14","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1142\/S0218195901000626","volume":"11","author":"E. Papadopoulou","year":"2001","unstructured":"Papadopoulou, E., Lee, D.T.: The L\n                  \u2009\u221e\u2009 Voronoi Diagram of Segments and VLSI Applications. Int. J. Comp. Geom. and Applications\u00a011(5), 503\u2013528 (2001)","journal-title":"Int. J. Comp. Geom. and Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T20:02:10Z","timestamp":1557432130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}