{"id":"https://openalex.org/W65230299","doi":null,"title":"Constructing higher-order Voronoi diagrams in parallel.","display_name":"Constructing higher-order Voronoi diagrams in parallel.","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W65230299","mag":"65230299"},"language":"en","primary_location":{"id":"mag:65230299","doi":null,"is_oa":false,"landing_page_url":"https://www.eurocg.org/www.win.tue.nl/EWCG2005/Proceedings/32.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W65230299"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X","observed_orcids":["https://orcid.org/0000-0002-7769-726X"]},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":["Paderborn University:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Paderborn University:","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020196859"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"123","last_page":"126"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9878000020980835,"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.9878000020980835,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.004399999976158142,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.0017999999690800905,"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/higher-order-voronoi-diagrams","display_name":"higher-order Voronoi diagrams","score":0.9929999709129333},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9580000042915344},{"id":"https://openalex.org/keywords/pram","display_name":"PRAM","score":0.7300000190734863},{"id":"https://openalex.org/keywords/coarse-grained-multicomputers","display_name":"coarse-grained multicomputers","score":0.7540000081062317},{"id":"https://openalex.org/keywords/k-nearest-neighbor-search","display_name":"k-nearest neighbor search","score":0.9599999785423279},{"id":"https://openalex.org/keywords/planar-point-sets","display_name":"planar point sets","score":0.7599999904632568},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"computational geometry","score":0.550000011920929}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.9649523496627808},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5646640062332153},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5486401915550232},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5275059938430786},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.5021047592163086},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.49858713150024414},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.494853675365448},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46243274211883545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45101386308670044},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4505791664123535},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43404683470726013},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.43381163477897644},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4114048182964325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2929217219352722},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.214284747838974},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.1462932825088501},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:65230299","doi":null,"is_oa":false,"landing_page_url":"https://www.eurocg.org/www.win.tue.nl/EWCG2005/Proceedings/32.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.3397","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.3397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/EWCG2005/Proceedings/32.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1594512604","https://openalex.org/W1967005434","https://openalex.org/W1989130580","https://openalex.org/W2005314985","https://openalex.org/W2005426411","https://openalex.org/W2022266599","https://openalex.org/W2027637765","https://openalex.org/W2033139834","https://openalex.org/W2037855401","https://openalex.org/W2039849774","https://openalex.org/W2041385708","https://openalex.org/W2049628988","https://openalex.org/W2074863496","https://openalex.org/W2093250716","https://openalex.org/W2109067131","https://openalex.org/W2142278387","https://openalex.org/W2160775966","https://openalex.org/W2162918363"],"related_works":["https://openalex.org/W1483827569","https://openalex.org/W2039849774","https://openalex.org/W1868863306","https://openalex.org/W2470741436","https://openalex.org/W1998068155","https://openalex.org/W2361416002","https://openalex.org/W4390591044","https://openalex.org/W1536913299","https://openalex.org/W2109067131","https://openalex.org/W2604307098"],"abstract_inverted_index":{"We":[0],"use":[1],"Lee\u2019s":[2],"sequential":[3,142,185],"algorithm":[4,11,24,61],"[17]":[5],"to":[6],"create":[7],"the":[8,14,33,37,72,76,126,151,165,184,189],"first":[9],"parallel":[10,31,48],"which":[12,50,178],"constructs":[13],"order-k":[15],"Voronoi":[16,78,118,148,174],"diagram":[17,79,119,128],"of":[18,125,129,153,183],"a":[19,47,69,99,130],"planar":[20,131],"point":[21,132],"set.":[22],"The":[23,59,161],"is":[25,134,179],"developed":[26,187],"and":[27,36,65,82,94,155,158,171],"analyzed":[28],"within":[29],"two":[30],"models,":[32],"fine-grained":[34,60],"PRAM":[35],"coarse-grained":[38,73],"CGM.":[39],"Its":[40],"applications":[41,55],"include":[42,150],"k-nearest":[43],"neighbor":[44],"searches":[45],"in":[46,56,136,169,181],"context,":[49],"are":[51],"important":[52],"for":[53,144,188],"many":[54],"computational":[57],"geometry.":[58],"requires":[62,75],"O(klog2n)":[63],"time":[64,93],"O(k2nlogn)":[66],"work":[67],"on":[68,98,141],"CREW-PRAM,":[70],"whereas":[71],"version":[74],"ordinary":[77,117],"as":[80],"input":[81],"then":[83],"takes":[84],"O":[85,102],"(":[86,103],"k2":[87,104],"(n\u2212k)":[88,105],"log":[89],"n":[90],"p)":[91,106],"running":[92],"O(k)":[95],"communication":[96],"rounds":[97],"CGM":[100],"with":[101],"local":[107],"memory":[108],"per":[109],"processor.":[110],"same":[111],"k":[112],"nearest":[113],"neighbors":[114],"(thus,":[115],"an":[116,176],"has":[120],"order":[121,147,173],"one).":[122],"An":[123],"example":[124],"order-2":[127],"set":[133],"depicted":[135],"figure":[137],"1.":[138],"Previous":[139],"works":[140],"algorithms":[143,186],"constructing":[145],"higher":[146,172],"diagrams":[149],"books":[152],"Preparata":[154],"Shamos":[156],"[18]":[157],"Edelsbrunner":[159],"[13].":[160],"latter":[162],"points":[163],"out":[164],"duality":[166],"between":[167],"k-levels":[168],"arrangements":[170],"diagrams,":[175],"idea":[177],"used":[180],"some":[182],"posed":[190],"problem":[191],"by":[192]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W65230299","counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
