{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:10Z","timestamp":1742913670173,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140847"},{"type":"electronic","value":"9783030140854"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14085-4_37","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"469-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Discrete Bisector Function Based on Annulus"],"prefix":"10.1007","author":[{"given":"Sangb\u00e9","family":"Sidibe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rita","family":"Zrour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Andres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaelle","family":"Largeteau-Skapin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"key":"37_CR1","unstructured":"DGtal: Digital geometry tools & algorithms library. http:\/\/dgtal.org\/"},{"issue":"5","key":"37_CR2","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/0097-8493(94)90164-3","volume":"18","author":"E Andres","year":"1994","unstructured":"Andres, E.: Discrete circles, rings and spheres. Comput. Graph. 18(5), 695\u2013706 (1994)","journal-title":"Comput. Graph."},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/2945.582354","volume":"3","author":"E Andres","year":"1997","unstructured":"Andres, E., Jacob, M.: Discrete analytical hyperspheres. IEEE Trans. Vis. Comput. Graph 3, 75\u201386 (1997)","journal-title":"IEEE Trans. Vis. Comput. Graph"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/3-540-60298-4_303","volume-title":"Image Analysis and Processing","author":"D Attali","year":"1995","unstructured":"Attali, D., di Baja, G.S., Thiel, E.: Pruning discrete and semicontinuous skeletons. In: Braccini, C., DeFloriani, L., Vernazza, G. (eds.) ICIAP 1995. LNCS, vol. 974, pp. 488\u2013493. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60298-4_303"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0925-7721(01)00019-0","volume":"19","author":"D Attali","year":"2001","unstructured":"Attali, D., Lachaud, J.O.: Delaunay conforming iso-surface, skeleton extraction and noise removal. Comput. Geom.: Theory Appl. 19, 175\u2013189 (2001)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"37_CR6","unstructured":"Attali, D., Montanvert, A.: Modeling noise for a better simplification of skeletons. In: ICIP, vol. 3, pp. 13\u201316 (1996)"},{"key":"37_CR7","unstructured":"Blum, H.: A transformation for extracting new descriptors of shape. In: Models for the Perception of Speech and Visual Form, pp. 362\u2013380 (1967)"},{"issue":"9","key":"37_CR8","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1016\/j.patrec.2010.09.002","volume":"32","author":"J Chaussard","year":"2011","unstructured":"Chaussard, J., Couprie, M., Talbot, H.: Robust skeletonization using the discrete $$\\lambda $$-medial axis. Pattern Recognit. Lett. 32(9), 1384\u20131394 (2011)","journal-title":"Pattern Recognit. Lett."},{"issue":"4","key":"37_CR9","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.gmod.2005.01.002","volume":"67","author":"F Chazal","year":"2005","unstructured":"Chazal, F., Lieutier, A.: The $$\\lambda $$-medial axis. Graph. Model. 67(4), 304\u2013331 (2005)","journal-title":"Graph. Model."},{"issue":"10","key":"37_CR10","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.imavis.2006.06.020","volume":"25","author":"M Couprie","year":"2007","unstructured":"Couprie, M., Coeurjolly, D., Zrour, R.: Discrete bisector function and Euclidean skeleton in 2D and 3D. Image Vis. Comput. 25(10), 1519\u20131698 (2007)","journal-title":"Image Vis. Comput."},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-31965-8_21","volume-title":"Discrete Geometry for Computer Imagery","author":"M Couprie","year":"2005","unstructured":"Couprie, M., Zrour, R.: Discrete bisector function and Euclidean skeleton. In: Andres, E., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol. 3429, pp. 216\u2013227. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31965-8_21"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0146-664X(80)90054-4","volume":"14","author":"PE Danielsson","year":"1980","unstructured":"Danielsson, P.E.: Euclidean distance mapping. Comput. Graph. Image Process. 14, 227\u2013248 (1980)","journal-title":"Comput. Graph. Image Process."},{"issue":"3","key":"37_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0020-0190(96)00049-X","volume":"58","author":"T Hirata","year":"1996","unstructured":"Hirata, T.: A unified linear-time algorithm for computing distance maps. Inf. Process. Lett. 58(3), 129\u2013133 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"37_CR14","doi-asserted-by":"publisher","first-page":"37:1","DOI":"10.1145\/2897824.2925959","volume":"35","author":"BH Le","year":"2016","unstructured":"Le, B.H., Hodgins, J.K.: Real-time skeletal skinning with optimized centers of rotation. ACM Trans. Graph. 35(4), 37:1\u201337:10 (2016)","journal-title":"ACM Trans. Graph."},{"issue":"5","key":"37_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0262-8856(97)00074-7","volume":"16","author":"G Malandain","year":"1998","unstructured":"Malandain, G., Fernandez-Vidal, S.: Euclidean skeletons. Image Vis. Comput. 16(5), 317\u2013328 (1998)","journal-title":"Image Vis. Comput."},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.patcog.2016.02.011","volume":"56","author":"R Marie","year":"2016","unstructured":"Marie, R., Labbani-Igbida, O., Mouaddib, E.M.: The delta medial axis: a fast and robust algorithm for filtered skeleton extraction. Pattern Recognit. 56, 26\u201339 (2016)","journal-title":"Pattern Recognit."},{"key":"37_CR17","series-title":"Computational Imaging and Vision","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/0-306-47025-X_36","volume-title":"Mathematical Morphology and its Applications to Image and Signal Processing","author":"A Meijster","year":"2002","unstructured":"Meijster, A., Roerdink, J.B.T.M., Hesselink, W.H.: A general algorithm for computing distance transforms in linear time. In: Goutsias, J., Vincent, L., Bloomberg, D.S. (eds.) Mathematical Morphology and its Applications to Image and Signal Processing. CIVI, vol. 18, pp. 331\u2013340. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/0-306-47025-X_36"},{"key":"37_CR18","unstructured":"Meyer, F.: Cytologie quantitative et morphologie math\u00e9matique. Ph.D. thesis, Ecole des mines de Paris (1979)"},{"issue":"2","key":"37_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.imavis.2004.06.007","volume":"23","author":"E Remy","year":"2005","unstructured":"Remy, E., Thiel, E.: Exact medial axis with Euclidean distance. Image Vis. Comput. 23(2), 167\u2013175 (2005)","journal-title":"Image Vis. Comput."},{"issue":"11","key":"37_CR20","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1016\/0031-3203(94)90133-3","volume":"27","author":"T Saito","year":"1994","unstructured":"Saito, T., Toriwaki, J.I.: New algorithms for Euclidean distance transformation of an n-dimensional digitized picture with applications. Pattern Recognit. 27(11), 1551\u20131565 (1994)","journal-title":"Pattern Recognit."},{"key":"37_CR21","unstructured":"Shamos, M.I.: Computational geometry. Ph.D. thesis, Yale University (1978)"},{"key":"37_CR22","unstructured":"Talbot, H., Vincent, L.M.: Euclidean skeletons and conditional bisectors. In: Proceedings of Visual Communications and Image Processing, vol. 1818, pp. 862\u2013877. International Society for Optics and Photonics (1992)"},{"issue":"28","key":"37_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S1474-6670(17)49480-8","volume":"25","author":"Y Xu","year":"1992","unstructured":"Xu, Y., Mattikalli, R., Khosla, P.: Motion planning using medial axis. IFAC Proc. 25(28), 135\u2013140 (1992)","journal-title":"IFAC Proc."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14085-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:10:28Z","timestamp":1679188228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgci2019.sciencesconf.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","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":"38","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":"0","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":"76% - 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":"1-2","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}