{"id":"https://openalex.org/W7163915836","doi":"https://doi.org/10.4230/lipics.swat.2026.14","title":"Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds","display_name":"Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163915836","doi":"https://doi.org/10.4230/lipics.swat.2026.14"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26050","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.14/LIPIcs.SWAT.2026.14.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":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.14/LIPIcs.SWAT.2026.14.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003113894","display_name":"Jaehoon Chung","orcid":"https://orcid.org/0000-0003-3278-9213"},"institutions":[{"id":"https://openalex.org/I125608817","display_name":"Korea Institute for Advanced Study","ror":"https://ror.org/041hz9568","country_code":"KR","type":"facility","lineage":["https://openalex.org/I125608817"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Chung, Jaehoon","raw_affiliation_strings":["Korea Institute for Advanced Study (KIAS), Seoul, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0002-6000-0622","affiliations":[{"raw_affiliation_string":"Korea Institute for Advanced Study (KIAS), Seoul, Republic of Korea","institution_ids":["https://openalex.org/I125608817"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003113894"],"corresponding_institution_ids":["https://openalex.org/I125608817"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.97424311,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"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.8560000061988831,"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.8560000061988831,"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/T11269","display_name":"Algorithms and Data Compression","score":0.032600000500679016,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.0210999995470047,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5935999751091003},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5918999910354614},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5105000138282776},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.46540001034736633},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.44519999623298645},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4124000072479248},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4115000069141388},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.39570000767707825},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.37439998984336853}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6715999841690063},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6137999892234802},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5935999751091003},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5918999910354614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5752000212669373},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5105000138282776},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.46540001034736633},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.44519999623298645},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4115000069141388},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.39570000767707825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37790000438690186},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37439998984336853},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.36899998784065247},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.35920000076293945},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.3149000108242035},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.2809000015258789},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26050","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.14/LIPIcs.SWAT.2026.14.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":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.14","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.14","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26050","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.14/LIPIcs.SWAT.2026.14.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":"publishedVersion"},"sustainable_development_goals":[{"score":0.5747376084327698,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163915836.pdf","grobid_xml":"https://content.openalex.org/works/W7163915836.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,55,85,140,232],"study":[1],"a":[2,5,25,74,203,216,226,258],"variant":[3],"of":[4,66,77,98,100,135,229,238,267,274,283],"polygon":[6,26],"partition":[7,32],"problem,":[8],"introduced":[9],"by":[10,37],"Chung,":[11],"Iwama,":[12],"Liao,":[13],"and":[14,24,68,89,105,119,174,200,269],"Ahn":[15],"[ISAAC'25].":[16],"Given":[17],"orthogonal":[18],"unit":[19],"vectors":[20],"\ud835\udc2e,\ud835\udc2f":[21],"\u2208":[22],"\u211d\u00b2":[23],"P":[27,33,136],"with":[28,157],"n":[29],"vertices,":[30],"we":[31,110,164,183,201,256],"into":[34],"connected":[35],"pieces":[36],"cuts":[38,79],"parallel":[39],"to":[40,159,190],"\ud835\udc2f":[41],"such":[42],"that":[43,150,262],"each":[44],"resulting":[45],"subpolygon":[46],"has":[47],"width":[48,134],"at":[49],"most":[50],"one":[51],"in":[52,80,115,123,137,145,210,240,249],"direction":[53,138],"\ud835\udc2e.":[54,139],"consider":[56],"the":[57,63,69,78,112,120,133,146,151,185,211,219,230,241,264,272,279,284],"value":[58,113],"version,":[59,71],"which":[60,72],"asks":[61],"for":[62,92,171,187,197,246],"minimum":[64],"number":[65],"strips,":[67],"reporting":[70,121,152],"outputs":[73],"compact":[75],"encoding":[76],"an":[81,176],"optimal":[82,156],"strip":[83,234],"partition.":[84],"give":[86],"efficient":[87],"algorithms":[88,170,196],"lower":[90,143,178,208],"bounds":[91,144],"both":[93,172,198],"versions":[94,173],"on":[95,225],"three":[96],"classes":[97],"polygons":[99,189],"increasing":[101],"generality:":[102],"convex,":[103],"simple,":[104],"self-overlapping.":[106],"For":[107,161,180],"convex":[108],"polygons,":[109,163,182],"solve":[111],"version":[114,122],"O(log":[116],"n)":[117,207],"time":[118],"O(h":[124],"log":[125,167,193,206],"(1":[126],"+":[127],"n/h))":[128],"time,":[129],"where":[130],"h":[131],"is":[132,154,278],"prove":[141,175,202],"matching":[142,204],"decision-tree":[147],"model,":[148],"showing":[149],"algorithm":[153,261],"input-sensitive":[155],"respect":[158],"h.":[160],"simple":[162,188],"present":[165],"O(n":[166,192],"n)-time,":[168,194],"O(n)-space":[169,195],"\u03a9(n)":[177],"bound.":[179],"self-overlapping":[181],"extend":[184],"approach":[186,223],"obtain":[191],"versions,":[199],"\u03a9(n":[205],"bound":[209],"algebraic":[212],"computation-tree":[213],"model":[214],"via":[215],"reduction":[217],"from":[218],"\u03b4-closeness":[220],"problem.":[221,231],"Our":[222],"relies":[224],"lattice-theoretic":[227],"formulation":[228],"represent":[233],"partitions":[235],"as":[236],"antichains":[237],"intervals":[239],"Clarke-Cormack-Burkowski":[242,285],"lattice,":[243],"originally":[244],"developed":[245],"minimal-interval":[247],"semantics":[248],"information":[250],"retrieval.":[251],"Within":[252],"this":[253,277],"lattice":[254,265],"framework,":[255],"design":[257],"dynamic":[259],"programming":[260],"uses":[263],"operations":[266],"meet":[268],"join.":[270],"To":[271],"best":[273],"our":[275],"knowledge,":[276],"first":[280],"geometric":[281],"application":[282],"lattice.":[286]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}