{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:02:29Z","timestamp":1746244949483,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_9","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"96-107","source":"Crossref","is-referenced-by-count":2,"title":["A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters"],"prefix":"10.1007","author":[{"given":"Panagiotis","family":"Cheilaris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Khramtcova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evanthia","family":"Papadopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/PL00009296","volume":"17","author":"M. Abellanas","year":"1997","unstructured":"Abellanas, M., Hernandez, G., Klein, R., Neumann-Lara, V., Urrutia, J.: A combinatorial property of convex sets. Discrete Comput. Geom.\u00a017(3), 307\u2013318 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR2","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacrist\u00e1n, V.: The farthest color Voronoi diagram and related problems. In: 17th Eur. Workshop on Comput. Geom. (EWCG), pp. 113\u2013116 (2001)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Arge, L., Brodal, G.S., Georgiadis, L.: Improved dynamic planar point location. In: 47th Ann. IEEE Symp. Found. Comput. Sci. (FOCS), pp. 305\u2013314 (2006)","DOI":"10.1109\/FOCS.2006.40"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/11682462_12","volume-title":"LATIN 2006: Theoretical Informatics","author":"B. Aronov","year":"2006","unstructured":"Aronov, B., Bose, P., Demaine, E.D., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M.: Data structures for halfplane proximity queries and incremental Voronoi diagrams. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 80\u201392. Springer, Heidelberg (2006)"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1006\/jagm.1994.1040","volume":"17","author":"H. Baumgarten","year":"1994","unstructured":"Baumgarten, H., Jung, H., Mehlhorn, K.: Dynamic point location in general subdivisions. J. Algorithm\u00a017(3), 342\u2013380 (1994)","journal-title":"J. Algorithm"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-33259-6_2","volume-title":"Effective Computational Geometry for Curves and Surfaces","author":"J.-D. Boissonnat","year":"2006","unstructured":"Boissonnat, J.-D., Wormser, C., Yvinec, M.: Curved Voronoi diagrams. In: Boissonnat, J.-D., Teillaud, M. (eds.) Effective Computational Geometry for Curves and Surfaces, pp. 67\u2013116. Springer, Heidelberg (2006)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cheilaris, P., Khramtcova, E., Langerman, S., Papadopoulou, E.: A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters. CoRR abs\/1312.3904 (2013)","DOI":"10.1007\/978-3-642-54423-1_9"},{"issue":"4","key":"9_CR8","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.S.: Farthest-polygon Voronoi diagrams. Comput. Geom.\u00a044(4), 234\u2013247 (2011)","journal-title":"Comput. Geom."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K. Clarkson","year":"1989","unstructured":"Clarkson, K., Shor, P.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom.\u00a04, 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Dehne, F., Maheshwari, A., Taylor, R.: A coarse grained parallel algorithm for Hausdorff Voronoi diagrams. In: 35th Int. Conf. on Parallel Processing (ICPP), pp. 497\u2013504 (2006)","DOI":"10.1109\/ICPP.2006.5"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/S0129054102001035","volume":"13","author":"O. Devillers","year":"2002","unstructured":"Devillers, O.: The Delaunay Hierarchy. Int. J. Found. Comput. S.\u00a013, 163\u2013180 (2002)","journal-title":"Int. J. Found. Comput. S."},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","volume":"6","author":"H. Edelsbrunner","year":"1985","unstructured":"Edelsbrunner, H.: Computing the extreme distances between two convex polygons. J. Algorithm\u00a06(2), 213\u2013224 (1985)","journal-title":"J. Algorithm"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02187733","volume":"4","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.J., Sharir, M.: The upper envelope of piecewise linear functions: algorithms and applications. Discrete Comput. Geom.\u00a04, 311\u2013336 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"D.P. Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom.\u00a09, 267\u2013291 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Karavelas, M., Yvinec, M.: The Voronoi diagram of convex objects in the plane. Technical report RR-5023, INRIA (2003)","DOI":"10.1007\/978-3-540-39658-1_32"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52055-4","volume-title":"Concrete and Abstract Voronoi Diagrams","author":"R. Klein","year":"1989","unstructured":"Klein, R.: Concrete and Abstract Voronoi Diagrams. LNCS, vol.\u00a0400. Springer, Heidelberg (1989)"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0925-7721(93)90033-3","volume":"3","author":"R. Klein","year":"1993","unstructured":"Klein, R., Mehlhorn, K., Meiser, S.: Randomized incremental construction of abstract Voronoi diagrams. Comput. Geom.\u00a03(3), 157\u2013184 (1993)","journal-title":"Comput. Geom."},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02716580","volume":"15","author":"M. McAllister","year":"1996","unstructured":"McAllister, M., Kirkpatrick, D., Snoeyink, J.: A compact piecewise-linear Voronoi diagram for convex sites in the plane. Discrete Comput. Geom.\u00a015(1), 73\u2013105 (1996)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0210023","volume":"10","author":"N. Megiddo","year":"1981","unstructured":"Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An O(nlog2 n) algorithm for the kth longest path in a tree with applications to location problems. SIAM J. Comput.\u00a010(2), 328\u2013337 (1981)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00453-004-1095-0","volume":"40","author":"E. Papadopoulou","year":"2004","unstructured":"Papadopoulou, E.: The Hausdorff Voronoi diagram of point clusters in the plane. Algorithmica\u00a040(2), 63\u201382 (2004)","journal-title":"Algorithmica"},{"issue":"5","key":"9_CR21","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.\u00a030(5), 704\u2013716 (2011)","journal-title":"IEEE T. Comput. Aid D."},{"issue":"6","key":"9_CR22","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. Comput. Geom. Ap.\u00a014(6), 421\u2013452 (2004)","journal-title":"Int. J. Comput. Geom. Ap."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Papadopoulou, E., Xu, J.: The L \u2009\u221e\u2009 Hausdorff Voronoi diagram revisited. In: 8th Int. Symp. on Voronoi Diagr. in Sci. and Eng. (ISVD), pp. 67\u201374 (2011)","DOI":"10.1109\/ISVD.2011.17"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:23:04Z","timestamp":1746159784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}