{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:03:28Z","timestamp":1762340608318},"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_21","type":"book-chapter","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T20:59:41Z","timestamp":1355432381000},"page":"177-186","source":"Crossref","is-referenced-by-count":6,"title":["On Higher Order Voronoi Diagrams of Line Segments"],"prefix":"10.1007","author":[{"given":"Evanthia","family":"Papadopoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maksym","family":"Zavershynskyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1137\/S0097539795281840","volume":"27","author":"P. Agarwal","year":"1998","unstructured":"Agarwal, P., de Berg, M., Matousek, J., Schwarzkopf, O.: Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput.\u00a027(3), 654\u2013667 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0097-3165(86)90122-6","volume":"41","author":"N. Alon","year":"1986","unstructured":"Alon, N., Gy\u00f6ri, E.: The number of small semispaces of a finite set of points in the plane. J. Comb. Theory, Ser. A\u00a041(1), 154\u2013157 (1986)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"6","key":"21_CR3","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. Inf. Process. Lett.\u00a0100(6), 220\u2013225 (2006)","journal-title":"Inf. Process. Lett."},{"key":"21_CR4","unstructured":"Aurenhammer, F., Klein, R.: Voronoi Diagrams. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry. North-Holland Publishing Co. (2000)"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01228508","volume":"9","author":"J.-D. Boissonnat","year":"1993","unstructured":"Boissonnat, J.-D., Devillers, O., Teillaud, M.: A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis. Algorithmica\u00a09(4), 329\u2013356 (1993)","journal-title":"Algorithmica"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H.: Algorithms in combinatorial geometry. EATCS Monographs on Theoretical Computer Science, ch. 13.4. Springer (1987)","DOI":"10.1007\/978-3-642-61568-9"},{"issue":"3","key":"21_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"},{"key":"21_CR8","unstructured":"Karavelas, M.I.: A robust and efficient implementation for the segment Voronoi diagram. In: Proc. 1st Int. Symp. on Voronoi Diagrams in Science and Engineering, Tokyo, pp. 51\u201362 (2004)"},{"issue":"6","key":"21_CR9","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TC.1982.1676031","volume":"31","author":"D.T. Lee","year":"1982","unstructured":"Lee, D.T.: On k-Nearest Neighbor Voronoi Diagrams in the Plane. IEEE Trans. Computers\u00a031(6), 478\u2013487 (1982)","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"21_CR10","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."},{"issue":"5","key":"21_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 Trans. on CAD of Integrated Circuits and Systems\u00a030(5), 704\u2013717 (2011)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Shamos, M.I., Hoey, D.: Closest-point problems. In: Proc. 16th IEEE Symp. on Foundations of Comput. Sci., pp. 151\u2013162 (1975)","DOI":"10.1109\/SFCS.1975.8"},{"key":"21_CR13","unstructured":"Sharir, M., Agarwal, P.: Davenport-Schinzel Sequences and their Geometric Applications, ch.\u00a05.4. Cambridge University Press (1995)"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C.-K. Yap","year":"1987","unstructured":"Yap, C.-K.: An O(nlogn) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments. Discrete & Computational Geometry\u00a02, 365\u2013393 (1987)","journal-title":"Discrete & Computational Geometry"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T20:05:15Z","timestamp":1557432315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}