{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T12:54:45Z","timestamp":1782046485947,"version":"3.54.5"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319219622","type":"print"},{"value":"9783319219639","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21963-9_24","type":"book-chapter","created":{"date-parts":[[2015,8,2]],"date-time":"2015-08-02T21:19:45Z","timestamp":1438550385000},"page":"261-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast Algorithm for Finding Maximum Distance with Space Subdivision in E2"],"prefix":"10.1007","author":[{"given":"Vaclav","family":"Skala","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zuzana","family":"Majdisova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"KL Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4(1), 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Dobkin, D.P., Snyder, L.: On a general method for maximizing and minimizing among certain geometric problems. In: Proceedings of the 20th Annual Symposium on the Foundations of Computer Science, pp. 9\u201317 (1979)","DOI":"10.1109\/SFCS.1979.28"},{"key":"24_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/6437","volume-title":"Meshfree Approximation Methods with MATLAB","author":"GE Fasshauer","year":"2007","unstructured":"Fasshauer, G.E.: Meshfree Approximation Methods with MATLAB. World Scientific Publishing Co., Inc., Singapore (2007)"},{"key":"24_CR4","volume-title":"C# Cookbook","author":"J Hilyard","year":"2006","unstructured":"Hilyard, J., Teilhet, S.: C# Cookbook. O\u2019Reilly Media Inc., Sebastopol (2006)"},{"issue":"8","key":"24_CR5","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":"24_CR6","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035179","volume-title":"Handbook of Data Structures and Applications","author":"DP Mehta","year":"2004","unstructured":"Mehta, D.P., Sahni, S.: Handbook of Data Structures and Applications. CRC Press, Boca Raton (2004)"},{"key":"24_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804120","volume-title":"Computational Geometry in C","author":"J O\u2019Rourke","year":"1998","unstructured":"O\u2019Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1998)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Skala, V.: Fast Oexpected (N) algorithm for finding exact maximum distance in E2 instead of O (N2) or O (N lgN). In: AIP Conference Proceedings, no. 1558, pp. 2496\u20132499 (2013)","DOI":"10.1063\/1.4826047"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/TPAMI.1980.4767016","volume":"2","author":"WE Snyder","year":"1980","unstructured":"Snyder, W.E., Tang, D.A.: Finding the extrema of a region. IEEE Trans. Pattern Anal. Mach. Intell. 2(3), 266\u2013269 (1980)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"24_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-997-2","volume-title":"Geometric Algebra for Computer Graphics","author":"J Vince","year":"2008","unstructured":"Vince, J.: Geometric Algebra for Computer Graphics. Springer, Berlin (2008)"}],"container-title":["Lecture Notes in Computer Science","Image and Graphics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21963-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T12:16:58Z","timestamp":1564402618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21963-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319219622","9783319219639"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21963-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}