{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T22:27:55Z","timestamp":1747261675012,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_32","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"409-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Algorithms to Test Digital Convexity"],"prefix":"10.1007","author":[{"given":"Lo\u00efc","family":"Crombez","sequence":"first","affiliation":[]},{"given":"Guilherme D.","family":"da Fonseca","sequence":"additional","affiliation":[]},{"given":"Yan","family":"G\u00e9rard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"key":"32_CR1","volume-title":"Digital Geometry: Geometric Methods for Digital Picture Analysis","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Elsevier, Amsterdam (2004)"},{"issue":"2","key":"32_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/34.16713","volume":"11","author":"C Ronse","year":"1989","unstructured":"Ronse, C.: A bibliography on digital and computational convexity (1961\u20131988). IEEE Trans. Pattern Anal. Mach. Intell. 11(2), 181\u2013190 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"32_CR3","volume-title":"Geometrie der Zahlen","author":"H Minkowski","year":"1910","unstructured":"Minkowski, H.: Geometrie der Zahlen, vol. 2. B.G. Teubner, Leipzig (1910)"},{"issue":"2","key":"32_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/TPAMI.1982.4767221","volume":"4","author":"CE Kim","year":"1982","unstructured":"Kim, C.E., Rosenfeld, A.: Digital straight lines and convexity of digital regions. IEEE Trans. Pattern Anal. Mach. Intell. 4(2), 149\u2013153 (1982)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"32_CR5","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1109\/TPAMI.1982.4767314","volume":"4","author":"CE Kim","year":"1982","unstructured":"Kim, C.E., Rosenfeld, A.: Convex digital solids. IEEE Trans. Pattern Anal. Mach. Intell. 4(6), 612\u2013618 (1982)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/S0734-189X(83)80047-4","volume":"21","author":"J-M Chassery","year":"1983","unstructured":"Chassery, J.-M.: Discrete convexity: definition, parametrization, and compatibility with continuous convexity. Comput. Vis. Graph. Image Process. 21(3), 326\u2013344 (1983)","journal-title":"Comput. Vis. Graph. Image Process."},{"issue":"2","key":"32_CR7","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1006\/cviu.1996.0022","volume":"63","author":"K Kishimoto","year":"1996","unstructured":"Kishimoto, K.: Characterizing digital convexity and straightness in terms of length and total absolute curvature. Comput. Vis. Image Underst. 63(2), 326\u2013333 (1996)","journal-title":"Comput. Vis. Image Underst."},{"issue":"12","key":"32_CR8","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1016\/S0031-3203(98)00065-X","volume":"31","author":"BB Chaudhuri","year":"1998","unstructured":"Chaudhuri, B.B., Rosenfeld, A.: On the computation of the digital convex hull and circular hull of a digital region. Pattern Recognit. 31(12), 2007\u20132016 (1998)","journal-title":"Pattern Recognit."},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(94)00293-2","volume":"155","author":"E Barcucci","year":"1996","unstructured":"Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theoret. Comput. Sci. 155(2), 321\u2013347 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"32_CR10","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1142\/S0218001401001350","volume":"15","author":"A Daurat","year":"2001","unstructured":"Daurat, A.: Salient points of Q-convex sets. Int. J. Pattern Recognit. Artif. Intell. 15(7), 1023\u20131030 (2001)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"1","key":"32_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(02)00227-5","volume":"125","author":"I Debled-Rennesson","year":"2003","unstructured":"Debled-Rennesson, I., R\u00e9my, J.-L., Rouyer-Degli, J.: Detection of the discrete convexity of polyominoes. Discrete Appl. Math. 125(1), 115\u2013133 (2003). 9th International Conference on Discrete Geometry for Computer Im agery (DGCI 2000)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"32_CR12","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1016\/j.patcog.2008.11.010","volume":"42","author":"X Proven\u00e7al","year":"2009","unstructured":"Proven\u00e7al, X., Reutenauer, C., Brlek, S., Lachaud, J.-O.: Lyndon + Christoffel = digitally convex. Pattern Recognit. 42(10), 2239\u20132246 (2009). Selected papers from the 14th IAPR International Conference on Discrete Geometry for Computer Imagery (2008)","journal-title":"Pattern Recognit."},{"key":"32_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Santa Clara (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"issue":"4","key":"32_CR14","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1145\/322276.322289","volume":"28","author":"AC-C Yao","year":"1981","unstructured":"Yao, A.C.-C.: A lower bound to finding convex hulls. J. ACM 28(4), 780\u2013787 (1981)","journal-title":"J. ACM"},{"issue":"2","key":"32_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"FP Preparata","year":"1977","unstructured":"Preparata, F.P., Hong, S.J.: Convex hulls of finite sets of points in two and three dimensions. Commun. ACM 20(2), 87\u201393 (1977)","journal-title":"Commun. ACM"},{"issue":"1","key":"32_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0215021","volume":"15","author":"D Kirkpatrick","year":"1986","unstructured":"Kirkpatrick, D., Seidel, R.: The ultimate planar convex hull algorithm? SIAM J. Comput. 15(1), 287\u2013299 (1986)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"32_CR17","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF02712873","volume":"16","author":"TM Chan","year":"1996","unstructured":"Chan, T.M.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom. 16(4), 361\u2013368 (1996)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"32_CR18","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF02573985","volume":"10","author":"B Chazelle","year":"1993","unstructured":"Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom. 10(4), 377\u2013409 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR19","unstructured":"Pick, G.: Geometrisches zur zahlenlehre. Sitzungsberichte des Deutschen Naturwissenschaftlich-Medicinischen Vereines f\u00fcr B\u00f6hmen \u201cLotos\u201d in Prag, vol. 47\u201348, pp. 1899\u20131900 (1899)"},{"key":"32_CR20","unstructured":"Ehrhart, E.: Sur les poly\u00e8dres rationnels homoth\u00e9tiques \u00e0 n dimensions. Technical report, acad\u00e9mie des sciences, Paris (1962)"},{"issue":"4","key":"32_CR21","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"AI Barvinok","year":"1994","unstructured":"Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19(4), 769\u2013779 (1994)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"32_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02574364","volume":"12","author":"AI Barvinok","year":"1994","unstructured":"Barvinok, A.I.: Computing the Ehrhart polynomial of a convex lattice polytope. Discrete Comput. Geom. 12(1), 35\u201348 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"CB Barber","year":"1996","unstructured":"Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22, 469\u2013483 (1996)","journal-title":"ACM Trans. Math. Softw."},{"key":"32_CR24","unstructured":"Greenfield, J.S.: A proof for a quickhull algorithm. Technical report, Syracuse University (1990)"},{"issue":"4","key":"32_CR25","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lovasz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"32_CR26","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1090\/S0002-9947-1963-0143105-7","volume":"106","author":"GE Andrews","year":"1963","unstructured":"Andrews, G.E.: A lower bound for the volumes of strictly convex bodies with many boundary points. Trans. Am. Math. Soc. 106, 270\u2013279 (1963)","journal-title":"Trans. Am. Math. Soc."},{"key":"32_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/conm\/453\/08796","volume":"453","author":"I B\u00e1r\u00e1ny","year":"2008","unstructured":"B\u00e1r\u00e1ny, I.: Extremal problems for convex lattice polytopes: a survey. Contemp. Math. 453, 87\u2013103 (2008)","journal-title":"Contemp. Math."}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:09:57Z","timestamp":1679188197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_32","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"}]}}