{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T09:12:52Z","timestamp":1744189972229,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T00:00:00Z","timestamp":1641686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T00:00:00Z","timestamp":1641686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10851-021-01060-0","type":"journal-article","created":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T00:03:33Z","timestamp":1641686613000},"page":"161-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Polygonal Approximation for General 4-Contours Corresponding to Weakly Simple Curves"],"prefix":"10.1007","volume":"64","author":[{"given":"Mario","family":"Villafuerte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5529-9498","authenticated-orcid":false,"given":"Petra","family":"Wiederhold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,9]]},"reference":[{"key":"1060_CR1","unstructured":"Mukhopadhyay, J., et\u00a0al.: Digital Geometry in Image Processing. IIT Kharagpur Research Monograph Series. CRC Press, India (2013)"},{"key":"1060_CR2","first-page":"585","volume":"95","author":"G Almkvist","year":"1988","unstructured":"Almkvist, G., Berndt, B.: Gauss, landen, ramanujan, the arithmetic-geometric mean, ellipses, pi, and the ladies diary. Am. Math. Mon. 95, 585\u2013608 (1988)","journal-title":"Am. Math. Mon."},{"key":"1060_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2020.09.043","volume":"847","author":"A Aman","year":"2020","unstructured":"Aman, A., Sarkar, A., Dutt, M., Biswas, A.: A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects. Theor. Comput. Sci. 847, 103\u2013121 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"1060_CR4","doi-asserted-by":"publisher","unstructured":"Asano, T., Kawamura, Y., Klette, R., Obokata, K.: Minimum-length polygons in approximation sausages. In: Arcelli, C., et\u00a0al. (ed.) Proceedings of IWVF4, 4th International Workshop on Visual Form, pp. 103\u2013112. Springer, LNCS 2059, Berlin (2001). https:\/\/doi.org\/10.1007\/3-540-45129-3-8","DOI":"10.1007\/3-540-45129-3-8"},{"key":"1060_CR5","unstructured":"Asano, T., Kawamura, Y., Klette, R., Obokata, K.: Digital curve approximation with length evaluation. ICEICE Trans. Fundam. Electron. Commun. Comput. Sci. E86-A(5), 987\u2013994 (2003)"},{"issue":"4","key":"1060_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.jvcir.2010.02.001","volume":"21","author":"A Biswas","year":"2010","unstructured":"Biswas, A., Bhowmick, P., Bhattacharya, B.: Construction of isothetic covers of a digital object: a combinatorial approach. J. Vis. Commun. Image Represent. 21(4), 295\u2013310 (2010). https:\/\/doi.org\/10.1016\/j.jvcir.2010.02.001","journal-title":"J. Vis. Commun. Image Represent."},{"key":"1060_CR7","doi-asserted-by":"publisher","unstructured":"Chang, H.C., Erickson, J., Xu, C.: Detecting weakly simple polygons. In: Indyk, P. (ed.) Proceedings of SODA 2015, 26th Annual ACM-SIAM Symp. on Discrete Algorithms (USA, 2015), vol.\u00a03, pp. 1657\u20131672. SIAM (ISBN 978-1-61197-374-7) (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.110","DOI":"10.1137\/1.9781611973730.110"},{"key":"1060_CR8","doi-asserted-by":"publisher","unstructured":"Coeurjolly, D., Klette, R.: Comparative evaluation of length estimators of digital curves. IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 252\u2013258 (2004). https:\/\/doi.org\/10.1109\/TPAMI.2004.1262194","DOI":"10.1109\/TPAMI.2004.1262194"},{"key":"1060_CR9","doi-asserted-by":"publisher","unstructured":"Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.: On finding an orthogonal convex skull of a digital object. Int. J. Imaging Syst. Technol. 21, 14\u201327 (2011). https:\/\/doi.org\/10.1002\/ima.20266","DOI":"10.1002\/ima.20266"},{"key":"1060_CR10","unstructured":"Gonzalez, R., Woods, R.: Digital Image Processing, reprint, 1993rd edn. Addison Wesley Comp, USA (1992)"},{"key":"1060_CR11","unstructured":"Gonzalez, R., Woods, R., Eddins, S.: Digital Image Processing using Matlab (The parts of interest for this article are contained as the same in its 2nd edn. 2010), 3rd edn. Gatesmark Publishing LLC, USA (2020)"},{"key":"1060_CR12","unstructured":"Gr\u00fcnbaum, B., Shephard, G.: Tilings and Patterns. W.H. Freeman and Company, USA (1978)"},{"key":"1060_CR13","doi-asserted-by":"publisher","unstructured":"Klette, R.: Multigrid convergence of geometric features. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry, pp. 318\u2013338. Springer, LNCS 2243, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45576-0-19","DOI":"10.1007\/3-540-45576-0-19"},{"key":"1060_CR14","doi-asserted-by":"crossref","unstructured":"Klette, R., Kovalevsky, V., Yip, B.: On the length estimation of digital curves. In: SPIE (ed.) SPIE Proc. of Vision Geometry VIII, pp. 117\u2013129. SPIE Proc. Series, USA (1999)","DOI":"10.1117\/12.364118"},{"key":"1060_CR15","volume-title":"Digital Geometry - Geometric Methods for Digital Picture Analysis","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry - Geometric Methods for Digital Picture Analysis. Morgan Kaufmann Publisher, USA (2004)"},{"key":"1060_CR16","first-page":"673","volume":"9","author":"R Klette","year":"2000","unstructured":"Klette, R., Yip, B.: The length of digital curves. Mach. Gr. Vis. 9, 673\u2013703 (2000)","journal-title":"Mach. Gr. Vis."},{"key":"1060_CR17","doi-asserted-by":"publisher","unstructured":"Kovalevsky, V.: New definition and fast recognition of digital straight segments and arcs. In: Proc. of 10th Int. Conf on Pattern Recognition, vol. II, pp. 31\u201334. IEEE, NJ, USA (1990). https:\/\/doi.org\/10.1109\/ICPR.1990.119324","DOI":"10.1109\/ICPR.1990.119324"},{"key":"1060_CR18","first-page":"218","volume-title":"Robust Computer Vision","author":"V Kovalevsky","year":"1992","unstructured":"Kovalevsky, V., Fuchs, S.: Theoretical and experimental analysis of the accuracy of perimeter estimates. In: F\u00f6rster, W., Ruwiedel, S. (eds.) Robust Computer Vision, pp. 218\u2013242. Wichmann, Karlsruhe, Germany (1992)"},{"key":"1060_CR19","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1016\/j.dam.2011.08.002","volume":"159","author":"J Lachaud","year":"2011","unstructured":"Lachaud, J., Provencal, X.: Two linear-time algorithms for computing the minimum length polygon of a digital contour. Discrete Appl. Math. 159, 2229\u20132250 (2011). https:\/\/doi.org\/10.1016\/j.dam.2011.08.002","journal-title":"Discrete Appl. Math."},{"key":"1060_CR20","doi-asserted-by":"publisher","unstructured":"Li, F., Klette, R.: Euclidean Shortest Paths, Exact or Approximate Algorithms. Springer, London (2011). https:\/\/doi.org\/10.1007\/978-1-4471-2256-2","DOI":"10.1007\/978-1-4471-2256-2"},{"key":"1060_CR21","unstructured":"O\u2019Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, USA (1998)"},{"key":"1060_CR22","unstructured":"Ortmann, W.: Software. Computer Vision Group at Jena University (Accessed 20 Dec 2020)). https:\/\/www.inf-cv.uni-jena.de\/Group\/Software.html"},{"key":"1060_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-93208-3","volume-title":"Algorithms for Graphics and Image Processing","author":"T Pavlidis","year":"1982","unstructured":"Pavlidis, T.: Algorithms for Graphics and Image Processing. Computer Science Press, USA (1982)"},{"key":"1060_CR24","doi-asserted-by":"publisher","unstructured":"Provencal, X., Lachaud, J.: Two linear-time algorithms for computing the minimum length polygon of a digital contour. In: S.\u00a0Brlek, C.\u00a0Reutenauer, X.\u00a0Provencal (eds.) Proc. of DGCI, Int. Conf. on Discrete Geometry for Computer Imagery, pp. 104\u2013117. Springer, LNCS 5810, Berlin Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04397-0-10","DOI":"10.1007\/978-3-642-04397-0-10"},{"key":"1060_CR25","doi-asserted-by":"publisher","first-page":"2693","DOI":"10.1016\/j.patcog.2011.03.018","volume":"44","author":"T Roussillon","year":"2011","unstructured":"Roussillon, T., Sivignon, I.: Faithful polygonal representation of the convex and concave parts of a digital curve. Pattern Recogn. 44, 2693\u20132700 (2011). https:\/\/doi.org\/10.1016\/j.patcog.2011.03.018","journal-title":"Pattern Recogn."},{"key":"1060_CR26","unstructured":"Roussillon, T., Sivignon, I.: Local convexity properties of digital curves. Technical Report, at https:\/\/liris.cnrs.fr\/Documents\/Liris-4798.pdf (Accessed Dec 2 2020) pp. 1\u201322 (Aug. 2010)"},{"key":"1060_CR27","doi-asserted-by":"crossref","unstructured":"Roussillon, T., Tougne, L., Sivignon, I.: What does digital straightness tell about digital convexity ? In: Wiederhold, P., Barneva, R. (eds.) Proceedings of IWCIA, International Workshop on Combinatorial Image Analysis IWCIA, pp. 43\u201355. Springer, LNCS 5810, Berlin (2009)","DOI":"10.1007\/978-3-642-10210-3_4"},{"key":"1060_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0031-3203(70)90037-3","volume":"2","author":"J Sklansky","year":"1970","unstructured":"Sklansky, J.: Recognition of convex blobs. Pattern Recogn. 2, 3\u201310 (1970). https:\/\/doi.org\/10.1016\/0031-3203(70)90037-3","journal-title":"Pattern Recogn."},{"key":"1060_CR29","doi-asserted-by":"crossref","unstructured":"Sklansky, J.: Measuring cavity on a rectangular mosaic. IEEE Trans. Comput. C\u201321(12), 1355\u20131364 (1972)","DOI":"10.1109\/T-C.1972.223507"},{"issue":"3","key":"1060_CR30","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TC.1972.5008948","volume":"21","author":"J Sklansky","year":"1972","unstructured":"Sklansky, J., Chazin, R., Hansen, B.: Minimum perimeter polygons of digitized silhouettes. IEEE Trans. Comput. 21(3), 260\u2013268 (1972). https:\/\/doi.org\/10.1109\/TC.1972.5008948","journal-title":"IEEE Trans. Comput."},{"key":"1060_CR31","doi-asserted-by":"publisher","unstructured":"Sklansky, J., Kibler, D.: A theory of nonuniformly digitized binary pictures. IEEE Trans. Syst. Man Cybern. 6(9), 637\u2013647 (1976). https:\/\/doi.org\/10.1109\/TSMC.1976.4309569","DOI":"10.1109\/TSMC.1976.4309569"},{"key":"1060_CR32","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. 55, 369\u2013383 (1994). https:\/\/doi.org\/10.1016\/0377-0427(94)90040-X","journal-title":"J. Comput. Appl. Math."},{"key":"1060_CR33","first-page":"113","volume-title":"Advances in Digital and Computational Geometry","author":"F Sloboda","year":"1998","unstructured":"Sloboda, F., Zatco, 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. Springer, Singapore (1998)"},{"key":"1060_CR34","doi-asserted-by":"publisher","unstructured":"Tajine, M., Daurat, A.: On local definitions of length of digital curves. In: N.\u00a0et\u00a0al. (ed.) Proceedings of DGCI, International Conference on Discrete Geometry for Computer Imagery, pp. 114\u2013123. Springer, LNCS 2886, Berlin (2003). https:\/\/doi.org\/10.1007\/978-3-540-39966-7-10","DOI":"10.1007\/978-3-540-39966-7-10"},{"key":"1060_CR35","unstructured":"Toussaint, G.: Computing geodesic properties inside a simple polygon. Revue d\u2019Intelligence Artificielle 3(2), 265\u2013278 (1989)"},{"key":"1060_CR36","doi-asserted-by":"crossref","unstructured":"de\u00a0Vieilleville, F., Lachaud, J.: Digital deformable model simulating active contours. In: Brlek, S. et al. (ed.) Proceedings of DGCI, International Conference on Discrete Geometry for Computer Imagery, pp. 203\u2013216. Springer LNCS 5810, Berlin (2009)","DOI":"10.1007\/978-3-642-04397-0_18"},{"key":"1060_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46779-0","volume-title":"Discrete images, objects, and functions in $${\\mathbb{Z}}^n$$","author":"K Voss","year":"1993","unstructured":"Voss, K.: Discrete images, objects, and functions in $${\\mathbb{Z}}^n$$. Springer, Berlin (1993)"},{"key":"1060_CR38","unstructured":"Weisstein, E.: Polygon. From MathWorld A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Polygon.html (2021)"},{"key":"1060_CR39","unstructured":"Weisstein, E.: Polyomino. From MathWorld A Wolfram Web Resource. https:\/\/mathworld.wolfram.com\/Polyomino.html (2021)"},{"key":"1060_CR40","unstructured":"Weisstein, E.W.: Archimedes\u2019 Spiral. From MathWorld\u2014A Wolfram Web Resource. https:\/\/mathworld.wolfram.com\/ArchimedesSpiral.html (Accessed Oct 2021) (2021)"},{"key":"1060_CR41","doi-asserted-by":"publisher","unstructured":"Wiederhold, P.: Digital geometry. In: Laplante, P. (ed.) Encyclopedia of Computer Science and Technology (2nd Ed.), vol.\u00a0I, pp. 364\u2013376. Taylor and Francis Group (2016). https:\/\/doi.org\/10.1081\/E-ECST2-120054031","DOI":"10.1081\/E-ECST2-120054031"},{"key":"1060_CR42","doi-asserted-by":"publisher","unstructured":"Wiederhold, P., Reyes, H.: Relative convex hull determination from convex hulls in the plane. In: Barneva, R. et al. (ed.) Proceedings of IWCIA, International Workshop on Combinatorial Image Analysis (India, 2015), pp. 1\u201315. Springer LNCS 9448, Switzerland (2015). https:\/\/doi.org\/10.1007\/978-3-319-26145-44","DOI":"10.1007\/978-3-319-26145-44"}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-021-01060-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10851-021-01060-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-021-01060-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T09:09:21Z","timestamp":1644656961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10851-021-01060-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,9]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1060"],"URL":"https:\/\/doi.org\/10.1007\/s10851-021-01060-0","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"type":"print","value":"0924-9907"},{"type":"electronic","value":"1573-7683"}],"subject":[],"published":{"date-parts":[[2022,1,9]]},"assertion":[{"value":"9 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}