{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:23:43Z","timestamp":1742394223151},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287575"},{"type":"electronic","value":"9783540287582"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11551188_28","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:21:03Z","timestamp":1127830863000},"page":"257-267","source":"Crossref","is-referenced-by-count":6,"title":["Approximation of Digital Circles by Regular Polygons"],"prefix":"10.1007","author":[{"given":"Partha","family":"Bhowmick","sequence":"first","affiliation":[]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bhowmick, P., Bhattacharya, B.B.: Approximate Fingerprint Matching Using Kd-tree. In: ICPR 2004, vol.\u00a01, pp. 544\u2013547 (2004)","DOI":"10.1109\/ICPR.2004.1334194"},{"issue":"2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/359423.359432","volume":"20","author":"J.E. Bresenham","year":"1977","unstructured":"Bresenham, J.E.: A Linear Algorithm for Incremental Digital Display of Circular Arcs. Communications of the ACM\u00a020(2), 100\u2013106 (1977)","journal-title":"Communications of the ACM"},{"issue":"11","key":"28_CR3","first-page":"1505","volume":"27","author":"P.C. Chung","year":"1994","unstructured":"Chung, P.C., Tsai, C.T., Chen, E.L., Sun, Y.N.: Polygonal Approximation Using a Competitive Hopfield Neural Network. PR\u00a027(11), 1505\u20131512 (1994)","journal-title":"PR"},{"issue":"8","key":"28_CR4","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/34.784293","volume":"21","author":"T. Davis","year":"1999","unstructured":"Davis, T.: Fast Decomposition of Digital Curves into Polygons Using the Haar Transform. IEEE Trans. PAMI\u00a021(8), 786\u2013790 (1999)","journal-title":"IEEE Trans. PAMI"},{"issue":"7","key":"28_CR5","first-page":"1069","volume":"26","author":"A.K. Gupta","year":"1993","unstructured":"Gupta, A.K., Chaudhury, S., Parthasarathy, G.: A new approach for aggregating edge points into line segments. PR\u00a026(7), 1069\u20131086 (1993)","journal-title":"PR"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Hosur, P.I., Ma, K.K.: A Novel Scheme for Progressive Polygon Approximation of Shape Contours. In: IEEE 3rd Workshop Multimedia Sig. Proc., pp. 309\u2013314 (1999)","DOI":"10.1109\/MMSP.1999.793854"},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/0167-8655(94)90002-7","volume":"15","author":"J.C. Perez","year":"1994","unstructured":"Perez, J.C., Vidal, E.: Optimum polygonal approximation of digitized curves. PRL\u00a015, 743\u2013750 (1994)","journal-title":"PRL"},{"issue":"3","key":"28_CR8","first-page":"373","volume":"28","author":"A. Pikaz","year":"1995","unstructured":"Pikaz, A., Dinstein, I.: Optimal Polygonal Approximation of Digital Curves. PR\u00a028(3), 373\u2013379 (1995)","journal-title":"PR"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Debled-Rennesson, I., Tabbone, S., Wendling, L.: Fast Polygonal Approximation of Digital Curves. In: Proc. ICPR 2004, pp. 465\u2013468 (2004)","DOI":"10.1109\/ICPR.2004.1334165"},{"issue":"6","key":"28_CR10","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1109\/34.601253","volume":"19","author":"P.L. Rosin","year":"1997","unstructured":"Rosin, P.L.: Techniques for Assessing Polygonal Approximation of Curves. IEEE Trans. PAMI\u00a019(6), 659\u2013666 (1997)","journal-title":"IEEE Trans. PAMI"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Salotti, M.: Improvement of Perez and Vidal Algorithm for the Decomposition of Digitized Curves into Line Segments. In: Proc. ICPR 2000, pp. 878\u2013882 (2000)","DOI":"10.1109\/ICPR.2000.906214"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Sarfraz, M., Asim, M.R., Masood, A.: Piecewise Polygonal Approximation of Digital Curves. In: Proc. 8th Intl. Conf. Information Visualisation (IV 2004), pp. 991\u2013996 (2004)","DOI":"10.1109\/IV.2004.1320262"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, K., Laurent, P.: Efficient Polygon Approximations for Shape Signatures. In: Proc. ICIP 1999, pp. 811\u2013814 (1999)","DOI":"10.1109\/ICIP.1999.823009"},{"issue":"6","key":"28_CR14","doi-asserted-by":"crossref","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. PAMI\u00a017(6), 587\u2013598 (1995)","journal-title":"IEEE Trans. PAMI"},{"key":"28_CR15","first-page":"1061","volume":"13","author":"P.Y. Yin","year":"1999","unstructured":"Yin, P.Y.: Genetic Algorithms for Polygonal Approximation of Digital Curves. IJPRAI\u00a013, 1061\u20131082 (1999)","journal-title":"IJPRAI"},{"issue":"2","key":"28_CR16","first-page":"243","volume":"14","author":"P.Y. Yin","year":"2000","unstructured":"Yin, P.Y.: A Tabu Search Approach to Polygonal Approximation of Digital Curves. IJPRAI\u00a014(2), 243\u2013255 (2000)","journal-title":"IJPRAI"},{"key":"28_CR17","first-page":"1783","volume":"36","author":"P.Y. Yin","year":"2003","unstructured":"Yin, P.Y.: Ant Colony Search Algorithms for Optimal Polygonal Approximation of Plane Curves. PR\u00a036, 1783\u20131797 (2003)","journal-title":"PR"},{"issue":"2","key":"28_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.jvcir.2003.12.001","volume":"15","author":"P.Y. Yin","year":"2004","unstructured":"Yin, P.Y.: A discrete particle swarm algorithm for optimal polygonal approximation of digital curves. J. Visual Comm. Image Reprsn.\u00a015(2), 241\u2013260 (2004)","journal-title":"J. Visual Comm. Image Reprsn."},{"issue":"1","key":"28_CR19","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1049\/ip-vis:19970985","volume":"144","author":"Y. Zhu","year":"1997","unstructured":"Zhu, Y., Seneviratne, L.D.: Optimal Polygonal Approximation of Digitised Curves. IEE Proc. Vis. Image Signal Process.\u00a0144(1), 8\u201314 (1997)","journal-title":"IEE Proc. Vis. Image Signal Process."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11551188_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:00:10Z","timestamp":1619506810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11551188_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287575","9783540287582"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11551188_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}