{"id":"https://openalex.org/W1276464591","doi":null,"title":"Approximation of an open polygonal curve with a minimum number of circular arcs","display_name":"Approximation of an open polygonal curve with a minimum number of circular arcs","alternate_titles":[],"publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1276464591","mag":"1276464591"},"language":"en","primary_location":{"id":"mag:1276464591","doi":null,"is_oa":false,"landing_page_url":"http://eurocg.org/06/delaunay.tem.uoc.gr/~mkaravel/ewcg06/papers/06.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1276464591"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5008481867","display_name":"Robert L. Scot","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert L. Scot","raw_affiliation_strings":["Dartmouth College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dartmouth College","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005785552","display_name":"DrysdaleGunter Rote","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"DrysdaleGunter Rote","raw_affiliation_strings":["Free University of Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Free University of Berlin","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063628462","display_name":"Astrid Sturm","orcid":"https://orcid.org/0000-0002-7424-4484","observed_orcids":["https://orcid.org/0000-0002-7424-4484"]},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Astrid Sturm","raw_affiliation_strings":["Free University of Berlin"],"raw_orcid":"https://orcid.org/0000-0002-7424-4484","affiliations":[{"raw_affiliation_string":"Free University of Berlin","institution_ids":["https://openalex.org/I75951250"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6264,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.89536284,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9779999852180481,"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.9779999852180481,"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.017799999564886093,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0026000000070780516,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/circular-arcs","display_name":"circular arcs","score":0.8870000243186951},{"id":"https://openalex.org/keywords/shortest-path-algorithms","display_name":"shortest path algorithms","score":0.7279999852180481},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.8360000252723694},{"id":"https://openalex.org/keywords/greedy-approximation","display_name":"greedy approximation","score":0.4580000042915344},{"id":"https://openalex.org/keywords/computer-aided-manufacturing","display_name":"computer-aided manufacturing","score":0.7829999923706055}],"concepts":[{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.9133729338645935},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.6220903396606445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5763356685638428},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5482925176620483},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5257852077484131},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.5127769112586975},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47199419140815735},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4522285759449005},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4512913227081299},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42083340883255005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42016297578811646},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4156213402748108},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.33470603823661804},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3191601634025574},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.1923752725124359},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:1276464591","doi":null,"is_oa":false,"landing_page_url":"http://eurocg.org/06/delaunay.tem.uoc.gr/~mkaravel/ewcg06/papers/06.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.97.7197","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.7197","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eurocg.org/06/delaunay.tem.uoc.gr/~mkaravel/ewcg06/papers/06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1987304820","https://openalex.org/W2009822760","https://openalex.org/W2026998852","https://openalex.org/W2056925922","https://openalex.org/W2058693363","https://openalex.org/W2060072889","https://openalex.org/W2064582867"],"related_works":["https://openalex.org/W7097352113","https://openalex.org/W2009210603","https://openalex.org/W2287151670","https://openalex.org/W2041082738","https://openalex.org/W2116657533","https://openalex.org/W2120377417","https://openalex.org/W603421093","https://openalex.org/W2214692509","https://openalex.org/W119159048","https://openalex.org/W3091548255"],"abstract_inverted_index":{"An":[0],"algorithm":[1,73],"for":[2,39,88,113],"approximating":[3,40],"a":[4,10,41,79,107],"given":[5],"open":[6],"polygonal":[7,42,102,122],"curve":[8,43],"with":[9,30,44],"minimum":[11],"number":[12,116],"of":[13,24,46,67,82,100,109,117,119],"circular":[14,31],"arcs":[15,32,85],"is":[16,59],"introduced.":[17],"In":[18],"computer-aided":[19],"manufacturing":[20],"environments":[21],"the":[22,53,65,89,93,97,101,115,120],"paths":[23],"cutting":[25],"tools":[26],"are":[27],"usually":[28],"described":[29],"and":[33,86],"straight":[34],"line":[35],"segments.":[36],"Greedy":[37],"algorithms":[38],"curves":[45],"higher":[47],"order":[48],"can":[49,105],"be":[50],"found":[51],"in":[52],"literature.":[54],"Without":[55],"theoretical":[56],"bounds":[57],"it":[58],"difficult":[60],"to":[61,77,96],"prove":[62,106],"anything":[63],"about":[64],"quality":[66],"these":[68],"algorithms.":[69],"We":[70,104],"present":[71],"an":[72],"which":[74],"allows":[75],"us":[76],"build":[78],"directed":[80],"graph":[81],"all":[83],"possible":[84],"look":[87],"shortest":[90],"path":[91],"from":[92],"start":[94],"point":[95,99],"end":[98],"curve.":[103],"runtime":[108],"O(n":[110],"2":[111],"logn),":[112],"n":[114],"vertices":[118],"original":[121],"chain.":[123]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1276464591","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
