{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T10:01:53Z","timestamp":1751536913131},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2005,6,10]],"date-time":"2005-06-10T00:00:00Z","timestamp":1118361600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s10044-005-0246-5","type":"journal-article","created":{"date-parts":[[2005,6,9]],"date-time":"2005-06-09T07:49:00Z","timestamp":1118303340000},"page":"84-94","source":"Crossref","is-referenced-by-count":20,"title":["Canonical representations of discrete curves"],"prefix":"10.1007","volume":"8","author":[{"given":"Fabien","family":"Feschet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"246_CR1","doi-asserted-by":"crossref","unstructured":"Andr\u00e8s E (1996) The quasi-shear rotation. In: 6th DGCI, volume 1176 of Lecture Notes in Computer Science, pp 307\u2013314","DOI":"10.1007\/3-540-62005-2_26"},{"issue":"3","key":"246_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/34.75509","volume":"13","author":"E Arkin","year":"1991","unstructured":"Arkin E, Chew P, Huttenlocher D, Kedem K, Mitchel J (1991) An efficiently computable metric for comparing polygonal shapes. IEEE Trans Pattern Anal Appl 13(3):209\u2013215","journal-title":"IEEE Trans Pattern Anal Appl"},{"key":"246_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0031-3203(98)00132-0","volume":"32","author":"E Bribiesca","year":"1999","unstructured":"Bribiesca E (1999) A new chain code. Pattern Recognit 32:235\u2013251","journal-title":"Pattern Recognit"},{"issue":"1\u20133","key":"246_CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/S0167-8655(02)00267-2","volume":"24","author":"TM Cronin","year":"2003","unstructured":"Cronin TM (2003) Visualizing concave and convex partitioning of 2d contours. Pattern Recognit Lett 24(1\u20133):429\u2013443","journal-title":"Pattern Recognit Lett"},{"key":"246_CR5","unstructured":"Van de Merckt T (1993) Decision trees in numerical attribute space. In: 13th international conference on artificial intelligence, Morgan Kaufmann, pp 1016\u20131021"},{"key":"246_CR6","unstructured":"Debled I, Reveill\u00e8s JP (1994) A linear algorithm for segmentation of digital curves.In: 3rd IWPIA"},{"key":"246_CR7","doi-asserted-by":"crossref","unstructured":"Debled-Rennesson I, Remy JL, Rouyer J (2003) Segmentation of discrete curves into fuzzy segments. In: 9th international workshop on combinatorial image analysis, vol 12 of Electronic Notes in Discrete Mathathematics, Palermo, Italy","DOI":"10.1016\/S1571-0653(04)00500-1"},{"key":"246_CR8","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/TPAMI.1984.4767550","volume":"6","author":"L Dorst","year":"1984","unstructured":"Dorst L, Smeulders AWM (1984) Discrete representation of straight lines. IEEE PAMI 6:450\u2013463","journal-title":"IEEE PAMI"},{"key":"246_CR9","unstructured":"Fayyad UM, Irani K (1993) Multiple-interval discretization of continuous-valued attributes in induction graphs. In: 13th international conference on artificial intelligence, Morgan Kaufmann, pp 1022\u20131027"},{"key":"246_CR10","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","volume":"EC-10","author":"H Freeman","year":"1961","unstructured":"Freeman H (1961) On the encoding of arbitrary geometric configurations. IEEE Trans Elec Comput EC-10:260\u2013268","journal-title":"IEEE Trans Elec Comput"},{"key":"246_CR11","volume-title":"An introduction to the theory of numbers","author":"GH Hardy","year":"1960","unstructured":"Hardy GH, Wright EM (1960) An introduction to the theory of numbers, 4th edn. Oxford University Press, New York","edition":"4"},{"key":"246_CR12","doi-asserted-by":"crossref","unstructured":"Huxley MN (1996) Area, lattice points and exponential sums. Number 13 in London Mathematical Society Monographs. Oxford Science Publications, Oxford","DOI":"10.1093\/oso\/9780198534662.001.0001"},{"key":"246_CR13","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1007\/BF01216795","volume":"24","author":"v Jarnik","year":"1925","unstructured":"Jarnik v (1925) \u00dcber die Gitterpunkte auf konvexen Kurven. Math Zeitschrift 24:500\u2013518","journal-title":"Math Zeitschrift"},{"key":"246_CR14","unstructured":"Kerber R (1992) Discretization of numeric attributes. In: Kerber R (ed) Tenth National conference on artificial intelligence. MIT Press, Cambridge, pp 123\u2013128"},{"key":"246_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1008273227913","volume":"8","author":"LJ Latecki","year":"1998","unstructured":"Latecki LJ, Conrad C, Gross A (1998) Preserving topology by a digitization process. J Math Imaging Vis 8:131\u2013159","journal-title":"J Math Imaging Vis"},{"issue":"3","key":"246_CR16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/cviu.1998.0738","volume":"73","author":"LJ Latecki","year":"1999","unstructured":"Latecki LJ, Lak\u00e4mper R (1999) Convexity rule for shape decomposition based on discrete contour evolution. Comput Vis IU 73(3):441\u2013454","journal-title":"Comput Vis IU"},{"issue":"10","key":"246_CR17","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1109\/34.879802","volume":"22","author":"LJ Latecki","year":"2000","unstructured":"Latecki LJ, Lak\u00e4mper R (2000) Shape similarity measure based on correspondance of visual parts. IEEE PAMI 22(10):1185\u20131190","journal-title":"IEEE PAMI"},{"key":"246_CR18","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0031-3203(97)00071-X","volume":"31","author":"LJ Latecki","year":"1998","unstructured":"Latecki LJ, Rosenfeld A (1998) Supportedness and tameness: differentialles geometry of plane curves. Pattern Recognit 31:607\u2013622","journal-title":"Pattern Recognit"},{"issue":"1","key":"246_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0031-3203(01)00040-1","volume":"35","author":"F Mokhtarian","year":"2002","unstructured":"Mokhtarian F, Abbasi S (2002) Shape similarity retrieval under affine transforms. Pattern Recognit 35(1):31\u201341","journal-title":"Pattern Recognit"},{"key":"246_CR20","unstructured":"Reveill\u00e8s JP (1991) G\u00e9om\u00e9trie discr\u00e8te, calcul en nombres entiers et algorithmique. Th\u00e8se d\u2019etat, Universit\u00e9 Louis Pasteur, Strasbourg"},{"key":"246_CR21","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1109\/T-C.1974.223845","volume":"23","author":"A Rosenfeld","year":"1974","unstructured":"Rosenfeld A (1974) Digital straight line segments. IEEE Trans Comput 23:1264\u20131269","journal-title":"IEEE Trans Comput"},{"issue":"1\u20133","key":"246_CR22","first-page":"197","volume":"139","author":"A Rosenfled","year":"2004","unstructured":"Rosenfled A, Klette R (2004) Digital Straightness\u2014a review. Discrete Appl Math 139(1\u20133):197\u2013230","journal-title":"Discrete Appl Math"},{"issue":"2","key":"246_CR23","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/3468.833102","volume":"30","author":"E Rosin","year":"2000","unstructured":"Rosin E (2000) Shape partitioning by convexity. IEEE Trans Syst Man Cybern A 30(2):202\u2013210","journal-title":"IEEE Trans Syst Man Cybern A"},{"key":"246_CR24","volume-title":"Combinatorial optimization\u2014polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization\u2014polyhedra and efficiency. Springer, Berlin Heidelberg New York"},{"key":"246_CR25","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1090\/conm\/119\/1113908","volume":"119","author":"AWM Smeulders","year":"1991","unstructured":"Smeulders AWM, Dorst L (1991) Decomposition of discrete curves into piecewise straight segments in linear time. Contemp Math 119:169\u2013195","journal-title":"Contemp Math"},{"key":"246_CR26","doi-asserted-by":"crossref","unstructured":"Vialard A (1996) Geometrical parameters extraction from discrete paths. In: 6th international workshop DGCI, volume 1176 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, pp 24\u201335","DOI":"10.1007\/3-540-62005-2_3"},{"key":"246_CR27","unstructured":"Zighed DA et al (1999) Encyclopedia of computer science and technology, vol 40, chapter discretization methods in supervised learning. Marcel Dekker, pp 35\u201350"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-005-0246-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-005-0246-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-005-0246-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T13:16:22Z","timestamp":1706274982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-005-0246-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,10]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["246"],"URL":"https:\/\/doi.org\/10.1007\/s10044-005-0246-5","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6,10]]}}}