{"id":"https://openalex.org/W7162560030","doi":"https://doi.org/10.4230/lipics.socg.2026.52","title":"Online Packing of Orthogonal Polygons","display_name":"Online Packing of Orthogonal Polygons","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162560030","doi":"https://doi.org/10.4230/lipics.socg.2026.52"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25858","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.52","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.52/LIPIcs.SoCG.2026.52.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-vol367-socg2026/LIPIcs.SoCG.2026.52/LIPIcs.SoCG.2026.52.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130435020","display_name":"Tim Gerlach","orcid":null},"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":"Gerlach, Tim","raw_affiliation_strings":["Universit\u00e4t Hamburg, Germany"],"raw_orcid":"https://orcid.org/0009-0004-6294-9235","affiliations":[{"raw_affiliation_string":"Universit\u00e4t Hamburg, Germany","institution_ids":["https://openalex.org/I159176309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130628246","display_name":"Benjamin Hennies","orcid":null},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hennies, Benjamin","raw_affiliation_strings":["Technische Universit\u00e4t Braunschweig, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"last","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":["Universit\u00e4t Hamburg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3786-916X","affiliations":[{"raw_affiliation_string":"Universit\u00e4t Hamburg, Germany","institution_ids":["https://openalex.org/I159176309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.56349255,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9485999941825867,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9485999941825867,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.02370000071823597,"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/T12288","display_name":"Optimization and Search Problems","score":0.005799999926239252,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/competitive-analysis","display_name":"Competitive analysis","score":0.8305000066757202},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6707000136375427},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6011999845504761},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5321999788284302},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.43529999256134033},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4138999879360199},{"id":"https://openalex.org/keywords/orthogonal-array","display_name":"Orthogonal array","score":0.39340001344680786},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.35569998621940613}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8305000066757202},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6707000136375427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6025000214576721},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6011999845504761},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5321999788284302},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.491100013256073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44920000433921814},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.43529999256134033},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4138999879360199},{"id":"https://openalex.org/C42632107","wikidata":"https://www.wikidata.org/wiki/Q2031860","display_name":"Orthogonal array","level":3,"score":0.39340001344680786},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35569998621940613},{"id":"https://openalex.org/C147037132","wikidata":"https://www.wikidata.org/wiki/Q6865426","display_name":"Minimum bounding box","level":3,"score":0.3393999934196472},{"id":"https://openalex.org/C183893376","wikidata":"https://www.wikidata.org/wiki/Q900117","display_name":"Sphere packing","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.3273000121116638},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C98503990","wikidata":"https://www.wikidata.org/wiki/Q28474","display_name":"Perimeter","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C123115066","wikidata":"https://www.wikidata.org/wiki/Q5121501","display_name":"Circle packing","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28760001063346863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28029999136924744},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C72319582","wikidata":"https://www.wikidata.org/wiki/Q584304","display_name":"Degenerate energy levels","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25220000743865967},{"id":"https://openalex.org/C140142295","wikidata":"https://www.wikidata.org/wiki/Q617417","display_name":"Isoperimetric inequality","level":2,"score":0.251800000667572},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25858","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.52","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.52/LIPIcs.SoCG.2026.52.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.socg.2026.52","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.52","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:25858","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.52","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.52/LIPIcs.SoCG.2026.52.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/W7162560030.pdf","grobid_xml":"https://content.openalex.org/works/W7162560030.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"While":[0,173],"rectangular":[1],"and":[2,222],"box-shaped":[3],"objects":[4],"dominate":[5],"the":[6,58,69,85,99,114,148,165,204,240,243,247,259],"classic":[7],"discourse":[8],"of":[9,46,52,61,75,87,137,196,211,242,261],"theoretic":[10],"investigations,":[11],"a":[12,72,186,262],"fascinating":[13],"frontier":[14],"lies":[15],"in":[16,44,79,122,167,216,230,236],"packing":[17,156,194,249],"more":[18,171],"complex":[19],"shapes.":[20],"Given":[21],"recent":[22],"insights":[23,202],"that":[24,57,65,93,113,143],"convex":[25],"polygons":[26,159],"do":[27],"not":[28],"allow":[29],"for":[30,35,144,155,177,183,219,232,238],"constant":[31,94,174],"competitive":[32,59,95,135,175,187,209,228],"online":[33,63,130,181,213,225],"algorithms":[34,96,176,226],"diverse":[36],"variants":[37,195],"under":[38,199],"translation,":[39,200],"we":[40,55,91,111],"study":[41],"orthogonal":[42,53,100,109,146,158,197],"polygons,":[43,147],"particular":[45],"small":[47],"complexity.":[48],"For":[49,106,192],"translational":[50],"packings":[51],"6-gons,":[54],"show":[56,92,112],"ratio":[60,136,188,210],"any":[62,212],"algorithm":[64,131,150,182,214],"aims":[66],"to":[67],"pack":[68],"items":[70],"into":[71,258],"minimal":[73],"number":[74,86],"unit":[76,263],"bins":[77],"is":[78,126,151,169,215,251],"\u03a9(n/(log":[80,217],"n)),":[81],"where":[82],"n":[83],"denotes":[84],"objects.":[88],"In":[89],"contrast,":[90],"exist":[97,224],"when":[98],"6-gons":[101,198],"are":[102],"symmetric":[103],"or":[104,235],"small.":[105],"(orthogonally":[107],"convex)":[108],"8-gons,":[110],"trivial":[115,149],"n-competitive":[116],"algorithm,":[117],"which":[118],"places":[119],"each":[120],"item":[121],"its":[123],"own":[124],"bin,":[125],"best-possible,":[127],"i.e.,":[128],"every":[129,254],"has":[132],"an":[133],"asymptotic":[134,208],"at":[138],"least":[139],"n.":[140,191],"This":[141],"implies":[142],"general":[145],"best":[152],"possible.":[153],"Interestingly,":[154],"degenerate":[157],"(with":[160],"thickness":[161],"0),":[162],"called":[163],"skeletons,":[164],"change":[166],"complexity":[168],"even":[170],"drastic.":[172],"6-skeletons":[178],"exist,":[179],"no":[180],"8-skeletons":[184],"achieves":[185],"better":[189],"than":[190],"other":[193],"our":[201],"imply":[203],"following":[205],"consequences.":[206],"The":[207],"n))":[218],"strip":[220],"packing,":[221,234],"there":[223],"with":[227],"ratios":[229],"O(1)":[231],"perimeter":[233],"O(\u221an)":[237],"minimizing":[239],"area":[241],"bounding":[244],"box.":[245],"Moreover,":[246],"critical":[248],"density":[250],"positive":[252],"(if":[253],"object":[255],"individually":[256],"fits":[257],"interior":[260],"bin).":[264]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}