{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T08:08:32Z","timestamp":1745395712976,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031198960"},{"type":"electronic","value":"9783031198977"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19897-7_29","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T17:14:33Z","timestamp":1666286073000},"page":"366-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Lattice-Based Plane-Probing Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5341-1490","authenticated-orcid":false,"given":"Jui-Ting","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2524-3685","authenticated-orcid":false,"given":"Tristan","family":"Roussillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3164-8697","authenticated-orcid":false,"given":"David","family":"Coeurjolly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-79126-3_31","volume-title":"Discrete Geometry for Computer Imagery","author":"E Charrier","year":"2008","unstructured":"Charrier, E., Buzer, L.: An efficient and quasi linear worst-case time algorithm for digital plane recognition. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 346\u2013357. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79126-3_31"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-37067-0_19","volume-title":"Discrete Geometry for Computer Imagery","author":"D Coeurjolly","year":"2013","unstructured":"Coeurjolly, D., Lachaud, J.-O., Levallois, J.: Integral based curvature estimators in digital geometry. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 215\u2013227. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37067-0_19"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1137\/140977552","volume":"8","author":"L Cuel","year":"2015","unstructured":"Cuel, L., Lachaud, J.O., M\u00e9rigot, Q., Thibert, B.: Robust geometry estimation using the generalized voronoi covariance measure. SIAM J. Imaging Sci. 8(2), 1293\u20131314 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"29_CR4","unstructured":"Debled-Rennesson, I., Reveill\u00e8s, J.: An incremental algorithm for digital plane recognition. In: Proceedings of Discrete Geometry for Computer Imagery, pp. 194\u2013205 (1994)"},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.dam.2005.02.026","volume":"151","author":"Y G\u00e9rard","year":"2005","unstructured":"G\u00e9rard, Y., Debled-Rennesson, I., Zimmermann, P.: An elementary digital plane recognition algorithm. Discret. Appl. Math. 151(1), 169\u2013183 (2005)","journal-title":"Discret. Appl. Math."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/s10851-020-00965-6","volume":"62","author":"JO Lachaud","year":"2020","unstructured":"Lachaud, J.O., Meyron, J., Roussillon, T.: An optimized framework for plane-probing algorithms. J. Math. Imaging Vis. 62, 718\u2013736 (2020)","journal-title":"J. Math. Imaging Vis."},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2015.11.021","volume":"624","author":"JO Lachaud","year":"2016","unstructured":"Lachaud, J.O., Proven\u00e7al, X., Roussillon, T.: An output-sensitive algorithm to compute the normal vector of a digital plane. J. Theor. Comput. Sci. (TCS) 624, 73\u201388 (2016)","journal-title":"J. Theor. Comput. Sci. (TCS)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Lachaud, J.O., Proven\u00e7al, X., Roussillon, T.: Computation of the normal vector to a digital plane by sampling signicant points. In: 19th IAPR International Conference on Discrete Geometry for Computer Imagery, Nantes, France, April 2016","DOI":"10.1007\/978-3-319-32360-2_15"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10851-017-0704-x","volume":"59","author":"JO Lachaud","year":"2017","unstructured":"Lachaud, J.O., Proven\u00e7al, X., Roussillon, T.: Two plane-probing algorithms for the computation of the normal vector to a digital plane. J. Math. Imaging Vis. 59(1), 23\u201339 (2017)","journal-title":"J. Math. Imaging Vis."},{"key":"29_CR10","unstructured":"Reveill\u00e8s, J.P.: G\u00e9om\u00e9trie Discr\u00e8te, calculs en nombres entiers et algorithmique. Th\u00e8se d\u2019etat, Universit\u00e9 Louis Pasteur (1991)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-030-14085-4_30","volume-title":"Discrete Geometry for Computer Imagery","author":"T Roussillon","year":"2019","unstructured":"Roussillon, T., Lachaud, J.-O.: Digital plane recognition with fewer probes. In: Couprie, M., Cousty, J., Kenmochi, Y., Mustafa, N. (eds.) DGCI 2019. LNCS, vol. 11414, pp. 380\u2013393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14085-4_30"},{"key":"29_CR12","unstructured":"Roussillon, T., Lu, J.T., Lachaud, J.O., Coeurjolly, D.: Delaunay property and proximity results of the L-algorithm. Research report, Universit\u00e9 de Lyon, July 2022. https:\/\/hal.archives-ouvertes.fr\/hal-03719592"},{"key":"29_CR13","unstructured":"The DGtal Project: DGtal (2010). https:\/\/dgtal.org"},{"issue":"6","key":"29_CR14","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/34.295909","volume":"16","author":"P Veelaert","year":"1994","unstructured":"Veelaert, P.: Digital planarity of rectangular surface segments. IEEE Trans. Pattern Anal. Mach. Intell. 16(6), 647\u2013652 (1994)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry and Mathematical Morphology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19897-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T17:17:47Z","timestamp":1666286267000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19897-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031198960","9783031198977"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19897-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry and Mathematical Morphology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Strasbourg","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgmm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgmm2022.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":"45","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":"33","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":"73% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}