{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:52:05Z","timestamp":1726059125180},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030340285"},{"type":"electronic","value":"9783030340292"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-34029-2_1","type":"book-chapter","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T22:02:40Z","timestamp":1573682560000},"page":"1-20","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Voronoi Diagram of Orthogonal Polyhedra in Two and Three Dimensions"],"prefix":"10.1007","author":[{"given":"Ioannis Z.","family":"Emiris","sequence":"first","affiliation":[]},{"given":"Christina","family":"Katsamaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00454-002-2817-1","volume":"28","author":"PK Agarwal","year":"2002","unstructured":"Agarwal, P.K., de Berg, M., Gudmundsson, J., Hammar, M., Haverkort, H.J.: Box-trees and R-trees with near-optimal query time. Discrete Comput. Geom. 28(3), 291\u2013312 (2002). \nhttps:\/\/doi.org\/10.1007\/s00454-002-2817-1","journal-title":"Discrete Comput. Geom."},{"key":"1_CR2","first-page":"752","volume":"1","author":"O Aichholzer","year":"1995","unstructured":"Aichholzer, O., Aurenhammer, F., Alberts, D., G\u00e4rtner, B.: A novel type of skeleton for polygons. J. Univ. Comput. Sci. 1, 752\u2013761 (1995)","journal-title":"J. Univ. Comput. Sci."},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s00454-016-9811-5","volume":"56","author":"F Aurenhammer","year":"2016","unstructured":"Aurenhammer, F., Walzl, G.: Straight skeletons and mitered offsets of nonconvex polytopes. Discrete Comput. Geom. 56(3), 743\u2013801 (2016)","journal-title":"Discrete Comput. Geom."},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Barequet, G., Eppstein, D., Goodrich, M., Vaxman, A.: Straight skeletons of three-dimensional polyhedra. In: Proceedings of the Twenty-fifth ACM Annual Symposium on Computational Geometry, pp. 100\u2013101. ACM Press, Aarhus, Denmark, (2009). \nhttps:\/\/doi.org\/10.1145\/1542362.1542384.","DOI":"10.1145\/1542362.1542384."},{"issue":"5","key":"1_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1111\/cgf.12979","volume":"35","author":"H Bennett","year":"2016","unstructured":"Bennett, H., Papadopoulou, E., Yap, C.: Planar minimization diagrams via subdivision with applications to anisotropic Voronoi diagrams. Comput. Graph. Forum 35(5), 229\u2013247 (2016)","journal-title":"Comput. Graph. Forum"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-662-44199-2_32","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"P Cheilaris","year":"2014","unstructured":"Cheilaris, P., Dey, S.K., Gabrani, M., Papadopoulou, E.: Implementing the $$L_\\infty $$ segment voronoi diagram in CGAL and applying in VLSI pattern analysis. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 198\u2013205. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44199-2_32"},{"key":"1_CR7","unstructured":"Eder, G., Held, M., Palfrader, P.: Computing the straight skeleton of an orthogonal monotone polygon in linear time. In: European Workshop on Computational Geometry, Utrecht, March 2019. \nwww.eurocg2019.uu.nl\/papers\/16.pdf"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.cad.2012.10.043","volume":"45","author":"IZ Emiris","year":"2013","unstructured":"Emiris, I.Z., Mantzaflaris, A., Mourrain, B.: Voronoi diagrams of algebraic distance fields. J. Comput. Aided Des. 45(2), 511\u2013516 (2013). Symposium on Solid Physical Modeling 2012","journal-title":"J. Comput. Aided Des."},{"key":"1_CR9","first-page":"58","volume":"22","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D., Erickson, J.: Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions. Discrete Comput. Geom. 22, 58\u201367 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"1_CR10","unstructured":"Haverkort, H.J.: Results on geometric networks and data structures. Ph.D. thesis, Utrecht University (2004). \nhttp:\/\/igitur-archive.library.uu.nl\/dissertations\/2004-0506-101707\/UUindex.html"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"611","DOI":"10.14733\/cadaps.2019.611-619","volume":"16","author":"M Held","year":"2018","unstructured":"Held, M., Palfrader, P.: Straight skeletons and mitered offsets of polyhedral terrains in 3D. J. Comput. Aided Des. Appl. 16, 611\u2013619 (2018)","journal-title":"J. Comput. Aided Des. Appl."},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.gmod.2013.03.005","volume":"75","author":"J Mart\u00ednez","year":"2013","unstructured":"Mart\u00ednez, J., Garcia, N.P., Anglada, M.V.: Skeletal representations of orthogonal shapes. Graph. Models 75(4), 189\u2013207 (2013)","journal-title":"Graph. Models"},{"issue":"05","key":"1_CR13","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1142\/S0218195901000626","volume":"11","author":"E Papadopoulou","year":"2001","unstructured":"Papadopoulou, E., Lee, D.: The L$$_\\infty $$ Voronoi diagram of segments and VLSI applications. Int. J. Comput. Geom. Appl. 11(05), 503\u2013528 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1111\/j.1467-8659.2005.00843.x","volume":"24","author":"S Schaefer","year":"2005","unstructured":"Schaefer, S., Warren, J.: Dual marching cubes: primal contouring of dual grids. Comput. Graph. Forum 24(2), 195\u2013201 (2005)","journal-title":"Comput. Graph. Forum"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Yap, C., Sharma, V., Jyh-Ming, L.: Towards exact numerical Voronoi diagrams. In: IEEE International Symposium on Voronoi Diagrams in Science and Engineering (ISVD), New Brunswick, NJ, June 2012","DOI":"10.1109\/ISVD.2012.31"}],"container-title":["Lecture Notes in Computer Science","Analysis of Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34029-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T22:07:02Z","timestamp":1573682822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34029-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030340285","9783030340292"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34029-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Experimental Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/SEA2019\/","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":"45","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":"35","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":"78% - 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":"2","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":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}