{"id":"https://openalex.org/W7160862782","doi":"https://doi.org/10.48550/arxiv.2605.07882","title":"Touring a Sequence of Orthogonal Polygons","display_name":"Touring a Sequence of Orthogonal Polygons","publication_year":2026,"publication_date":"2026-05-08","ids":{"openalex":"https://openalex.org/W7160862782","doi":"https://doi.org/10.48550/arxiv.2605.07882"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.icalp.2026.50","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010130308","display_name":"Katrin Casel","orcid":"https://orcid.org/0000-0001-6146-8684"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Casel, Katrin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135900239","display_name":"S\u00e1ndor Kisfaludi-Bak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kisfaludi-Bak, S\u00e1ndor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090048794","display_name":"Linda Kleist","orcid":"https://orcid.org/0000-0002-3786-916X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kleist, Linda","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119959247","display_name":"Jeroen S. K. Lamme","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lamme, Jeroen S. K.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135863162","display_name":"Eunjin Oh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oh, Eunjin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103034952","display_name":"Yanheng Wang","orcid":"https://orcid.org/0009-0007-4365-8899"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yanheng","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":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.6199187,"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.9876999855041504,"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.9876999855041504,"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/T11830","display_name":"Point processes and geometric inequalities","score":0.002099999925121665,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.0017999999690800905,"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/disjoint-sets","display_name":"Disjoint sets","score":0.6273000240325928},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6050000190734863},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.5670999884605408},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5623999834060669},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5496000051498413},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.49570000171661377},{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.4697999954223633},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.45669999718666077},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4302000105381012}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.699999988079071},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6273000240325928},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6050000190734863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5683000087738037},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.5670999884605408},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5623999834060669},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5496000051498413},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.49570000171661377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48980000615119934},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.4697999954223633},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.45669999718666077},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4302000105381012},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4277999997138977},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.4262999892234802},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.3747999966144562},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.3741999864578247},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.34389999508857727},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.34130001068115234},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3336000144481659},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30959999561309814},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.3034999966621399},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2563000023365021},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2549000084400177}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.4230/lipics.icalp.2026.50","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2605.07882","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07882","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.icalp.2026.50","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,59,84,95,109],"problem":[3,60],"of":[4,13,22,149],"computing":[5],"a":[6,11,19,48,99,146],"shortest":[7],"tour":[8,26],"that":[9,32],"visits":[10],"sequence":[12,110],"$k$":[14],"polygons":[15,89,107,120,123],"$P_1,\\dots,":[16],"P_k$":[17],"with":[18],"total":[20],"number":[21],"$n$":[23],"vertices.":[24],"A":[25],"is":[27],"an":[28,114,127],"oriented":[29],"curve":[30],"such":[31],"there":[33],"exist":[34],"points":[35],"$p_i\\in":[36],"P_i$":[37],"for":[38,72,118,130,165],"all":[39],"$i$":[40],"where":[41],"$p_i$":[42],"appears":[43],"not":[44],"after":[45],"$p_{i+1}$.":[46],"In":[47,79],"seminal":[49],"paper,":[50,81],"Dror,":[51],"Efrat,":[52],"Lubiw":[53],"and":[54,64,68,74,90,93,136,161],"Mitchell":[55],"(STOC":[56],"2003)":[57],"considered":[58],"under":[61],"$L_2$":[62],"distance,":[63],"gave":[65],"$\\widetilde":[66,69,102,115,134,137],"O(nk)$":[67],"O(nk^2)$":[70],"algorithms":[71,139,143],"disjoint":[73],"intersecting":[75],"convex":[76],"polygons,":[77],"respectively.":[78],"this":[80],"we":[82],"consider":[83],"orthogonal":[85,88],"setting":[86],"(with":[87],"Manhattan":[91],"distance)":[92],"obtain":[94],"following":[96],"results:":[97],"-":[98,113,126,133],"truly":[100],"subquadratic":[101],"O(n^{2-\\frac{1}{48}})$":[103],"algorithm":[104,117,129],"when":[105,121],"consecutive":[106,122],"in":[108],"are":[111,124],"disjoint;":[112,125],"O(n)$":[116],"ortho-convex":[119],"$O(n)$":[128],"axis-aligned":[131],"rectangles;":[132],"O(n^2)$":[135],"O(n^{1.5}k^2)$":[138],"without":[140],"restrictions.":[141],"Our":[142],"build":[144],"on":[145],"wide":[147],"range":[148],"techniques,":[150],"including":[151],"additively":[152],"weighted":[153,166],"Voronoi":[154],"diagrams,":[155],"rectangle":[156],"decompositions,":[157],"persistent":[158],"data":[159],"structures,":[160],"dynamic":[162],"distance":[163],"oracles":[164],"planar":[167],"graphs.":[168]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-05-12T00:00:00"}