{"id":"https://openalex.org/W7163512217","doi":"https://doi.org/10.23919/date69613.2026.11539410","title":"Provably Optimal Planar Pareto Nearest Neighbor Search with Double Monotone Chains","display_name":"Provably Optimal Planar Pareto Nearest Neighbor Search with Double Monotone Chains","publication_year":2026,"publication_date":"2026-04-20","ids":{"openalex":"https://openalex.org/W7163512217","doi":"https://doi.org/10.23919/date69613.2026.11539410"},"language":null,"primary_location":{"id":"doi:10.23919/date69613.2026.11539410","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date69613.2026.11539410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 Design, Automation & Test in Europe Conference (DATE)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039573083","display_name":"Zizheng Guo","orcid":"https://orcid.org/0000-0002-0724-5356"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zizheng Guo","raw_affiliation_strings":["Peking University,School of Integrated Circuits"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Peking University,School of Integrated Circuits","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002760019","display_name":"Runsheng Wang","orcid":"https://orcid.org/0000-0002-7514-0767"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Runsheng Wang","raw_affiliation_strings":["Peking University,School of Integrated Circuits"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Peking University,School of Integrated Circuits","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000933188","display_name":"Yibo Lin","orcid":"https://orcid.org/0000-0002-0977-2774"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yibo Lin","raw_affiliation_strings":["Peking University,School of Integrated Circuits"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Peking University,School of Integrated Circuits","institution_ids":["https://openalex.org/I20231570"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20231570"],"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":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.18060000240802765,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.18060000240802765,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.13689999282360077,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0746999979019165,"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/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4952999949455261},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4494999945163727},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4058000147342682},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.3578000068664551},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.33629998564720154},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.31349998712539673},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.3089999854564667}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5388000011444092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5336999893188477},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4952999949455261},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4058000147342682},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3889999985694885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3720000088214874},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34630000591278076},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/date69613.2026.11539410","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date69613.2026.11539410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 Design, Automation & Test in Europe Conference (DATE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320329860","display_name":"National Science and Technology Major Project","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2007610503","https://openalex.org/W2016523183","https://openalex.org/W2026175709","https://openalex.org/W2034999260","https://openalex.org/W2096547754","https://openalex.org/W2125831674","https://openalex.org/W2134644026","https://openalex.org/W2343109328","https://openalex.org/W2790830285","https://openalex.org/W2902521181","https://openalex.org/W2914161519","https://openalex.org/W2946332877","https://openalex.org/W4232603692","https://openalex.org/W4251391716","https://openalex.org/W4404479546"],"related_works":[],"abstract_inverted_index":{"A":[0],"core":[1],"task":[2],"in":[3,82],"EDA":[4],"is":[5,50,96,142],"to":[6,23,41,136,148],"bridge":[7],"layout":[8,43],"and":[9,25,91,101],"topology:":[10],"given":[11],"planar":[12],"pins,":[13],"build":[14],"a":[15,66,72,143],"sparse":[16],"graph":[17],"that":[18,29,77,150],"captures":[19],"who":[20],"should":[21],"connect":[22],"whom,":[24],"then":[26],"optimize":[27],"on":[28],"graph.":[30],"In":[31],"timing-driven":[32],"routing":[33],"(e.g.,":[34],"Prim\u2013Dijkstra),":[35],"this":[36],"means":[37],"linking":[38],"each":[39],"point":[40,110],"its":[42],"nearest":[44],"neighbors.":[45],"The":[46,139],"right,":[47],"metric-agnostic":[48],"choice":[49],"the":[51,97,103,114],"four-quadrant":[52],"Pareto/skyline":[53],"neighbors,":[54],"which":[55],"preserve":[56],"candidates":[57],"for":[58,109],"any":[59],"distance":[60],"model\u2014but":[61],"their":[62],"standard":[63],"construction":[64],"has":[65],"quadratic":[67],"time":[68,85],"complexity.":[69],"We":[70],"introduce":[71],"novel":[73],"double-monotone-chain":[74],"sweep":[75],"algorithm":[76],"computes":[78],"all":[79],"Pareto":[80,106,120],"neighbors":[81,107],"optimal,":[83],"output-sensitive":[84],"$O\\left({\\sum\\nolimits_{i":[86],"=":[87],"1}^n":[88],"{{k_i}}":[89],"}\\right)$":[90],"O(n)":[92],"space":[93],"where":[94],"n":[95],"number":[98,104],"of":[99,105],"points":[100],"kiis":[102],"reported":[108],"i.":[111],"This":[112],"removes":[113],"O(n2)":[115],"barrier":[116],"while":[117],"retaining":[118],"full":[119],"coverage.":[121],"On":[122],"large":[123],"nets,":[124],"our":[125],"implementation":[126],"produces":[127],"Steiner":[128],"trees":[129],"with":[130],"OpenROAD-level":[131],"quality":[132],"yet":[133],"runs":[134],"up":[135],"39\u00d7":[137],"faster.":[138],"resulting":[140],"primitive":[141],"practical":[144],"gateway":[145],"from":[146],"geometry":[147],"topology":[149],"benefits":[151],"layout-aware":[152],"optimizations.":[153]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-06-05T00:00:00"}