{"id":"https://openalex.org/W6911788776","doi":"https://doi.org/10.5281/zenodo.14266122","title":"Exact Algorithms for Minimum Dilation Triangulation","display_name":"Exact Algorithms for Minimum Dilation Triangulation","publication_year":2024,"publication_date":"2024-12-03","ids":{"openalex":"https://openalex.org/W6911788776","doi":"https://doi.org/10.5281/zenodo.14266122"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.14266122","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.14266122","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.14266122","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Keldenich, Phillip-Rapha\u00ebl","orcid":"https://orcid.org/0000-0002-6677-5090"},"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":true,"raw_author_name":"Keldenich, Phillip-Rapha\u00ebl","raw_affiliation_strings":["Technische Universit\u00e4t Braunschweig"],"raw_orcid":"https://orcid.org/0000-0002-6677-5090","affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Braunschweig","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Perk, Michael","orcid":"https://orcid.org/0000-0002-0141-8594"},"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":"Perk, Michael","raw_affiliation_strings":["Technische Universit\u00e4t Braunschweig"],"raw_orcid":"https://orcid.org/0000-0002-0141-8594","affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Braunschweig","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"last","author":{"id":null,"display_name":"Fekete, S\u00e1ndor","orcid":"https://orcid.org/0000-0002-9062-4241"},"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":"Fekete, S\u00e1ndor","raw_affiliation_strings":["TU Braunschweig"],"raw_orcid":"https://orcid.org/0000-0002-9062-4241","affiliations":[{"raw_affiliation_string":"TU Braunschweig","institution_ids":["https://openalex.org/I94509681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94509681"],"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":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/dilation","display_name":"Dilation (metric space)","score":0.625},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4869999885559082},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.47589999437332153},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4196000099182129},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.40639999508857727},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.3646000027656555},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3398999869823456},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3301999866962433},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.3240000009536743}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6298999786376953},{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5426999926567078},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4869999885559082},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.47589999437332153},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.40639999508857727},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.3646000027656555},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3398999869823456},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3301999866962433},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C7356347","wikidata":"https://www.wikidata.org/wiki/Q1307838","display_name":"Unit square","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2874999940395355},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28360000252723694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27619999647140503},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5281/zenodo.14266122","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.14266122","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"article"}],"best_oa_location":{"id":"doi:10.5281/zenodo.14266122","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.14266122","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"repository":[1],"contains":[2],"the":[3,9,52,73,88,92,97,105,108,126,148,167,227,230,240,250,254,260,263],"code":[4],"and":[5,25,122,247],"experiment":[6],"data":[7],"for":[8,13,28,87,124,128,159,183,235,269],"paper":[10],"\"Exact":[11],"Algorithms":[12],"Minimum":[14,31],"Dilation":[15,32],"Triangulation\".":[16],"We":[17,117,179,214],"provide":[18,118,266],"a":[19,30,35,45,55,60,174,221],"spectrum":[20],"of":[21,40,48,69,99,150,169,176,194,224,229,245,257],"new":[22,144],"theoretical":[23],"insights":[24,146],"practical":[26],"results":[27,158],"finding":[29],"Triangulation":[33],"(MDT),":[34],"natural":[36],"geometric":[37,145],"optimization":[38],"problem":[39,109,218],"considerable":[41],"previous":[42,205,241],"attention:":[43],"Given":[44],"set":[46],"P":[47],"n":[49,274],"points":[50,70,135],"in":[51,64,136],"plane,":[53],"find":[54],"triangulation":[56],"T,":[57],"such":[58],"that":[59,189],"shortest":[61],"Euclidean":[62],"path":[63],"T":[65],"between":[66],"any":[67],"pair":[68],"increases":[71],"by":[72,173,219],"smallest":[74],"possible":[75],"factor":[76,175],"compared":[77],"to":[78,113,133,161,199,253,273],"their":[79],"straight-line":[80],"distance.":[81],"No":[82],"polynomial-time":[83],"algorithm":[84],"is":[85,110],"known":[86,112],"problem;":[89],"moreover,":[90],"evaluating":[91,185],"objective":[93],"function":[94],"involves":[95],"computing":[96,125],"sum":[98],"(possibly":[100,209],"many)":[101],"square":[102,195],"roots.":[103],"On":[104],"other":[106],"hand,":[107],"not":[111],"be":[114],"NP-hard.":[115],"(1)":[116],"practically":[119],"robust":[120],"methods":[121,155],"implementations":[123],"MDT":[127],"benchmark":[129],"sets":[130],"with":[131,204],"up":[132,160,272],"30,000":[134],"reasonable":[137],"time":[138],"on":[139,143,208,226],"commodity":[140],"hardware,":[141],"based":[142],"into":[147],"structure":[149],"optimal":[151,202,267],"edge":[152],"sets.":[153],"Previous":[154],"only":[156],"achieved":[157],"200":[162],"points,":[163],"so":[164],"we":[165,265],"extend":[166],"range":[168],"optimally":[170],"solvable":[171],"instances":[172],"150.":[177],"(2)":[178],"develop":[180],"scalable":[181],"techniques":[182],"accurately":[184],"many":[186],"shortest-path":[187],"queries":[188],"arise":[190],"as":[191],"large-scale":[192],"sums":[193],"roots,":[196],"allowing":[197],"us":[198],"certify":[200],"exact":[201],"solutions,":[203],"work":[206],"relying":[207],"inaccurate)":[210],"floating-point":[211],"computations.":[212],"(3)":[213],"resolve":[215],"an":[216],"open":[217],"establishing":[220],"lower":[222,243],"bound":[223,244,256],"$1.44116$":[225],"dilation":[228],"regular":[231,270],"84-gon":[232],"(and":[233],"thus":[234],"arbitrary":[236],"point":[237],"sets),":[238],"improving":[239],"worst-case":[242],"$1.4308$":[246],"greatly":[248],"reducing":[249],"remaining":[251],"gap":[252],"upper":[255],"1.4482":[258],"from":[259],"literature.":[261],"In":[262],"process,":[264],"solutions":[268],"n-gons":[271],"=":[275],"100.":[276]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}