{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:09:57Z","timestamp":1742998197634,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811540141"},{"type":"electronic","value":"9789811540158"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-4015-8_25","type":"book-chapter","created":{"date-parts":[[2020,3,28]],"date-time":"2020-03-28T10:02:46Z","timestamp":1585389766000},"page":"281-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Delaunay Triangulation Based Thinning Algorithm for Alphabet Images"],"prefix":"10.1007","author":[{"given":"Philumon","family":"Joseph","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binsu C.","family":"Kovoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Job","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,29]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-10210-3_13","volume-title":"Combinatorial Image Analysis","author":"P Kardos","year":"2009","unstructured":"Kardos, P., N\u00e9meth, G., Pal\u00e1gyi, K.: An order\u2013independent sequential thinning algorithm. In: Wiederhold, P., Barneva, R.P. (eds.) IWCIA 2009. LNCS, vol. 5852, pp. 162\u2013175. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-10210-3_13"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1134\/S1054661818010030","volume":"28","author":"B Bataineh","year":"2018","unstructured":"Bataineh, B.: An iterative thinning algorithm for binary images based on sequential and parallel approaches. Pattern Recogn. Image Anal. 28(1), 34\u201343 (2018). \nhttps:\/\/doi.org\/10.1134\/S1054661818010030","journal-title":"Pattern Recogn. Image Anal."},{"key":"25_CR3","unstructured":"Jain, H.: A sequential thinning algorithm for multi-dimensional binary patterns. arXiv, abs\/1710.03025 (2017)"},{"key":"25_CR4","unstructured":"Huang, L., Wan, G., Liu, C.: An improved parallel thinning algorithm. In: Proceedings of the International Conference on Document Analysis and Recognition, Edinburgh, Scotland, vol. 2, pp. 780\u2013783 (2003)"},{"key":"25_CR5","unstructured":"Leung, W., Ng, C.M., Yu, P.C.: Contour following parallel thinning for simple binary images. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Nashville, TN, USA, vol. 3, pp. 1650\u20131655 (2000)"},{"issue":"5","key":"25_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1007\/s11760-016-1034-y","volume":"11","author":"J Dong","year":"2017","unstructured":"Dong, J., Chen, Y., Yang, Z., Ling, B.W.K.: A parallel thinning algorithm based on stroke continuity detection. Signal Image Video Process. 11(5), 873\u2013879 (2017). \nhttps:\/\/doi.org\/10.1007\/s11760-016-1034-y","journal-title":"Signal Image Video Process."},{"key":"25_CR7","series-title":"NATO ASI Series. Series F: Computer and System Sciences","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03039-4","volume-title":"Shape in Picture: Mathematical Description of Shape in Gray Level Images","author":"O Ying-Lie","year":"1994","unstructured":"Ying-Lie, O., Toet, A., Foster, D., Heijmans, H.J.A.M., Meer, P.: Shape in Picture: Mathematical Description of Shape in Gray Level Images. NATO ASI Series. Series F: Computer and System Sciences, vol. 126. Springer, Driebergen (1994). \nhttps:\/\/doi.org\/10.1007\/978-3-662-03039-4"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11863939_6","volume-title":"Geographic Information Science","author":"A Galton","year":"2006","unstructured":"Galton, A., Duckham, M.: What is the region occupied by a set of points? In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds.) GIScience 2006. LNCS, vol. 4197, pp. 81\u201398. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11863939_6"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-5193(73)90175-6","volume":"38","author":"H Blum","year":"1973","unstructured":"Blum, H.: Biological shape and visual science (Part I). J. Theor. Biol. 38(2), 205\u2013287 (1973)","journal-title":"J. Theor. Biol."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s001380050040","volume":"9","author":"T Miyatake","year":"1997","unstructured":"Miyatake, T., Matsushima, H., Ejiri, M.: Contour representation of binary images using run-type direction codes. Mach. Vis. Appl. 9, 193\u2013200 (1997)","journal-title":"Mach. Vis. Appl."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0146-664X(81)90017-4","volume":"17","author":"PE Danielsson","year":"1981","unstructured":"Danielsson, P.E.: An improvement of Kruse\u2019s segmentation algorithm. Comput. Graph. Image Process. 17, 394\u2013396 (1981)","journal-title":"Comput. Graph. Image Process."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1520-684X(199910)30:11<1::AID-SCJ1>3.0.CO;2-S","volume":"30","author":"K Shoji","year":"1999","unstructured":"Shoji, K., Miyamichi, J., Hirano, K.: Contour following and reconstruction of binary images stored in run format. Syst. Comput. Jpn. 30, 1\u201311 (1999)","journal-title":"Syst. Comput. Jpn."},{"key":"25_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"DM Berg","year":"2008","unstructured":"Berg, D.M., Cheong, O., Kreveld, M.V., et al.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/TIT.1983.1056714","volume":"29","author":"H Edelsbrunner","year":"1983","unstructured":"Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the shape of a set of points in the plane. Trans. Inf. Theory 29, 551\u2013559 (1983)","journal-title":"Trans. Inf. Theory"},{"issue":"10","key":"25_CR15","doi-asserted-by":"publisher","first-page":"3224","DOI":"10.1016\/j.patcog.2008.03.023","volume":"41","author":"M Duckham","year":"2008","unstructured":"Duckham, M., Kulik, L., Worboys, M.F., Galton, A.: Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern Recogn. 41(10), 3224\u20133236 (2008)","journal-title":"Pattern Recogn."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.cag.2015.05.025","volume":"51","author":"S Methirumangalath","year":"2015","unstructured":"Methirumangalath, S., Parakkat, A.D., Muthuganapathy, R.: A unified approach towards reconstruction of a planar point set. Comput. Graph. 51, 90\u201397 (2015)","journal-title":"Comput. Graph."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.cad.2014.12.002","volume":"62","author":"J Peethambaran","year":"2015","unstructured":"Peethambaran, J., Muthuganapathy, R.: A non-parametric approach to shape reconstruction from planar point sets through Delaunay filtering. Comput. Aided Des. 62, 164\u2013175 (2015)","journal-title":"Comput. Aided Des."},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cag.2017.05.006","volume":"66","author":"S Methirumangalath","year":"2017","unstructured":"Methirumangalath, S., Kannan, S.S., Parakkat, A.D., Muthuganapathy, R.: Hole detection in a planar point set: an empty disk approach. Comput. Graph. 66, 124\u2013134 (2017)","journal-title":"Comput. Graph."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1111\/cgf.12974","volume":"35","author":"AD Parakkat","year":"2016","unstructured":"Parakkat, A.D., Muthuganapathy, R.: Crawl through neighbors: a simple curve reconstruction algorithm. Comput. Graph. Forum 35, 177\u2013186 (2016)","journal-title":"Comput. Graph. Forum"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.cag.2018.05.015","volume":"74","author":"AD Parakkat","year":"2018","unstructured":"Parakkat, A.D., Methirumangalath, S., Muthuganapathy, R.: Peeling the longest: a simple generalized curve reconstruction algorithm. Comput. Graph. 74, 191\u2013201 (2018)","journal-title":"Comput. Graph."},{"key":"25_CR21","unstructured":"Rohatgi, A.: WebPlotDigitizer, San Francisco, California, USA (2019). \nhttps:\/\/automeris.io\/WebPlotDigitizer"},{"key":"25_CR22","unstructured":"Yvinec, M.: 2D triangulation. In: CGAL User and Reference Manual, 4.10 edn. CGAL Editorial Board (2017)"},{"key":"25_CR23","unstructured":"http:\/\/www.ee.surrey.ac.uk\/CVSSP\/demos\/chars74k\/\n\n. Accessed 20 Mar 2019"},{"key":"25_CR24","unstructured":"Levine, J.N.: Dots All For Now JL. \nhttps:\/\/fonts2u.com\/dots-all-for-now-jl.font\n\n. Accessed 15 Mar 2019"}],"container-title":["Communications in Computer and Information Science","Computer Vision and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-4015-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,28]],"date-time":"2020-03-28T21:04:30Z","timestamp":1585429470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-4015-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811540141","9789811540158"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-4015-8_25","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CVIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Vision and Image Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jaipur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"27 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cvip2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cvip2019.mnit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"202","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":"73","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":"10","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":"36% - 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":"3","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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}