{"id":"https://openalex.org/W7166856495","doi":"https://doi.org/10.4230/lipics.icalp.2026.50","title":"Touring a Sequence of Orthogonal Polygons","display_name":"Touring a Sequence of Orthogonal Polygons","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166856495","doi":"https://doi.org/10.4230/lipics.icalp.2026.50"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26439","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.50","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.50/LIPIcs.ICALP.2026.50.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.50/LIPIcs.ICALP.2026.50.pdf","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":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Casel, Katrin","raw_affiliation_strings":["Humboldt-University Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0001-6146-8684","affiliations":[{"raw_affiliation_string":"Humboldt-University Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057527289","display_name":"\u202aS\u00e1ndor Kisfaludi-Bak","orcid":"https://orcid.org/0000-0002-6856-2902"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Kisfaludi-Bak, S\u00e1ndor","raw_affiliation_strings":["Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0000-0002-6856-2902","affiliations":[{"raw_affiliation_string":"Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090048794","display_name":"Linda Kleist","orcid":"https://orcid.org/0000-0002-3786-916X"},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kleist, Linda","raw_affiliation_strings":["University of Hamburg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3786-916X","affiliations":[{"raw_affiliation_string":"University of Hamburg, Germany","institution_ids":["https://openalex.org/I159176309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119959247","display_name":"Jeroen S. K. Lamme","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Lamme, Jeroen S.K.","raw_affiliation_strings":["Eindhoven University of Technology, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0005-8901-2271","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101749008","display_name":"Eunjin Oh","orcid":"https://orcid.org/0000-0003-0798-2580"},"institutions":[{"id":"https://openalex.org/I123900574","display_name":"Pohang University of Science and Technology","ror":"https://ror.org/04xysgw12","country_code":"KR","type":"education","lineage":["https://openalex.org/I123900574"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Oh, Eunjin","raw_affiliation_strings":["POSTECH, Pohang, South Korea"],"raw_orcid":"https://orcid.org/0000-0003-0798-2580","affiliations":[{"raw_affiliation_string":"POSTECH, Pohang, South Korea","institution_ids":["https://openalex.org/I123900574"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103034952","display_name":"Yanheng Wang","orcid":"https://orcid.org/0009-0007-4365-8899"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Wang, Yanheng","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0007-4365-8899","affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":6,"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.81097257,"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.9815999865531921,"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.9815999865531921,"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.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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.002099999925121665,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.6315000057220459},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6147000193595886},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5864999890327454},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5728999972343445},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.5633000135421753},{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.5066999793052673},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.4772999882698059},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.47609999775886536}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7250999808311462},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6315000057220459},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6147000193595886},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5864999890327454},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5728999972343445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5720000267028809},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.5633000135421753},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.5066999793052673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49140000343322754},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.4772999882698059},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.47609999775886536},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.40400001406669617},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.4009999930858612},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.3944000005722046},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.3718000054359436},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.3458999991416931},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.34139999747276306},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.3393999934196472},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3273000121116638},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31189998984336853},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.25600001215934753}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26439","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.50","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.50/LIPIcs.ICALP.2026.50.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.50","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.50","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26439","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.50","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.50/LIPIcs.ICALP.2026.50.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166856495.pdf","grobid_xml":"https://content.openalex.org/works/W7166856495.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,59,82,93,106],"problem":[3,60],"of":[4,13,21,143],"computing":[5],"a":[6,11,18,48,97,140],"shortest":[7],"tour":[8,25],"that":[9,31],"visits":[10],"sequence":[12,107],"k":[14],"polygons":[15,87,104,116,119],"P\u2081,\u2026,P_k":[16],"with":[17],"total":[19],"number":[20],"n":[22],"vertices.":[23],"A":[24],"is":[26],"an":[27,111,123],"oriented":[28],"curve":[29],"such":[30],"there":[32],"exist":[33],"points":[34],"p_i":[35,42],"\u2208":[36],"P_i":[37],"for":[38,70,114,126,159],"all":[39],"i":[40],"where":[41],"appears":[43],"not":[44],"after":[45],"p_{i+1}.":[46],"In":[47,77],"seminal":[49],"paper,":[50,79],"Dror,":[51],"Efrat,":[52],"Lubiw":[53],"and":[54,64,67,72,88,91,131,155],"Mitchell":[55],"(STOC":[56],"2003)":[57],"considered":[58],"under":[61],"L\u2082":[62],"distance,":[63],"gave":[65],"\u00d5(nk)":[66],"\u00d5(nk\u00b2)":[68],"algorithms":[69,133,137],"disjoint":[71],"intersecting":[73],"convex":[74],"polygons,":[75],"respectively.":[76],"this":[78],"we":[80],"consider":[81],"orthogonal":[83,86],"setting":[84],"(with":[85],"Manhattan":[89],"distance)":[90],"obtain":[92],"following":[94],"results:":[95],"-":[96,110,122,129],"truly":[98],"subquadratic":[99],"\u00d5(n^{2-1/48})":[100],"algorithm":[101,113,125],"when":[102,117],"consecutive":[103,118],"in":[105],"are":[108,120],"disjoint;":[109,121],"\u00d5(n)":[112],"ortho-convex":[115],"O(n)":[124],"axis-aligned":[127],"rectangles;":[128],"\u00d5(n\u00b2)":[130],"\u00d5(n^{1.5}k\u00b2)":[132],"without":[134],"restrictions.":[135],"Our":[136],"build":[138],"on":[139],"wide":[141],"range":[142],"techniques,":[144],"including":[145],"additively":[146],"weighted":[147,160],"Voronoi":[148],"diagrams,":[149],"rectangle":[150],"decompositions,":[151],"persistent":[152],"data":[153],"structures,":[154],"dynamic":[156],"distance":[157],"oracles":[158],"planar":[161],"graphs.":[162]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}