{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T12:54:52Z","timestamp":1782046492707,"version":"3.54.5"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030587987","type":"print"},{"value":"9783030587994","type":"electronic"}],"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-58799-4_21","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"286-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Diameter and Convex Hull of Points Using Space Subdivision in E2 and E3"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8886-4281","authenticated-orcid":false,"given":"Vaclav","family":"Skala","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"issue":"5","key":"21_CR1","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","volume":"9","author":"A Andrew","year":"1979","unstructured":"Andrew, A.: Another efficient algorithm for convex hulls in two dimensions. Inf. Process. Lett. 9(5), 216\u2013219 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"B Bradford","year":"1996","unstructured":"Bradford, B., Dobkin, D., Dobkin, H., Huhdanpaa, D.P.: The quickhull algorithm for convex hulls. ACM Trans. Mathe. Softw. 22(4), 469\u2013483 (1996)","journal-title":"ACM Trans. Mathe. Softw."},{"issue":"6","key":"21_CR3","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/0020-0190(78)90021-2","volume":"7","author":"A Bykat","year":"1978","unstructured":"Bykat, A.: Convex hull of a finite set of points in two dimensions. Inf. Process. Lett. 7(6), 296\u2013298 (1978)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF02712873","volume":"16","author":"T Chan","year":"1996","unstructured":"Chan, T.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom. 16(4), 361\u2013368 (1996)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/321556.321564","volume":"17","author":"D Chand","year":"1970","unstructured":"Chand, D., Kapur, S.: An algorithm for convex polytopes. J. ACM 17(1), 78\u201386 (1970)","journal-title":"J. ACM"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Dobkin, D., Snyder, L.: On a general method for maximizing and minimizing among certain geometric problems. In: FOCS-IEEE Symposium on Foundations of Computer Science Proceedings, pp. 9\u201317 (1979)","DOI":"10.1109\/SFCS.1979.28"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(79)90056-5","volume":"9","author":"F D\u00e9vai","year":"1979","unstructured":"D\u00e9vai, F., Szendr\u00e9nyi, T.: Comments on convex hull of a finite set of points in two dimensions. Inf. Process. Lett. 9(3), 141\u2013142 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/355759.355766","volume":"3","author":"W Eddy","year":"1997","unstructured":"Eddy, W.: Algorithm 523: convex, a new convex hull algorithm for planar sets. ACM Trans. Math. Softw. (TOMS) 3(4), 398\u2013403 (1997)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R Graham","year":"1972","unstructured":"Graham, R.: An efficient algorithm for determining the convex hull of a finite planar set. Inf. Process. Lett. 1(4), 132\u2013133 (1972)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/S0743-7315(03)00035-2","volume":"63","author":"N Gupta","year":"2003","unstructured":"Gupta, N., Sen, S.: Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. J. Para. Distrib. Comput. 63(4), 488\u2013500 (2003)","journal-title":"J. Para. Distrib. Comput."},{"issue":"12","key":"21_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365104","volume":"7","author":"J Halton","year":"1964","unstructured":"Halton, J.: Algorithm 247: radical-inverse quasi-random point sequence. CACM 7(12), 701\u2013702 (1964)","journal-title":"CACM"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","volume":"2","author":"R Jarvis","year":"1973","unstructured":"Jarvis, R.: On the identification of the convex hull of a finite set of points in the plane. Inf. Process. Lett. 2(1), 18\u201321 (1973)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(84)90084-X","volume":"19","author":"M Kallay","year":"1984","unstructured":"Kallay, M.: The complexity of incremental convex hull algorithms in $${R}^d$$. Inf. Process. Lett. 19(4), 197 (1984)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0215021","volume":"15","author":"D Kirkpatrick","year":"1986","unstructured":"Kirkpatrick, D., Seidel, R.: The ultimate planar convex hull algorithm? SIAM J. Comput. 15(1), 287\u2013299 (1986)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"21_CR15","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1631\/jzus.2007.A1210","volume":"8","author":"G Liu","year":"2007","unstructured":"Liu, G., Chen, C.: A new algorithm for computing the convex hull of a planar point set. J. Zhejiang Univ. Sci. A 8(8), 1210\u20131217 (2007)","journal-title":"J. Zhejiang Univ. Sci. A"},{"key":"21_CR16","unstructured":"L\u00f6ffler, M.: A manual comparison of convex hull algorithms (multimedia exposition). In: 35th International Symposium on Computational Geometry (SoCG 2019), volume 129 of Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, pp. 65:1\u201365:2. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"21_CR17","doi-asserted-by":"crossref","first-page":"124626","DOI":"10.1016\/j.amc.2019.124626","volume":"363","author":"K Nguyen","year":"2019","unstructured":"Nguyen, K., Song, C., Ryu, J., Thanh, P.A., Hoang, N.-D., Kim, D.-S.: Quickhulldisk: a faster convex hull algorithm for disks. Appl. Math. Comput. 363, 124626 (2019)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F Preparata","year":"1997","unstructured":"Preparata, F., Hong, S.: Convex hulls of finite sets of points in two and three dimensions. CACM 20(2), 87\u201393 (1997)","journal-title":"CACM"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Skala, V.: Fast $${O}_{{\\rm expected}}({N})$$ algorithm for finding exact maximum distance in $${E}^2$$ instead of $${O(N}^2)$$ or $${O(N lg N)}$$. In: ICNAAM 2013, AIP Proceedings, USA, vol. 1558, pp. 2496\u20132499. AIP Publishing (2013)","DOI":"10.1063\/1.4826047"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-21963-9_24","volume-title":"Image and Graphics","author":"V Skala","year":"2015","unstructured":"Skala, V., Majdisova, Z.: Fast algorithm for finding maximum distance with space subdivision in E$$^2$$. In: Zhang, Y.-J. (ed.) ICIG 2015. LNCS, vol. 9218, pp. 261\u2013274. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21963-9_24"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Skala, V., Majdisova, Z., Smolik, M.: Space subdivision to speed-up convex hull construction in $${E}^3$$. Adv. Softw. Eng. 91(C), 12\u201322 (2016)","DOI":"10.1016\/j.advengsoft.2015.09.002"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-030-24289-3_27","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2019","author":"V Skala","year":"2019","unstructured":"Skala, V., Smolik, M.: Simple and fast $${O}exp{(N)}$$ algorithm for finding an exact maximum distance in $${E}^2$$ instead of $${O(N}^2)$$ or $${O(N lg N)}$$. In: Misra, S., et al. (eds.) ICCSA 2019. LNCS, vol. 11619, pp. 367\u2013380. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24289-3_27"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Skala, V., Smolik, M., Majdisova, Z.: Reducing the number of points on the convex hull calculation using the polar space subdivision in $${E}^2$$. In: 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI 2016), pp. 40\u201347. IEEE (2016)","DOI":"10.1109\/SIBGRAPI.2016.015"},{"issue":"4","key":"21_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cag.2012.02.012","volume":"36","author":"A Stein","year":"2012","unstructured":"Stein, A., Geva, E., El-Sana, J.: Cudahull: fast parallel 3D convex hull on the GPU. Comput. Graph. 36(4), 265\u2013271 (2012)","journal-title":"Comput. Graph."},{"issue":"2","key":"21_CR25","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0022-0000(05)80056-X","volume":"49","author":"K Sugihara","year":"1994","unstructured":"Sugihara, K.: Robust gift wrapping for the three-dimensional convex hull. J. Comput. Syst. Sci. 49(2), 391\u2013407 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"21_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0167-8655(82)90046-0","volume":"1","author":"J Toussaint","year":"1982","unstructured":"Toussaint, J., McAlear, G.T.: A simple o(n log n) algorithm for finding the maximum distance between two finite planar sets. Pattern Recogn. Lett. 1(1), 21\u201324 (1982)","journal-title":"Pattern Recogn. Lett."},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.comgeo.2019.04.002","volume":"82","author":"J Xue","year":"2019","unstructured":"Xue, J., Li, Y., Janardan, R.: On the expected diameter, width, and complexity of a stochastic convex hull. Comput. Geom. 82, 16\u201331 (2019)","journal-title":"Comput. Geom."},{"issue":"4","key":"21_CR28","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1145\/322276.322289","volume":"28","author":"A Yao","year":"1981","unstructured":"Yao, A., Andrew, C.: A lower bound to finding convex hulls. J. ACM 28(4), 780\u2013787 (1981)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58799-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T01:49:27Z","timestamp":1698198567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58799-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030587987","9783030587994"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58799-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","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":"Cyber chair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1450","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":"466","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":"32","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":"32% - 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.5","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":"6","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)"}},{"value":"Conference was held virtually due to COVID-19 pandemic.","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)"}}]}}