{"id":"https://openalex.org/W7097362136","doi":null,"title":"J.S.B.: Touring a sequence of polygons","display_name":"J.S.B.: Touring a sequence of polygons","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7097362136"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.645.9256","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.645.9256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ams.sunysb.edu/~jsbm/papers/stoc03.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7097362136"],"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/A5012490161","display_name":"Moshe Dror","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Moshe Dror","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037980737","display_name":"Alon Efrat","orcid":"https://orcid.org/0000-0001-9834-4132","observed_orcids":["https://orcid.org/0000-0001-9834-4132","https://orcid.org/0000-0001-5595-2138"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Alon Efrat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044299176","display_name":"Anna Lubiw","orcid":"https://orcid.org/0000-0002-2338-361X","observed_orcids":["https://orcid.org/0000-0002-2338-361X"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Anna Lubiw","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015247956","display_name":"Joseph S. B. Mitchell","orcid":"https://orcid.org/0000-0002-0152-2279","observed_orcids":["https://orcid.org/0000-0002-0152-2279"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Joseph S. B. Mitchell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965999722480774,"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.9965999722480774,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.002899999963119626,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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-queries","display_name":"shortest path queries","score":0.6729999780654907},{"id":"https://openalex.org/keywords/convex-polygons","display_name":"convex polygons","score":0.6510000228881836},{"id":"https://openalex.org/keywords/non-convex-polygons","display_name":"non-convex polygons","score":0.8360000252723694},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8330000042915344},{"id":"https://openalex.org/keywords/simply-connected-regions","display_name":"simply connected regions","score":0.6669999957084656},{"id":"https://openalex.org/keywords/polygon-intersection","display_name":"polygon intersection","score":0.41999998688697815},{"id":"https://openalex.org/keywords/computational-geometry-algorithms","display_name":"computational geometry algorithms","score":0.7639999985694885}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7570000290870667},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6266999840736389},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6205999851226807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5963000059127808},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5874000191688538},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.583899974822998},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5455999970436096},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5390999913215637},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5210000276565552},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4968999922275543},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.4683000147342682},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4453999996185303},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.3174999952316284},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31540000438690186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3068999946117401},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.3043000102043152},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28870001435279846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28119999170303345},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.2538999915122986}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.645.9256","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.645.9256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ams.sunysb.edu/~jsbm/papers/stoc03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4244080821","https://openalex.org/W2601639295","https://openalex.org/W2800359404","https://openalex.org/W2798354335","https://openalex.org/W2276707988","https://openalex.org/W2042423125","https://openalex.org/W2057025928","https://openalex.org/W2120364970","https://openalex.org/W133420565","https://openalex.org/W2064191526"],"abstract_inverted_index":{"Given":[0],"a":[1,9,14,20,71,94,117,155,178,218],"sequence":[2],"of":[3,31,60,158,187,194,233],"k":[4],"polygons":[5,40,77,88,142,145,152],"in":[6,28,50,73,124,162,177,190,208,222],"the":[7,32,39,57,63,75,82,98,133,166,169,173,191,195,199,205,213,229],"plane,":[8],"start":[10],"point":[11,119,220],"s,":[12,26],"and":[13,34,43,81,109,172,198,212,235],"target":[15],"point,":[16],"t,":[17],"we":[18,45],"seek":[19],"shortest":[21,111],"path":[22,112,135],"that":[23,139],"starts":[24],"at":[25,36],"visits":[27],"order":[29,186],"each":[30],"polygons,":[33],"ends":[35],"t.":[37],"If":[38],"are":[41,78,107],"disjoint":[42],"convex,":[44],"give":[46,184],"an":[47,185],"algorithm":[48,99],"running":[49,192],"time":[51,125,211,223,231],"O(kn":[52],"log(n/k)),":[53],"where":[54,130],"n":[55],"is":[56,89,132,148,154],"total":[58],"num-ber":[59],"vertices":[61],"specifying":[62],"polygons.":[64],"We":[65,137,203],"also":[66],"extend":[67],"our":[68],"results":[69,183],"to":[70,91,116,121],"case":[72],"which":[74],"convex":[76],"arbitrarily":[79],"intersecting":[80],"subpath":[83],"between":[84],"any":[85],"two":[86],"consecutive":[87],"constrained":[90],"lie":[92],"within":[93],"simply":[95],"connected":[96],"re-gion;":[97],"uses":[100],"O(nk2":[101],"log":[102,225],"n)":[103],"time.":[104],"Our":[105,181],"methods":[106],"simple":[108,179],"allow":[110],"queries":[113],"from":[114],"s":[115],"query":[118],"t":[120],"be":[122],"answered":[123],"O(k":[126],"logn":[127],"+":[128],"m),":[129],"m":[131],"combinatorial":[134],"length.":[136],"show":[138],"for":[140],"nonconvex":[141],"this":[143],"\u201ctouring":[144],"\u201d":[146],"problem":[147,153,176,197,207,216],"NP-hard.":[149],"The":[150],"touring":[151],"strict":[156],"generalization":[157],"some":[159],"classic":[160],"problems":[161],"computational":[163],"geometry,":[164],"including":[165],"safari":[167,196,206],"problem,":[168,171],"zoo-keeper":[170],"watch-man":[174],"route":[175,201,215],"polygon.":[180],"new":[182],"magnitude":[188],"improvement":[189],"times":[193],"watchman":[200,214],"prob-lem:":[202],"solve":[204],"O(n2":[209],"logn)":[210],"(through":[217],"fixed":[219],"s)":[221],"O(n3":[224],"n),":[226],"compared":[227],"with":[228],"previous":[230],"bounds":[232],"O(n3)":[234],"O(n4),":[236],"respectively.":[237]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7097362136","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
