{"id":"https://openalex.org/W7154953703","doi":"https://doi.org/10.48550/arxiv.2604.16112","title":"Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter","display_name":"Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter","publication_year":2026,"publication_date":"2026-04-17","ids":{"openalex":"https://openalex.org/W7154953703","doi":"https://doi.org/10.48550/arxiv.2604.16112"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.16112","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16112","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.16112","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051903032","display_name":"Henning Hillebrandt","orcid":"https://orcid.org/0009-0007-7029-0014"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hillebrandt, Henning","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055096967","display_name":"Andreas Padalkin","orcid":"https://orcid.org/0000-0002-4601-9597"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Padalkin, Andreas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063355098","display_name":"Christian Scheideler","orcid":"https://orcid.org/0000-0002-5278-528X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Scheideler, Christian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026983991","display_name":"Daniel Warner","orcid":"https://orcid.org/0000-0002-9423-6094"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Warner, Daniel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5084662645","display_name":"Julian Werthmann","orcid":"https://orcid.org/0000-0002-5110-5625"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Werthmann, Julian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.8234999775886536,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.8234999775886536,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.04170000180602074,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T12288","display_name":"Optimization and Search Problems","score":0.01600000075995922,"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/decomposition","display_name":"Decomposition","score":0.6399000287055969},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5629000067710876},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47119998931884766},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.43309998512268066},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.3885999917984009},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.37940001487731934},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.3522000014781952},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.34470000863075256},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.3409999907016754}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6399000287055969},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5629000067710876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49320000410079956},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47119998931884766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.454800009727478},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.43309998512268066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42250001430511475},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3885999917984009},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.37940001487731934},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.34470000863075256},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.33410000801086426},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29840001463890076},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.29600000381469727},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2628999948501587},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.25679999589920044},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.16112","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16112","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.16112","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16112","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,30],"decomposition":[1,99,122,142],"of":[2,16,22,27,57,113,153,169],"complex":[3],"structures":[4],"into":[5,101,123],"simpler":[6],"substructures":[7],"is":[8,33],"a":[9,13,34,92,97,110,121,141,160],"powerful":[10],"technique":[11],"with":[12,180],"wide":[14],"range":[15],"applications.":[17],"We":[18,51],"study":[19],"the":[20,25,48,53,58,82,151,156,165],"computation":[21],"decompositions":[23],"in":[24,143,155],"context":[26],"programmable":[28,38],"matter.":[29],"amoebot":[31,60,114,132,157],"model":[32,36],"well-established":[35],"for":[37,130,176],"matter,":[39],"which":[40,62],"places":[41],"$n$":[42],"tiny":[43],"robots":[44],"called":[45],"amoebots":[46,64,79],"on":[47,109],"triangular":[49],"grid.":[50],"consider":[52],"reconfigurable":[54,86],"circuit":[55],"extension":[56],"geometric":[59],"model,":[61],"allows":[63],"to":[65,77,187],"interconnect":[66],"via":[67],"so-called":[68,102],"circuits.":[69],"Amoebots":[70],"can":[71,138],"then":[72],"instantaneously":[73],"transmit":[74],"simple":[75],"beeps":[76],"all":[78],"connected":[80],"by":[81],"same":[83],"circuit.":[84],"Using":[85],"circuits,":[87],"previous":[88],"papers":[89],"have":[90],"described":[91],"linear-time":[93],"triangulation":[94],"algorithm,":[95],"and":[96,134,179],"logarithmic-time":[98],"algorithm":[100,168,186],"tunnel":[103],"regions.":[104],"Both":[105],"algorithms":[106],"only":[107],"work":[108],"restricted":[111],"class":[112],"structures.":[115],"In":[116],"this":[117],"paper,":[118],"we":[119,162],"define":[120],"$O(|\\mathcal":[124],"H|)$":[125],"simple,":[126],"geodesically":[127],"convex":[128],"regions":[129],"arbitrary":[131],"structures,":[133],"show":[135],"how":[136],"it":[137],"compute":[139],"such":[140],"$O(\\log":[144,188],"n)$":[145,189],"rounds,":[146],"where":[147],"$|\\mathcal":[148],"H|$":[149],"denotes":[150],"number":[152],"holes":[154],"structure.":[158],"As":[159],"byproduct,":[161],"also":[163,182],"improve":[164],"global":[166],"maxima":[167],"Padalkin":[170],"et":[171],"al.":[172],"(Nat.":[173],"Comput.,":[174],"2024)":[175],"special":[177],"cases":[178],"that":[181],"their":[183],"spanning":[184],"tree":[185],"rounds":[190],"w.h.p.":[191]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-21T00:00:00"}