{"id":"https://openalex.org/W1838137418","doi":"https://doi.org/10.1007/bfb0054318","title":"Short and smooth polygonal paths","display_name":"Short and smooth polygonal paths","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1838137418","doi":"https://doi.org/10.1007/bfb0054318","mag":"1838137418"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0054318","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054318","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5085053856","display_name":"James Abello","orcid":"https://orcid.org/0000-0002-9614-0467"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James Abello","raw_affiliation_strings":["Communication Information Systems Research, AT&T Labs-Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Communication Information Systems Research, AT&T Labs-Research, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014773555","display_name":"Emden R. Gansner","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emden Gansner","raw_affiliation_strings":["Information Analysis and Display Research, AT&T Labs-Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Analysis and Display Research, AT&T Labs-Research, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.3033,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77287066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"151","last_page":"162"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9930999875068665,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6993951797485352},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6855906248092651},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.6323540210723877},{"id":"https://openalex.org/keywords/b\u00e9zier-curve","display_name":"B\u00e9zier curve","score":0.6267129182815552},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5982211828231812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5797708034515381},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5190240144729614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5063198804855347},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.48670580983161926},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.43990737199783325},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42401623725891113},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4138632118701935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36296725273132324},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3542504608631134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3466795086860657},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.28145113587379456},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.17413553595542908}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6993951797485352},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6855906248092651},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.6323540210723877},{"id":"https://openalex.org/C206423108","wikidata":"https://www.wikidata.org/wiki/Q214728","display_name":"B\u00e9zier curve","level":2,"score":0.6267129182815552},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5982211828231812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5797708034515381},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5190240144729614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5063198804855347},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.48670580983161926},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.43990737199783325},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42401623725891113},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4138632118701935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36296725273132324},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3542504608631134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3466795086860657},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.28145113587379456},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.17413553595542908},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bfb0054318","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054318","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.208.6973","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.6973","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mgvis.com/Papers/Geometry/Short_smooth_paths.pdf","raw_type":"text"},{"id":"pmh:oai:alma.01RUT_INST:11663568580004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/bookChapter/Short-and-smooth-polygonal-paths/991031654686704646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W74092408","https://openalex.org/W101508493","https://openalex.org/W1482503584","https://openalex.org/W1495870935","https://openalex.org/W1496844168","https://openalex.org/W1538289844","https://openalex.org/W1567654831","https://openalex.org/W1598860835","https://openalex.org/W1654807447","https://openalex.org/W1906607213","https://openalex.org/W1971998222","https://openalex.org/W2000366549","https://openalex.org/W2005314985","https://openalex.org/W2012242725","https://openalex.org/W2060406259","https://openalex.org/W2080414714","https://openalex.org/W2117435665","https://openalex.org/W2122063210","https://openalex.org/W2126536832","https://openalex.org/W2130772530","https://openalex.org/W2146766934","https://openalex.org/W2179892380","https://openalex.org/W2313274380","https://openalex.org/W3162468165","https://openalex.org/W4242811155"],"related_works":["https://openalex.org/W2167427782","https://openalex.org/W1579553590","https://openalex.org/W2997571660","https://openalex.org/W1669209377","https://openalex.org/W2031247977","https://openalex.org/W146351743","https://openalex.org/W1866589047","https://openalex.org/W2980991945","https://openalex.org/W1838137418","https://openalex.org/W1992049804"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}