{"id":"https://openalex.org/W2158647255","doi":"https://doi.org/10.1109/jra.1987.1087092","title":"Minimizing turns for discrete movement in the interior of a polygon","display_name":"Minimizing turns for discrete movement in the interior of a polygon","publication_year":1987,"publication_date":"1987-06-01","ids":{"openalex":"https://openalex.org/W2158647255","doi":"https://doi.org/10.1109/jra.1987.1087092","mag":"2158647255"},"language":"en","primary_location":{"id":"doi:10.1109/jra.1987.1087092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jra.1987.1087092","pdf_url":null,"source":{"id":"https://openalex.org/S105799543","display_name":"IEEE Journal on Robotics and Automation","issn_l":"0882-4967","issn":["0882-4967","2374-8710"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Robotics and Automation","raw_type":"journal-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/A5007364145","display_name":"John H. Reif","orcid":"https://orcid.org/0000-0002-9096-2056"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Reif","raw_affiliation_strings":["Aiken Computation Laboratory, Hiroshima University, Cambridge, MA, USA","Duke University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aiken Computation Laboratory, Hiroshima University, Cambridge, MA, USA","institution_ids":[]},{"raw_affiliation_string":"Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036953367","display_name":"James A. Storer","orcid":null},"institutions":[{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Storer","raw_affiliation_strings":["Computer Science Department, Brandeis University, Waltham, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brandeis University, Waltham, MA, USA","institution_ids":["https://openalex.org/I6902469"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2349,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.80805687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":"3","first_page":"182","last_page":"193"},"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.9998999834060669,"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.9998999834060669,"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/T12698","display_name":"3D Modeling in Geospatial Applications","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.8612402081489563},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6975867748260498},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6190849542617798},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.564900279045105},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5354644656181335},{"id":"https://openalex.org/keywords/movement","display_name":"Movement (music)","score":0.5303459763526917},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5298808813095093},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5053682923316956},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.485739529132843},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47797319293022156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4695242941379547},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.46394845843315125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4373970627784729},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4250182807445526},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4209882318973541},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4142218232154846},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4137510061264038},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.4124346971511841},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2918126583099365},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13773414492607117},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08442947268486023}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.8612402081489563},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6975867748260498},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6190849542617798},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.564900279045105},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5354644656181335},{"id":"https://openalex.org/C2780226923","wikidata":"https://www.wikidata.org/wiki/Q929848","display_name":"Movement (music)","level":2,"score":0.5303459763526917},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5298808813095093},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5053682923316956},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.485739529132843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47797319293022156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4695242941379547},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.46394845843315125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4373970627784729},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4250182807445526},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4209882318973541},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4142218232154846},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4137510061264038},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4124346971511841},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2918126583099365},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13773414492607117},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08442947268486023},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"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/jra.1987.1087092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jra.1987.1087092","pdf_url":null,"source":{"id":"https://openalex.org/S105799543","display_name":"IEEE Journal on Robotics and Automation","issn_l":"0882-4967","issn":["0882-4967","2374-8710"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Robotics and Automation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W24696750","https://openalex.org/W1584532470","https://openalex.org/W1825136300","https://openalex.org/W1983487792","https://openalex.org/W1984627834","https://openalex.org/W1993217815","https://openalex.org/W1999006915","https://openalex.org/W2001513095","https://openalex.org/W2002025203","https://openalex.org/W2004389974","https://openalex.org/W2011297770","https://openalex.org/W2019058745","https://openalex.org/W2022754388","https://openalex.org/W2031888296","https://openalex.org/W2067994867","https://openalex.org/W2068376033","https://openalex.org/W2069750902","https://openalex.org/W2108567935","https://openalex.org/W2109868275","https://openalex.org/W2114098276","https://openalex.org/W2126876121","https://openalex.org/W2170828467","https://openalex.org/W2294603245","https://openalex.org/W2577446513","https://openalex.org/W4243122809","https://openalex.org/W4248167106","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W70775629","https://openalex.org/W2085681674","https://openalex.org/W2997571660","https://openalex.org/W2980991945","https://openalex.org/W4288091041","https://openalex.org/W2165083794","https://openalex.org/W3036994771","https://openalex.org/W1579553590","https://openalex.org/W2162254990","https://openalex.org/W2004395316"],"abstract_inverted_index":{"The":[0],"problem":[1,48],"of":[2,36,93,121,124],"movement":[3,52,120],"in":[4,40,88],"two-dimensional":[5],"Euclidean":[6],"space":[7],"that":[8,75,97,112],"is":[9,17,20,31,68,96,105,111,114],"bounded":[10],"by":[11],"a":[12,41,54,58,72,81,122],"(not":[13],"necessarily":[14],"convex)":[15],"polygon":[16],"considered.":[18],"Movement":[19],"restricted":[21],"to":[22,32,84,107,117],"be":[23],"along":[24],"straight":[25],"line":[26],"segments,":[27],"and":[28,57,104],"the":[29,34,51,77,89,119],"objective":[30],"minimize":[33],"number":[35],"bends":[37],"or":[38],"\"turns\"":[39],"path.":[42],"Most":[43],"past":[44],"work":[45],"on":[46],"this":[47,94],"has":[49],"addressed":[50],"between":[53],"source":[55,82],"point":[56,83],"destination":[59],"point.":[60],"An":[61,91],"O(n":[62],"\\ast":[63],"\\log":[64],"(n))":[65],"time":[66],"algorithm":[67,95],"presented":[69],"for":[70],"computing":[71],"data":[73,102],"structure":[74],"represents":[76],"minimal-turn":[78],"paths":[79],"from":[80],"all":[85],"other":[86],"points":[87],"polygon.":[90],"advantage":[92,110],"it":[98,113],"uses":[99],"relatively":[100],"simple":[101],"structures":[103],"practical":[106],"implement.":[108],"Another":[109],"easily":[115],"generalized":[116],"accommodate":[118],"disk":[123],"radius":[125],"r":[126],">":[127],"0.":[128]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}