{"id":"https://openalex.org/W7162554253","doi":"https://doi.org/10.4230/lipics.socg.2026.1","title":"Covering and Partitioning Complex Objects with Small Pieces","display_name":"Covering and Partitioning Complex Objects with Small Pieces","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162554253","doi":"https://doi.org/10.4230/lipics.socg.2026.1"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25807","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.1","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.1/LIPIcs.SoCG.2026.1.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.1/LIPIcs.SoCG.2026.1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066049644","display_name":"Anders Aamand","orcid":"https://orcid.org/0000-0002-0402-0514"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Aamand, Anders","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-0402-0514","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017343893","display_name":"Mikkel Abrahamsen","orcid":"https://orcid.org/0000-0003-2734-4690"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Abrahamsen, Mikkel","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-2734-4690","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003987432","display_name":"Reilly Browne","orcid":"https://orcid.org/0000-0003-3725-5245"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Browne, Reilly","raw_affiliation_strings":["Department of Computer Science, Dartmouth College, Hanover, NH, USA"],"raw_orcid":"https://orcid.org/0000-0003-3725-5245","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137155818","display_name":"Mayank Goswami","orcid":"https://orcid.org/0000-0002-2111-3210"},"institutions":[{"id":"https://openalex.org/I111455621","display_name":"Queens College, CUNY","ror":"https://ror.org/03v8adn41","country_code":"US","type":"education","lineage":["https://openalex.org/I111455621"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Goswami, Mayank","raw_affiliation_strings":["Department of Computer Science, Queens College CUNY, New York, NY, USA"],"raw_orcid":"https://orcid.org/0000-0002-2111-3210","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Queens College CUNY, New York, NY, USA","institution_ids":["https://openalex.org/I111455621"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050437915","display_name":"Prahlad Narasimhan Kasthurirangan","orcid":"https://orcid.org/0000-0002-8518-7745"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kasthurirangan, Prahlad Narasimhan","raw_affiliation_strings":["Department of Applied Mathematics and Statistics, Stony Brook University, NY, USA"],"raw_orcid":"https://orcid.org/0000-0002-8518-7745","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Statistics, Stony Brook University, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"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/I70451448","display_name":"HAW Hamburg","ror":"https://ror.org/00fkqwx76","country_code":"DE","type":"education","lineage":["https://openalex.org/I70451448"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kleist, Linda","raw_affiliation_strings":["Department of Informatics, Universtity Hamburg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3786-916X","affiliations":[{"raw_affiliation_string":"Department of Informatics, Universtity Hamburg, Germany","institution_ids":["https://openalex.org/I70451448"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137132688","display_name":"Joseph S. B. Mitchell","orcid":"https://orcid.org/0000-0002-0152-2279"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mitchell, Joseph S. B.","raw_affiliation_strings":["Department of Applied Mathematics and Statistics, Stony Brook University, NY, USA"],"raw_orcid":"https://orcid.org/0000-0002-0152-2279","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Statistics, Stony Brook University, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104000427","display_name":"Valentin Polishchuk","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]},{"id":"https://openalex.org/I4210161337","display_name":"Swedish National Road and Transport Research Institute","ror":"https://ror.org/04zmmpw58","country_code":"SE","type":"government","lineage":["https://openalex.org/I4210161337"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Polishchuk, Valentin","raw_affiliation_strings":["Communications and Transport Systems, Link\u00f6ping Univeristy, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-8292-2281","affiliations":[{"raw_affiliation_string":"Communications and Transport Systems, Link\u00f6ping Univeristy, Sweden","institution_ids":["https://openalex.org/I102134673","https://openalex.org/I4210161337"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137115853","display_name":"Jack Stade","orcid":"https://orcid.org/0009-0007-9153-6589"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Stade, Jack","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0009-0007-9153-6589","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":7,"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.66719326,"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.8033999800682068,"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.8033999800682068,"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/T14339","display_name":"Image Processing and 3D Reconstruction","score":0.08810000121593475,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.02979999966919422,"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/partition","display_name":"Partition (number theory)","score":0.6453999876976013},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.48890000581741333},{"id":"https://openalex.org/keywords/swap","display_name":"Swap (finance)","score":0.4481000006198883},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.42489999532699585},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.3977000117301941},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.3950999975204468},{"id":"https://openalex.org/keywords/unit-square","display_name":"Unit square","score":0.38960000872612},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.36959999799728394}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6500999927520752},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6453999876976013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6345999836921692},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.48890000581741333},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.4481000006198883},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.42489999532699585},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.3977000117301941},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.3950999975204468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39309999346733093},{"id":"https://openalex.org/C7356347","wikidata":"https://www.wikidata.org/wiki/Q1307838","display_name":"Unit square","level":2,"score":0.38960000872612},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.36959999799728394},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33309999108314514},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30059999227523804},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C13670688","wikidata":"https://www.wikidata.org/wiki/Q3500548","display_name":"Space partitioning","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25807","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.1","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.1/LIPIcs.SoCG.2026.1.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":"pmh:oai:pure.atira.dk:openaire_cris_publications/13683f7a-1380-4b76-bae9-f8c5e4668074","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/13683f7a-1380-4b76-bae9-f8c5e4668074","pdf_url":"https://curis.ku.dk/ws/files/553758023/Covering_and_Partitioning.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"contributionToPeriodical"},{"id":"doi:10.4230/lipics.socg.2026.1","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.1","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25807","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.1","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.1/LIPIcs.SoCG.2026.1.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":[{"id":"https://openalex.org/G2230064840","display_name":"AF:SMALL:RUI:UNDERSTANDING THE GEOMETRY AND DIVERSITY OF SOLUTIONS - ALGORITHMS FOR GENERATING DIVERSE SOLUTIONS IN OPTIMIZATION","funder_award_id":"2503086","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5367877527","display_name":null,"funder_award_id":"54451","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320322958","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162554253.pdf","grobid_xml":"https://content.openalex.org/works/W7162554253.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,60],"study":[1],"the":[2,54,74,116,125,129,135,157,162],"problems":[3,64],"of":[4,18,45,77,161,168],"covering":[5],"or":[6,182],"partitioning":[7],"a":[8,15,22,26,43,81,93,119,140,165,186],"polygon":[9],"P":[10,41,167,195],"(possibly":[11],"with":[12,96],"holes)":[13],"using":[14],"minimum":[16],"number":[17,76],"small":[19,23,46],"pieces,":[20,47],"where":[21],"piece":[24],"is":[25,114,118,175,189,196],"connected":[27],"sub-polygon":[28],"contained":[29],"in":[30,49,66,156,191],"an":[31,179],"axis-aligned":[32],"unit":[33],"square.":[34],"For":[35,79],"covering,":[36,80],"we":[37,51,107,171],"seek":[38],"to":[39,56,88,132,177,184],"write":[40],"as":[42],"union":[44],"and":[48,71,102,150,202],"partitioning,":[50],"furthermore":[52],"require":[53],"pieces":[55,91],"be":[57],"pairwise":[58],"interior-disjoint.":[59],"show":[61,108,172],"that":[62,109,142,173,188],"these":[63],"are":[65],"fact":[67],"equivalent:":[68],"Optimum":[69],"covers":[70],"partitions":[72],"have":[73],"same":[75],"pieces.":[78,98],"natural":[82],"local":[83],"search":[84],"algorithm":[85,138],"repeatedly":[86],"attempts":[87],"replace":[89],"k":[90],"from":[92],"candidate":[94],"cover":[95,117,181],"k-1":[97],"In":[99,154],"two":[100],"dimensions":[101],"for":[103,128,145,164],"sufficiently":[104],"large":[105],"k,":[106],"when":[110],"no":[111,203],"such":[112],"swap":[113],"possible,":[115],"1+":[120],"O(1/\u221ak)":[121],"approximation,":[122],"hence":[123],"obtaining":[124],"first":[126],"PTAS":[127],"problem.":[130],"Prior":[131],"our":[133],"work,":[134],"only":[136,143],"known":[137],"was":[139],"13-approximation":[141],"works":[144],"polygons":[146],"without":[147],"holes":[148],"[Abrahamsen":[149],"Rasmussen,":[151],"SODA":[152],"2025].":[153],"contrast,":[155],"three":[158],"dimensional":[159],"version":[160],"problem,":[163],"polyhedron":[166],"complexity":[169],"n,":[170,192],"it":[174],"NP-hard":[176],"approximate":[178],"optimal":[180],"partition":[183],"within":[185],"factor":[187],"logarithmic":[190],"even":[193],"if":[194],"simple,":[197],"i.e.,":[198],"has":[199],"genus":[200],"0":[201],"holes.":[204]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2026-05-28T00:00:00"}