{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:43:37Z","timestamp":1743014617206,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"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_38","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"481-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Average Curve of n Digital Curves"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Sivignon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"key":"38_CR1","unstructured":"DGtal: Digital Geometry Tools and Algorithms Library. http:\/\/dgtal.org"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5201\/ipol.2012.abmh-rtmsa","volume":"2","author":"L Alvarez","year":"2012","unstructured":"Alvarez, L., Baumela, L., M\u00e1rquez-Neila, P., Henr\u00edquez, P.: A real time morphological snakes algorithm. Image Process. Line 2, 1\u20137 (2012)","journal-title":"Image Process. Line"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11556121_19","volume-title":"Computer Analysis of Images and Patterns","author":"I Boukhriss","year":"2005","unstructured":"Boukhriss, I., Miguet, S., Tougne, L.: Discrete average of two-dimensional shapes. In: Gagalowicz, A., Philips, W. (eds.) CAIP 2005. LNCS, vol. 3691, pp. 145\u2013152. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11556121_19"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Breen, D.E., Mauch, S., Whitaker, R.T.: 3D scan conversion of CSG models into distance volumes. In: Proceedings of the 1998 IEEE Symposium on Volume Visualization, pp. 7\u201314. ACM (1998)","DOI":"10.1145\/288126.288137"},{"issue":"3","key":"38_CR5","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00453-012-9654-2","volume":"66","author":"K Buchin","year":"2013","unstructured":"Buchin, K., et al.: Median trajectories. Algorithmica 66(3), 595\u2013614 (2013)","journal-title":"Algorithmica"},{"issue":"5","key":"38_CR6","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.patrec.2003.12.002","volume":"25","author":"D Coeurjolly","year":"2004","unstructured":"Coeurjolly, D., Miguet, S., Tougne, L.: 2D and 3D visibility in discrete geometry: an application to discrete geodesic paths. Pattern Recognit. Lett. 25(5), 561\u2013570 (2004)","journal-title":"Pattern Recognit. Lett."},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-09955-2_7","volume-title":"Discrete Geometry for Computer Imagery","author":"D Coeurjolly","year":"2014","unstructured":"Coeurjolly, D.: 2D subquadratic separable distance transformation for path-based norms. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds.) DGCI 2014. LNCS, vol. 8668, pp. 75\u201387. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09955-2_7"},{"issue":"3","key":"38_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/TPAMI.2007.54","volume":"29","author":"D Coeurjolly","year":"2007","unstructured":"Coeurjolly, D., Montanvert, A.: Optimal separable algorithms to compute the reverse euclidean distance transformation and discrete medial axis in arbitrary dimension. IEEE Trans. Pattern Anal. Mach. Intell. 29(3), 437\u2013448 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"38_CR9","unstructured":"Couprie, M., Bertrand, G.: Topological gray-scale watershed transformation (1997)"},{"issue":"10","key":"38_CR10","doi-asserted-by":"publisher","first-page":"1543","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), 1543\u20131556 (2007)","journal-title":"Image Vis. Comput."},{"issue":"2","key":"38_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10851-005-4892-4","volume":"22","author":"M Couprie","year":"2005","unstructured":"Couprie, M., Najman, L., Bertrand, G.: Quasi-linear algorithms for the topological watershed. J. Math. Imaging Vis. 22(2), 231\u2013249 (2005)","journal-title":"J. Math. Imaging Vis."},{"key":"38_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":"4","key":"38_CR13","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1142\/S0218001495000249","volume":"09","author":"I Debled-Rennesson","year":"1995","unstructured":"Debled-Rennesson, I., Reveill\u00e8s, J.P.: A linear algorithm for segmentation of digital curves. Int. J. Pattern Recognit. Artif. Intell. 09(4), 635\u2013662 (1995)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"38_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8765-5","volume-title":"Ridges in Image and Data Analysis","author":"D Eberly","year":"1996","unstructured":"Eberly, D.: Ridges in Image and Data Analysis. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/978-94-015-8765-5"},{"issue":"5","key":"38_CR15","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1142\/S0218195907002422","volume":"17","author":"F Chazal","year":"2007","unstructured":"Chazal, F., Lieutier, A., Rossignac, J.: Normal-map between normal-compatible manifolds. Int. J. Comput. Geom. Appl. 17(5), 403\u2013421 (2007)","journal-title":"Int. J. Comput. Geom. Appl."},{"volume-title":"Handbook of Discrete and Computational Geometry","year":"1997","key":"38_CR16","unstructured":"Goodman, J.E., O\u2019Rourke, J. (eds.): Handbook of Discrete and Computational Geometry. CRC Press Inc., Boca Raton (1997)"},{"issue":"4","key":"38_CR17","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/TVCG.2006.56","volume":"12","author":"MW Jones","year":"2006","unstructured":"Jones, M.W., Baerentzen, J.A., Sramek, M.: 3D distance fields: a survey of techniques and applications. IEEE Trans. Vis. Comput. Graph. 12(4), 581\u2013599 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"38_CR18","unstructured":"Legland, D., Arganda-Carreras, I.: ImageJ-MorphoLibJ. http:\/\/imagej.net\/MorphoLibJ"},{"issue":"5","key":"38_CR19","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TKDE.2009.158","volume":"22","author":"S Nutanong","year":"2010","unstructured":"Nutanong, S., Tanin, E., Zhang, R.: Incremental evaluation of visible nearest neighbor queries. IEEE Trans. Knowl. Data Eng. 22(5), 665\u2013681 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9","key":"38_CR20","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1145\/358746.358758","volume":"24","author":"J O\u2019Rourke","year":"1981","unstructured":"O\u2019Rourke, J.: An on-line algorithm for fitting straight lines between data ranges. Commun. ACM 24(9), 574\u2013578 (1981)","journal-title":"Commun. ACM"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Peikert, R., Sadlo, F.: Height ridge computation and filtering for visualization. In: 2008 IEEE Pacific Visualization Symposium, pp. 119\u2013126 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475467"},{"issue":"10","key":"38_CR22","doi-asserted-by":"publisher","first-page":"4297","DOI":"10.1109\/TIP.2014.2346018","volume":"23","author":"DK Prasad","year":"2014","unstructured":"Prasad, D.K., Leung, M.K.H., Quek, C., Brown, M.S.: DEB: definite error bounded tangent estimator for digital curves. IEEE Trans. Image Process. 23(10), 4297\u20134310 (2014)","journal-title":"IEEE Trans. Image Process."},{"key":"38_CR23","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.cad.2015.06.017","volume":"70","author":"M Sati","year":"2016","unstructured":"Sati, M., Rossignac, J., Seidel, R., Wyvill, B., Musuvathy, S.: Average curve of n smooth planar curves. Comput.-Aided Design 70, 46\u201355 (2016)","journal-title":"Comput.-Aided Design"},{"issue":"4","key":"38_CR24","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1073\/pnas.93.4.1591","volume":"93","author":"JA Sethian","year":"1996","unstructured":"Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. 93(4), 1591\u20131595 (1996)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"38_CR25","doi-asserted-by":"crossref","unstructured":"Soille, P., Vincent, L.: Determining watersheds in digital pictures via flooding simulations (1990)","DOI":"10.1117\/12.24211"},{"issue":"8","key":"38_CR26","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.patcog.2008.11.034","volume":"42","author":"F de Vieilleville","year":"2009","unstructured":"de Vieilleville, F., Lachaud, J.O.: Comparison and improvement of tangent estimators on digital curves. Pattern Recognit. 42(8), 1693\u20131707 (2009). Advances in Combinatorial Image Analysis","journal-title":"Pattern Recognit."}],"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_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:10:22Z","timestamp":1679188222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_38","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"}]}}