{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:54:13Z","timestamp":1743126853328,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_30","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"380-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Digital Plane Recognition with Fewer Probes"],"prefix":"10.1007","author":[{"given":"Tristan","family":"Roussillon","sequence":"first","affiliation":[]},{"given":"Jacques-Olivier","family":"Lachaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"issue":"1\u20133","key":"30_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S1524-0703(03)00008-0","volume":"65","author":"L Buzer","year":"2003","unstructured":"Buzer, L.: A linear incremental algorithm for naive and standard digital lines and planes recognition. Graph. Models 65(1\u20133), 61\u201376 (2003)","journal-title":"Graph. Models"},{"key":"30_CR2","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":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-21073-0_14","volume-title":"Combinatorial Image Analysis","author":"E Charrier","year":"2011","unstructured":"Charrier, E., Lachaud, J.-O.: Maximal planes and multiscale tangential cover of 3D digital objects. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 132\u2013143. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21073-0_14"},{"key":"30_CR4","unstructured":"Debled-Rennesson, I., Reveill\u00e8s, J.: An incremental algorithm for digital plane recognition. In: Discrete Geometry for Computer Imagery, pp. 194\u2013205 (1994)"},{"issue":"10","key":"30_CR5","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1016\/j.patcog.2008.11.003","volume":"42","author":"T Fernique","year":"2009","unstructured":"Fernique, T.: Generation and recognition of digital planes using multi-dimensional continued fractions. Pattern Recogn. 42(10), 2229\u20132238 (2009)","journal-title":"Pattern Recogn."},{"issue":"1","key":"30_CR6","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. Discrete Appl. Math. 151(1), 169\u2013183 (2005)","journal-title":"Discrete Appl. Math."},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-45129-3_32","volume-title":"Visual Form 2001","author":"R Klette","year":"2001","unstructured":"Klette, R., Sun, H.J.: Digital planar segment based polyhedrization for surface area estimation. In: Arcelli, C., Cordella, L.P., di Baja, G.S. (eds.) IWVF 2001. LNCS, vol. 2059, pp. 356\u2013366. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45129-3_32"},{"key":"30_CR8","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":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-32360-2_15","volume-title":"Discrete Geometry for Computer Imagery","author":"J-O Lachaud","year":"2016","unstructured":"Lachaud, J.-O., Proven\u00e7al, X., Roussillon, T.: Computation of the normal vector to a digital plane by sampling significant points. In: Normand, N., Gu\u00e9don, J., Autrusseau, F. (eds.) DGCI 2016. LNCS, vol. 9647, pp. 194\u2013205. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32360-2_15"},{"issue":"1","key":"30_CR10","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":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-45986-3_36","volume-title":"Discrete Geometry for Computer Imagery","author":"MM Mesmoudi","year":"2002","unstructured":"Mesmoudi, M.M.: A simplified recognition algorithm of digital planes pieces. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol. 2301, pp. 404\u2013416. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45986-3_36"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1041-6","volume":"38","author":"I Sivignon","year":"2004","unstructured":"Sivignon, I., Dupont, F., Chassery, J.M.: Decomposition of a three-dimensional discrete object surface into discrete plane pieces. Algorithmica 38(1), 25\u201343 (2004)","journal-title":"Algorithmica"},{"issue":"6","key":"30_CR13","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."},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-34732-0_3","volume-title":"Combinatorial Image Analaysis","author":"P Veelaert","year":"2012","unstructured":"Veelaert, P.: Fast combinatorial algorithm for tightly separating hyperplanes. In: Barneva, R.P., Brimkov, V.E., Aggarwal, J.K. (eds.) IWCIA 2012. LNCS, vol. 7655, pp. 31\u201344. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34732-0_3"}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:09:47Z","timestamp":1679188187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_30","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"}]}}