{"id":"https://openalex.org/W2091757707","doi":"https://doi.org/10.1137/0209017","title":"Voronoui Diagrams in $L_1 (L_\\infty )$ Metrics with 2-Dimensional Storage Applications","display_name":"Voronoui Diagrams in $L_1 (L_\\infty )$ Metrics with 2-Dimensional Storage Applications","publication_year":1980,"publication_date":"1980-02-01","ids":{"openalex":"https://openalex.org/W2091757707","doi":"https://doi.org/10.1137/0209017","mag":"2091757707"},"language":"en","primary_location":{"id":"doi:10.1137/0209017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209017","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5023997792","display_name":"D. T. Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"D. T. Lee","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078680760","display_name":"Chris K.C. Wong","orcid":"https://orcid.org/0000-0001-5449-5836"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. K. Wong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023997792"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.961,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.959285,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"1","first_page":"200","last_page":"211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9979000091552734,"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.6087110638618469},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5688406229019165},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.553739070892334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5144262909889221},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4916241765022278},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.48043227195739746},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4760291874408722},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43145012855529785},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42778512835502625},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35464584827423096},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3050774931907654},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08428910374641418}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6087110638618469},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5688406229019165},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.553739070892334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5144262909889221},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4916241765022278},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.48043227195739746},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4760291874408722},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43145012855529785},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42778512835502625},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35464584827423096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3050774931907654},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08428910374641418},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0209017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209017","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1511255594","https://openalex.org/W1655990431","https://openalex.org/W1968714250","https://openalex.org/W1973942323","https://openalex.org/W1990301739","https://openalex.org/W1996431814","https://openalex.org/W2007610503","https://openalex.org/W2012014032","https://openalex.org/W2020112047","https://openalex.org/W2031226847","https://openalex.org/W2168570149","https://openalex.org/W2401610261","https://openalex.org/W2752853835","https://openalex.org/W2956015669"],"related_works":["https://openalex.org/W2021751389","https://openalex.org/W2771332986","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857"],"abstract_inverted_index":{"In":[0],"this":[1,108,230],"paper":[2,109],"we":[3],"study":[4],"the":[5,9,38,47,50,53,58,79,117,125,133,139,147,151,169,185,198,216,250,265,268,271,292,296,303,311,322,327,336],"problem":[6,149],"of":[7,17,31,41,52,57,65,127,141,209,221,270,281],"scheduling":[8,74],"read/write":[10,59],"head":[11],"movement":[12],"to":[13,46,77,86,166,183,258,288],"handle":[14],"a":[15,21,42,88,93,98,113,128,142,156,194,219,225,235,244,279,333],"batch":[16],"$nI/O$":[18],"requests":[19],"in":[20,26,36,63,97,107,135,150,171,175,201,224,291,325],"2-dimensional":[22],"secondary":[23],"storage":[24,32],"device":[25],"minimum":[27,245,304],"time.":[28],"Two":[29],"models":[30],"systems":[33],"are":[34,256,318],"assumed":[35],"which":[37,263,326],"access":[39],"time":[40,130,144,210,262,266,334],"record":[43,54],"(being":[44],"proportional":[45],"\u201cdistance\u201d":[48],"between":[49,116],"position":[51],"and":[55,68,120,161,273],"that":[56,110,168,302],"head)":[60],"is":[61,84,164,179,187,191,227,264,285,308,329],"measured":[62],"terms":[64],"$L_1":[66,118,172,202],"$":[67,70,119,122,173,203],"$L_\\infty":[69,121,176],"metrics,":[71],"respectively.":[72],"The":[73,283],"problem,":[75],"referred":[76],"as":[78],"Open":[80],"Path":[81],"Problem":[82],"(OPP),":[83],"equivalent":[85],"finding":[87],"shortest":[89],"Hamiltonian":[90],"path":[91,237],"with":[92,101],"specified":[94],"end":[95],"point":[96,240],"complete":[99],"graph":[100],"n":[102,222],"vertices.":[103],"We":[104],"first":[105],"show":[106,167,301],"there":[111],"exists":[112],"natural":[114],"isometry":[115],"metrics.":[123],"Consequently,":[124],"existence":[126,140],"polynomial":[129,143],"algorithm":[131,145,208],"for":[132,146,214,218,267],"OPP":[134,170,186],"one":[136,232,324,331],"metric":[137,178],"implies":[138],"same":[148],"other":[152],"metric.":[153,204],"Based":[154],"on":[155,193,335],"result":[157],"by":[158,242,249],"Garey,":[159],"Graham":[160],"Johnson,":[162],"it":[163],"easy":[165],"(hence":[174],"$)":[177],"$NP$-complete.":[180],"A":[181],"heuristic":[182],"solve":[184],"therefore":[188],"presented.":[189],"It":[190],"based":[192],"geometric":[195],"structure":[196],"called":[197],"Voronoi":[199],"diagram":[200,217,231,272],"An":[205],"optimal":[206],"(worst-case)":[207],"complexity":[211],"$O(n\\log":[212,260],"n)$":[213,261],"constructing":[215,243],"set":[220],"points":[223],"plane":[226],"described.":[228],"Using":[229],"can":[233],"build":[234],"near-optimal":[236],"through":[238],"each":[239],"either":[241],"spanning":[246,305],"tree":[247,306],"or":[248],"closest":[251,312],"insertion":[252,313],"method.":[253,314],"Both":[254],"algorithms":[255],"shown":[257,287],"take":[259],"construction":[269],"yield":[274],"an":[275],"approximate":[276],"solution":[277],"within":[278],"factor":[280],"2.":[282],"bound":[284],"also":[286],"be":[289],"tight":[290],"worse":[293],"case.":[294],"For":[295],"average":[297],"case,":[298],"simulation":[299],"results":[300],"approach":[307],"better":[309,320],"than":[310,321],"As":[315],"expected,":[316],"they":[317],"far":[319],"sequential":[323],"request":[328],"processed":[330],"at":[332],"first-come\u2013first-served":[337],"basis.":[338]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}