{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:15:23Z","timestamp":1756682123076,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_23","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"283-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Farthest Color Voronoi Diagrams: Complexity and Algorithms"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Mantas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evanthia","family":"Papadopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera","family":"Sacrist\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"unstructured":"Abellanas, M., et al.: The farthest color Voronoi diagram and related problems. In: Proceedings of the 17th European Workshop on Computational Geometry, pp. 113\u2013116 (2001)","key":"23_CR1"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2017.11.031","volume":"725","author":"A Acharyya","year":"2018","unstructured":"Acharyya, A., Nandy, S.C., Roy, S.: Minimum width color spanning annulus. Theor. Comput. Sci. 725, 16\u201330 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.comgeo.2014.08.004","volume":"48","author":"EM Arkin","year":"2015","unstructured":"Arkin, E.M., et al.: Bichromatic 2-center of pairs of points. Comput. Geom. 48(2), 94\u2013107 (2015)","journal-title":"Comput. Geom."},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10878-018-0347-x","volume":"37","author":"E Arseneva","year":"2018","unstructured":"Arseneva, E., Papadopoulou, E.: Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended. J. Comb. Optim. 37(2), 579\u2013600 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0347-x","journal-title":"J. Comb. Optim."},{"key":"23_CR5","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)"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1587\/transinf.E95.D.731","volume":"95","author":"SW Bae","year":"2012","unstructured":"Bae, S.W.: On linear-sized farthest-color Voronoi diagrams. IEICE Trans. Inf. Syst. 95(3), 731\u2013736 (2012)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"16","key":"23_CR7","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.ipl.2010.05.014","volume":"110","author":"SW Bae","year":"2010","unstructured":"Bae, S.W., Lee, C., Choi, S.: On exact solutions to the Euclidean bottleneck Steiner tree problem. Inf. Process. Lett. 110(16), 672\u2013678 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"23_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.comgeo.2015.04.008","volume":"48","author":"C Bohler","year":"2015","unstructured":"Bohler, C., Cheilaris, P., Klein, R., Liu, C.H., Papadopoulou, E., Zavershynskyi, M.: On the complexity of higher order abstract Voronoi diagrams. Comput. Geom. 48(8), 539\u2013551 (2015)","journal-title":"Comput. Geom."},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1007\/s00453-016-0118-y","volume":"76","author":"P Cheilaris","year":"2016","unstructured":"Cheilaris, P., Khramtcova, E., Langerman, S., Papadopoulou, E.: A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters. Algorithmica 76(4), 935\u2013960 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0118-y","journal-title":"Algorithmica"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s00453-017-0299-z","volume":"80","author":"M Claverol","year":"2018","unstructured":"Claverol, M., Khramtcova, E., Papadopoulou, E., Saumell, M., Seara, C.: Stabbing circles for sets of segments in the plane. Algorithmica 80(3), 849\u2013884 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0299-z","journal-title":"Algorithmica"},{"unstructured":"Dehne, F., Maheshwari, A., Taylor, R.: A coarse grained parallel algorithm for Hausdorff Voronoi diagrams. In: Proceedings of the 35th International Conference on Parallel Processing, ICPP, pp. 497\u2013504. IEEE (2006)","key":"23_CR11"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/978-3-642-22006-7_65","volume-title":"Automata, Languages and Programming","author":"H Ding","year":"2011","unstructured":"Ding, H., Xu, J.: Solving the chromatic cone clustering problem via minimum spanning sphere. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 773\u2013784. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_65"},{"issue":"1","key":"23_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. 4(1), 311\u2013336 (1989). https:\/\/doi.org\/10.1007\/BF02187733","journal-title":"Discrete Comput. Geom."},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-14553-7_27","volume-title":"Frontiers in Algorithmics","author":"R Fleischer","year":"2010","unstructured":"Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 285\u2013292. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14553-7_27"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"DP Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9(3), 267\u2013291 (1993). https:\/\/doi.org\/10.1007\/BF02189323","journal-title":"Discrete Comput. Geom."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-319-62127-2_40","volume-title":"Algorithms and Data Structures","author":"J Iacono","year":"2017","unstructured":"Iacono, J., Khramtcova, E., Langerman, S.: Searching edges in the overlap of two plane graphs. WADS 2017. LNCS, vol. 10389, pp. 473\u2013484. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_40"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-22300-6_45","volume-title":"Algorithms and Data Structures","author":"A J\u00f8rgensen","year":"2011","unstructured":"J\u00f8rgensen, A., L\u00f6ffler, M., Phillips, J.M.: Geometric computations on indecisive points. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 536\u2013547. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22300-6_45"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-642-45030-3_59","volume-title":"Algorithms and Computation","author":"P Khanteimouri","year":"2013","unstructured":"Khanteimouri, P., Mohades, A., Abam, M.A., Kazemi, M.R.: Computing the smallest color-spanning axis-parallel square. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 634\u2013643. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_59"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 400. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-52055-4"},{"issue":"6","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1016\/j.adhoc.2013.03.005","volume":"11","author":"C Lee","year":"2013","unstructured":"Lee, C., Shin, D., Bae, S.W., Choi, S.: Best and worst-case coverage problems for arbitrary paths in wireless sensor networks. Ad Hoc Netw. 11(6), 1699\u20131714 (2013)","journal-title":"Ad Hoc Netw."},{"issue":"06","key":"23_CR21","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. Appl. 11(06), 583\u2013616 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"23_CR22","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"A Okabe","year":"2009","unstructured":"Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, vol. 501. Wiley, Hoboken (2009)"},{"issue":"2","key":"23_CR23","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 40(2), 63\u201382 (2004). https:\/\/doi.org\/10.1007\/s00453-004-1095-0","journal-title":"Algorithmica"},{"issue":"06","key":"23_CR24","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. Appl. 14(06), 421\u2013452 (2004)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"23_CR25","series-title":"Advances in Pattern Recognition","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-1-4471-3702-3_4","volume-title":"Principles of Visual Information Retrieval","author":"RC Veltkamp","year":"2001","unstructured":"Veltkamp, R.C., Hagedoorn, M.: State of the art in shape matching. In: Lew, M.S. (ed.) Principles of Visual Information Retrieval. ACVPR, pp. 87\u2013119. Springer, London (2001). https:\/\/doi.org\/10.1007\/978-1-4471-3702-3_4"},{"doi-asserted-by":"crossref","unstructured":"Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K., Kitsuregawa, M.: Keyword search in spatial databases: towards searching by document. In: Proceedings of the 25th International Conference on Data Engineering, pp. 688\u2013699. IEEE (2009)","key":"23_CR26","DOI":"10.1109\/ICDE.2009.77"}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:34:04Z","timestamp":1606944844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}