{"id":"https://openalex.org/W7163878253","doi":"https://doi.org/10.4230/lipics.swat.2026.5","title":"Arranging Pairwise Disjoint Shapes to Partition Point Sets","display_name":"Arranging Pairwise Disjoint Shapes to Partition Point Sets","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163878253","doi":"https://doi.org/10.4230/lipics.swat.2026.5"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26041","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.5/LIPIcs.SWAT.2026.5.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.5/LIPIcs.SWAT.2026.5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058258777","display_name":"Robert D. Barish","orcid":"https://orcid.org/0000-0001-5207-0375"},"institutions":[{"id":"https://openalex.org/I4210098918","display_name":"Tokyo Metropolitan Institute of Medical Science","ror":"https://ror.org/00vya8493","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210098918"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Barish, Robert D.","raw_affiliation_strings":["Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, University of Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0001-5207-0375","affiliations":[{"raw_affiliation_string":"Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, University of Tokyo, Japan","institution_ids":["https://openalex.org/I4210098918"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043159528","display_name":"Tetsuo Shibuya","orcid":"https://orcid.org/0000-0003-1514-5766"},"institutions":[{"id":"https://openalex.org/I4210098918","display_name":"Tokyo Metropolitan Institute of Medical Science","ror":"https://ror.org/00vya8493","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210098918"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shibuya, Tetsuo","raw_affiliation_strings":["Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, University of Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0003-1514-5766","affiliations":[{"raw_affiliation_string":"Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, University of Tokyo, Japan","institution_ids":["https://openalex.org/I4210098918"]}]}],"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.96836873,"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.9337000250816345,"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.9337000250816345,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.010900000110268593,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.006800000090152025,"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.6725000143051147},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5339999794960022},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5299999713897705},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5015000104904175},{"id":"https://openalex.org/keywords/equilateral-triangle","display_name":"Equilateral triangle","score":0.46709999442100525},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.40070000290870667},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38769999146461487},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.3840000033378601},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.3747999966144562},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.3626999855041504}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8341000080108643},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7402999997138977},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6725000143051147},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5339999794960022},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5299999713897705},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5015000104904175},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48179998993873596},{"id":"https://openalex.org/C146786541","wikidata":"https://www.wikidata.org/wiki/Q157002","display_name":"Equilateral triangle","level":2,"score":0.46709999442100525},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.40070000290870667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38769999146461487},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.3840000033378601},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.3747999966144562},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.3626999855041504},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3472999930381775},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.3257000148296356},{"id":"https://openalex.org/C4107886","wikidata":"https://www.wikidata.org/wiki/Q906377","display_name":"Discrete geometry","level":2,"score":0.3206000030040741},{"id":"https://openalex.org/C184585634","wikidata":"https://www.wikidata.org/wiki/Q1434060","display_name":"Bounding volume","level":4,"score":0.3197000026702881},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.3147999942302704},{"id":"https://openalex.org/C158245278","wikidata":"https://www.wikidata.org/wiki/Q4386982","display_name":"Equidistant","level":2,"score":0.30799999833106995},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.303600013256073},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.2827000021934509},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.27309998869895935},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C150397156","wikidata":"https://www.wikidata.org/wiki/Q591310","display_name":"General position","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C53471067","wikidata":"https://www.wikidata.org/wiki/Q7574076","display_name":"Spatial network","level":2,"score":0.2547999918460846}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26041","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.5/LIPIcs.SWAT.2026.5.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.5","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.5","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:26041","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.5/LIPIcs.SWAT.2026.5.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":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163878253.pdf","grobid_xml":"https://content.openalex.org/works/W7163878253.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1,159,205],"the":[2,14,38,64,92,151,162,165,206,247,288,291],"fine-grained":[3],"complexity":[4],"of":[5,9,21,32,90,97,155,164,185,201,220,236,246,272,277,290,294],"covering":[6,279],"a":[7,18,33,48,101,143,186,192,199,216,232,260,268],"set":[8,20,200,271],"n":[10,202],"points":[11,166,214,230,281],"\ud835\udcab":[12,168,197,283],"in":[13,63,137,167,282,287],"Euclidean":[15],"plane":[16],"using":[17],"fixed":[19],"geometric":[22],"objects":[23],"corresponding":[24],"to":[25,110,149],"rigid-body":[26],"translations":[27],"and,":[28],"where":[29],"permitted,":[30],"rotations":[31],"specified":[34],"shape":[35],"\u03a5.":[36,295],"Under":[37],"Exponential":[39],"Time":[40],"Hypothesis":[41],"(ETH),":[42],"and":[43,46,82,195,253,256,258],"both":[44,250],"with":[45,100,257],"without":[47,259],"pairwise":[49,261],"disjointness":[50,262],"constraint,":[51],"we":[52,135,158,204,264],"establish":[53,136],"that":[54,140,169,266],"no":[55],"2^{o(\u221an)}-time":[56],"algorithm":[57],"can":[58],"exist":[59],"for":[60,113],"this":[61],"problem":[62],"following":[65],"cases:":[66],"(case":[67,72,79],"1)":[68,211,252],"translatable":[69,74,81,273],"unit":[70],"disks;":[71],"2)":[73,227],"fixed-area":[75,84],"axis-aligned":[76],"squares;":[77],"or":[78,225],"3)":[80],"rotatable":[83,275],"equilateral":[85],"triangles.":[86],"Furthermore,":[87],"by":[88,191],"way":[89],"establishing":[91],"#P-completeness":[93],"under":[94,249],"parsimonious":[95],"reductions":[96,112],"positive":[98],"1-in-3-SAT":[99],"cubic":[102],"planar":[103],"3-connected":[104],"clause-variable":[105],"incidence":[106],"graph":[107],"-":[108,134],"pertinent":[109],"hardness":[111],"counting":[114,150],"tilings":[115],"{(Moore":[116],"&":[117,125],"Robson;":[118],"Discrete":[119],"Comput.":[120],"Geom.":[121],"26(4);":[122],"2001),":[123],"(Pak":[124],"Yang;":[126],"J.":[127],"Comb.":[128],"Theory.":[129],"Ser.":[130],"A":[131],"120(7);":[132],"2013)}":[133],"each":[138],"case":[139],"there":[141],"exists":[142],"quadratic":[144],"time":[145],"reduction":[146],"from":[147],"#SAT":[148],"possible":[152],"coverage-induced":[153],"partitions":[154],"\ud835\udcab.":[156],"Finally,":[157],"constraints":[160],"on":[161],"density":[163,207],"make":[170],"our":[171],"coverage":[172],"problems":[173],"tractable.":[174],"In":[175],"particular,":[176],"letting":[177,196],"\u03a5":[178,243,278],"be":[179,198],"any":[180,228],"(not":[181],"necessarily":[182],"connected)":[183],"subregion":[184],"radius":[187,221,237],"1/2":[188],"disk":[189,219,235],"characterized":[190],"semi-algebraic":[193,292],"function,":[194],"points,":[203],"requirements":[208],"that:":[209],"(constraint":[210,226,251,254],"every":[212],"3":[213],"have":[215,231],"minimum":[217,233,269],"bounding":[218,234],"greater":[222],"than":[223],"1;":[224],"5":[229],"at":[238],"least":[239],"2.":[240],"Here,":[241],"when":[242],"is":[244,284],"part":[245],"input,":[248],"2),":[255],"requirement,":[263],"show":[265],"finding":[267],"cardinality":[270],"and/or":[274],"instances":[276],"all":[280],"fixed-parameter":[285],"tractable":[286],"size":[289],"description":[293]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}