{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:03:44Z","timestamp":1743037424412,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"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_35","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"444-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences"],"prefix":"10.1007","author":[{"given":"Haomin","family":"Song","sequence":"first","affiliation":[]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"issue":"6","key":"35_CR1","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/34.387505","volume":"17","author":"M Worring","year":"1995","unstructured":"Worring, M., Smeulders, A.W.M.: Digitized circular arcs: characterization and parameter estimation. IEEE Trans. Pattern Anal. Mach. Intell. 17(6), 587\u2013598 (1995)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"15","key":"35_CR2","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1016\/j.tcs.2010.10.028","volume":"412","author":"B Nagy","year":"2011","unstructured":"Nagy, B., Strand, R.: Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid. Theor. Comput. Sci. 412(15), 1364\u20131377 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1016\/j.patrec.2011.01.010","volume":"32","author":"J Mukherjee","year":"2011","unstructured":"Mukherjee, J.: On approximating Euclidean metrics by weighted t-cost distances in arbitrary dimension. Pattern Recogn. Lett. 32, 824\u2013831 (2011)","journal-title":"Pattern Recogn. Lett."},{"doi-asserted-by":"crossref","unstructured":"Debledrennesson, I., Tabbone, S., Wendling, L.: Fast polygonal approximation of digital curves. In: ICPR 2004, vol. 1, pp. 465\u2013468 (2004)","key":"35_CR4","DOI":"10.1109\/ICPR.2004.1334165"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11551188_28","volume-title":"Pattern Recognition and Data Mining","author":"P Bhowmick","year":"2005","unstructured":"Bhowmick, P., Bhattacharya, B.B.: Approximation of digital circles by regular polygons. In: Singh, S., Singh, M., Apte, C., Perner, P. (eds.) ICAPR 2005. LNCS, vol. 3686, pp. 257\u2013267. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11551188_28"},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0255(87)90019-3","volume":"42","author":"PP Das","year":"1987","unstructured":"Das, P.P., Chakrabarti, P.P., Chatterji, B.N.: Distance functions in digital geometry. Inf. Sci. 42(2), 113\u2013136 (1987)","journal-title":"Inf. Sci."},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0255(90)90008-X","volume":"50","author":"PP Das","year":"1990","unstructured":"Das, P.P., Chatterji, B.N.: Octagonal distances for digital pictures. Inf. Sci. 50(2), 123\u2013150 (1990)","journal-title":"Inf. Sci."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1007\/s10851-018-0805-1","volume":"60","author":"B Nagy","year":"2018","unstructured":"Nagy, B., Strand, R., Normand, N.: Distance functions based on multiple types of weighted steps combined with neighborhood sequences. J. Math. Imaging Vis. 60, 1209\u20131219 (2018)","journal-title":"J. Math. Imaging Vis."},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-59108-7_5","volume-title":"Combinatorial Image Analysis","author":"H Mir-Mohammad-Sadeghi","year":"2017","unstructured":"Mir-Mohammad-Sadeghi, H., Nagy, B.: On the chamfer polygons on the triangular grid. In: Brimkov, V.E., Barneva, R.P. (eds.) IWCIA 2017. LNCS, vol. 10256, pp. 53\u201365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59108-7_5"},{"issue":"3\u20134","key":"35_CR10","first-page":"309","volume":"17","author":"J Farkas","year":"2010","unstructured":"Farkas, J., Bajak, S., Nagy, B.: Approximating the Euclidean circle in the square grid using neighbourhood sequences. Pure Math. Appl. 17(3\u20134), 309\u2013322 (2010)","journal-title":"Pure Math. Appl."},{"key":"35_CR11","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-09039-9_14","volume-title":"Automata, Universality, Computation","author":"T Nickson","year":"2015","unstructured":"Nickson, T., Potapov, I.: Broadcasting automata and patterns on Z$$^2$$. In: Adamatzky, A. (ed.) Automata, Universality, Computation. ECC, vol. 12, pp. 297\u2013340. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-09039-9_14"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s11047-012-9330-0","volume":"11","author":"R Martin","year":"2012","unstructured":"Martin, R., Nickson, T., Potapov, I.: Geometric computations by broadcasting automata. Nat. Comput.: Int. J. 11, 623\u2013635 (2012)","journal-title":"Nat. Comput.: Int. J."},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1016\/j.tcs.2008.04.042","volume":"410","author":"A Efrima","year":"2009","unstructured":"Efrima, A., Peleg, D.: Distributed algorithms for partitioning a swarm of autonomous mobile robots. Theor. Comput. Sci. 410, 1355\u20131368 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"35_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.dam.2002.12.001","volume":"139","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital straightness-a review. Discrete Appl. Math. 139(1), 197\u2013230 (2004)","journal-title":"Discrete Appl. Math."},{"key":"35_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1844-9","volume-title":"Automata and Computability","author":"DC Kozen","year":"1997","unstructured":"Kozen, D.C.: Automata and Computability. Springer, New York (1997). https:\/\/doi.org\/10.1007\/978-1-4612-1844-9"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1142\/9789812836267_0008","volume-title":"The Birth of Numerical Analysis","author":"Donghui Chen","year":"2009","unstructured":"Chen, D., Plemmons, R.J.: Nonnegativity constraints in numerical analysis. In: Symposium on the Birth of Numerical Analysis, pp. 109\u2013139 (2009)"},{"key":"35_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971217","volume-title":"Solving Least Squares Problems","author":"CL Lawson","year":"1995","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. Prentice-Hall\/SIAM, Englewood Cliffs\/Philadelphia (1995)"},{"unstructured":"Shure, L.: Brief history of nonnegative least squares in MATLAB (2006). http:\/\/blogs.mathworks.com\/loren\/2006\/","key":"35_CR18"},{"issue":"5","key":"35_CR19","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1016\/j.cam.2010.08.038","volume":"235","author":"O Ferreira","year":"2011","unstructured":"Ferreira, O.: Local convergence of Newton\u2019s method under majorant condition. J. Comput. Appl. Math. 235(5), 1515\u20131522 (2011)","journal-title":"J. Comput. Appl. Math."},{"key":"35_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.entcs.2008.03.016","volume":"202","author":"P Batra","year":"2008","unstructured":"Batra, P.: Newton\u2019s method and the computational complexity of the fundamental theorem of algebra. Electron. Notes Theor. Comput. Sci. 202, 201\u2013218 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."}],"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_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:10:15Z","timestamp":1679188215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_35","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"}]}}