{"id":"https://openalex.org/W2116657533","doi":"https://doi.org/10.1109/icpr.2002.1047464","title":"A fast near-optimal algorithm for approximation of polygonal curves","display_name":"A fast near-optimal algorithm for approximation of polygonal curves","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2116657533","doi":"https://doi.org/10.1109/icpr.2002.1047464","mag":"2116657533"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2002.1047464","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2002.1047464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Object recognition supported by user interaction for service robots","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000026575","display_name":"Alexander Kolesnikov","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. Kolesnikov","raw_affiliation_strings":["Department of Computer Science, University of Joensuu, Joensuu, Finland","Dept. of Comput. Sci., Joensuu Univ., Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Joensuu, Joensuu, Finland","institution_ids":[]},{"raw_affiliation_string":"Dept. of Comput. Sci., Joensuu Univ., Finland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037846871","display_name":"Pasi Fr\u00e4nti","orcid":"https://orcid.org/0000-0002-9554-2827"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. Franti","raw_affiliation_strings":["Department of Computer Science, University of Joensuu, Joensuu, Finland","Dept. of Comput. Sci., Joensuu Univ., Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Joensuu, Joensuu, Finland","institution_ids":[]},{"raw_affiliation_string":"Dept. of Comput. Sci., Joensuu Univ., Finland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000026575"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3703,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.83804022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"4","issue":null,"first_page":"335","last_page":"338"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6819226741790771},{"id":"https://openalex.org/keywords/polygonal-chain","display_name":"Polygonal chain","score":0.6758427619934082},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.587404191493988},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5476906299591064},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5121417045593262},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5108751654624939},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4796219766139984},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.44278380274772644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3406434655189514},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08327972888946533}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6819226741790771},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.6758427619934082},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.587404191493988},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5476906299591064},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5121417045593262},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5108751654624939},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4796219766139984},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.44278380274772644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3406434655189514},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08327972888946533},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpr.2002.1047464","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2002.1047464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Object recognition supported by user interaction for service robots","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1981934656","https://openalex.org/W1983579396","https://openalex.org/W2006609100","https://openalex.org/W2009906570","https://openalex.org/W2123630097","https://openalex.org/W2155239911"],"related_works":["https://openalex.org/W1585007175","https://openalex.org/W2382521049","https://openalex.org/W2144385241","https://openalex.org/W4253593777","https://openalex.org/W2951497643","https://openalex.org/W3101625811","https://openalex.org/W2165950148","https://openalex.org/W4300101996","https://openalex.org/W2141882063","https://openalex.org/W1643233150"],"abstract_inverted_index":{"Approximation":[0],"of":[1,23,69],"polygonal":[2],"curves":[3],"can":[4,58],"be":[5,59],"solved":[6],"by":[7,61],"dynamic":[8,33],"programming.":[9],"These":[10],"methods":[11],"provide":[12],"an":[13,63],"optimal":[14],"solution":[15],"but":[16],"are":[17],"slow":[18],"for":[19],"a":[20,27,36],"large":[21],"number":[22,68],"vertices.":[24],"We":[25],"propose":[26],"new":[28],"optimization":[29],"approach":[30],"based":[31],"on":[32],"programming":[34],"with":[35],"reduced-search":[37],"in":[38,71],"the":[39,72],"state":[40],"space.":[41],"The":[42,53],"proposed":[43],"algorithm":[44],"is":[45],"simple,":[46],"fast,":[47],"and":[48,55,67],"has":[49],"low":[50],"space":[51],"complexity.":[52],"time":[54],"quality":[56],"trade-off":[57],"controlled":[60],"selecting":[62],"appropriate":[64],"corridor":[65],"width":[66],"iterations":[70],"algorithm.":[73]},"counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}