{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T02:41:09Z","timestamp":1783910469907,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642198663","type":"print"},{"value":"9783642198670","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19867-0_22","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T05:26:42Z","timestamp":1301290002000},"page":"260-271","source":"Crossref","is-referenced-by-count":5,"title":["Recursive Calculation of Relative Convex Hulls"],"prefix":"10.1007","author":[{"given":"Gisela","family":"Klette","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","first-page":"117","volume":"3811","author":"R. Klette","year":"1999","unstructured":"Klette, R., Kovalevsky, V.V., Yip, B.: Length estimation of digital curves. Vision Geometry, SPIE\u00a03811, 117\u2013129 (1999)","journal-title":"Vision Geometry, SPIE"},{"key":"22_CR2","volume-title":"Digital Geometry","author":"R. Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry. Morgan Kaufmann, San Francisco (2004)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1011289414377","volume":"13","author":"R. Klette","year":"2000","unstructured":"Klette, R., Zunic, J.: Multigrid convergence of calculated features in image analysis. J. Mathematical Imaging Vision\u00a013, 173\u2013191 (2000)","journal-title":"J. Mathematical Imaging Vision"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A. Melkman","year":"1987","unstructured":"Melkman, A.: On-line construction of the convex hull of a simple polygon. Information Processing Letters\u00a025, 11\u201312 (1987)","journal-title":"Information Processing Letters"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-04397-0_10","volume-title":"Discrete Geometry for Computer Imagery","author":"X. Proven\u00e7al","year":"2009","unstructured":"Proven\u00e7al, X., Lachaud, J.-O.: Two linear-time algorithms for computing the minimum length polygon of a digital contour. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol.\u00a05810, pp. 104\u2013117. Springer, Heidelberg (2009)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1109\/T-C.1972.223507","volume":"21","author":"J. Sklansky","year":"1972","unstructured":"Sklansky, J.: Measuring cavity on a rectangular mosaic. IEEE Trans. Computing\u00a021, 1355\u20131364 (1972)","journal-title":"IEEE Trans. Computing"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TSMC.1976.4309569","volume":"6","author":"J. Sklansky","year":"1976","unstructured":"Sklansky, J., Kibler, D.F.: A theory of nonuniformly digitized binary pictures. IEEE Trans. Systems, Man, and Cybernetics\u00a06, 637\u2013647 (1976)","journal-title":"IEEE Trans. Systems, Man, and Cybernetics"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0377-0427(94)90040-X","volume":"55","author":"F. Sloboda","year":"1994","unstructured":"Sloboda, F., Stoer, J.: On piecewise linear approximation of planar Jordan curves. J. Comput. Appl. Math.\u00a055, 369\u2013383 (1994)","journal-title":"J. Comput. Appl. Math."},{"key":"22_CR9","unstructured":"Sloboda, F., Zatko, B., Stoer, J.: On approximation of planar one-dimensional continua. In: Klette, R., Rosenfeld, A., Sloboda, F. (eds.) Advances in Digital and Computational Geometry, pp. 113\u2013160 (1998)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0217010","volume":"17","author":"R.E. Tarjan","year":"1988","unstructured":"Tarjan, R.E., Van Wyk, C.J.: An \n                    \n                      \n                    \n                    ${\\cal O}(n \\log \\log n)$\n                   algorithm for triangulating a simple polygon. SIAM J. Computing\u00a017, 143\u2013178 (1988)","journal-title":"SIAM J. Computing"},{"key":"22_CR11","first-page":"853","volume-title":"EURASIP, Signal processing lll: Theories and Applications, Part 2","author":"G.T. Toussaint","year":"1986","unstructured":"Toussaint, G.T.: An optimal algorithm for computing the relative convex hull of a set of points in a polygon. In: EURASIP, Signal processing lll: Theories and Applications, Part 2, pp. 853\u2013856. North-Holland, Amsterdam (1986)"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19867-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:38:39Z","timestamp":1558525119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19867-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198663","9783642198670"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19867-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}