{"id":"https://openalex.org/W116289743","doi":null,"title":"Efficient parallel algorithms for closet point problems","display_name":"Efficient parallel algorithms for closet point problems","publication_year":1994,"publication_date":"1994-12-15","ids":{"openalex":"https://openalex.org/W116289743","mag":"116289743"},"language":"en","primary_location":{"id":"mag:116289743","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=222009","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},"volume":null,"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/A5056885138","display_name":"Peter Su","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Peter Su","raw_affiliation_strings":["Dartmouth College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dartmouth College","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056885138"],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":null,"apc_paid":null,"fwci":1.1684,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78464419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.6830999851226807,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.6830999851226807,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.22269999980926514,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.025100000202655792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.8679999709129333},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi tessellation","score":0.9319999814033508},{"id":"https://openalex.org/keywords/spatial-locality","display_name":"spatial locality","score":0.925000011920929},{"id":"https://openalex.org/keywords/random-sampling","display_name":"random sampling","score":0.9660000205039978},{"id":"https://openalex.org/keywords/spatial-decomposition","display_name":"spatial decomposition","score":0.9779999852180481},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.7120000123977661},{"id":"https://openalex.org/keywords/algorithm-visualization","display_name":"algorithm visualization","score":0.8379999995231628},{"id":"https://openalex.org/keywords/performance-simulation","display_name":"performance simulation","score":0.6480000019073486},{"id":"https://openalex.org/keywords/parallel-programming-models","display_name":"parallel programming models","score":0.5730000138282776},{"id":"https://openalex.org/keywords/geometric-algorithms","display_name":"geometric algorithms","score":0.515999972820282}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7716847658157349},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5109536051750183},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4545920491218567},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4163488447666168}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:116289743","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=222009","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}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W71000211","https://openalex.org/W1768380245","https://openalex.org/W2499563566","https://openalex.org/W1568987073","https://openalex.org/W1600195236","https://openalex.org/W2132422928","https://openalex.org/W2032034748","https://openalex.org/W2337491052","https://openalex.org/W2080228175","https://openalex.org/W2024766881"],"abstract_inverted_index":{"This":[0],"dissertation":[1],"develops":[2],"and":[3,27,54,60,66,79,110,145,176,185,201,249,290,306,317],"studies":[4],"fast":[5,73],"algorithms":[6,46,75,88,159,184,197],"for":[7,13,47,64,76,160,272],"solving":[8],"closest":[9],"point":[10],"problems.":[11],"Algorithms":[12],"such":[14],"problems":[15,49],"have":[16],"applications":[17],"in":[18,126,157,171,236,309],"many":[19,117,150,257],"areas":[20,128],"including":[21],"statistical":[22],"classification,":[23],"crystallography,":[24],"data":[25,132],"compression,":[26],"finite":[28],"element":[29],"analysis.":[30],"In":[31,217],"addition":[32],"to":[33,120,140,146,182,205,231,269],"a":[34,58,94,130,137,161,214,240],"comprehensive":[35],"empirical":[36],"study":[37],"of":[38,97,123,129,164,196,225,239,246,275,282,299,314,331],"known":[39],"sequential":[40],"methods,":[41],"I":[42,56,71,84,104,178,191,219],"introduce":[43],"new":[44],"parallel":[45,68,74],"these":[48,154],"that":[50,86,103,229],"are":[51,106,174,261,267,312],"both":[52],"efficient":[53],"practical.":[55],"present":[57],"simple":[59,138],"flexible":[61],"programming":[62],"model":[63,192],"designing":[65],"analyzing":[67],"algorithms.":[69],"Also,":[70],"describe":[72],"nearest-neighbor":[77],"searching":[78],"constructing":[80],"Voronoi":[81],"diagrams.":[82],"Finally,":[83],"demonstrate":[85],"my":[87,172],"actually":[89],"obtain":[90],"good":[91],"performance":[92,195],"on":[93,213],"wide":[95,162],"variety":[96],"machine":[98],"architectures.\r\nThe":[99],"key":[100,167],"algorithmic":[101],"ideas":[102,169],"examine":[105],"exploiting":[107],"spatial":[108],"locality,":[109],"random":[111],"sampling.":[112],"Spatial":[113],"decomposition":[114],"provides":[115,136],"allows":[116],"concurrent":[118],"threads":[119],"work":[121,277],"independently":[122],"one":[124],"another":[125],"local":[127],"shared":[131],"structure.":[133],"Random":[134],"sampling":[135],"way":[139],"adaptively":[141],"decompose":[142],"irregular":[143],"problems,":[144],"balance":[147],"workload":[148],"among":[149],"threads.":[151],"Used":[152],"together,":[153],"techniques":[155],"result":[156],"effective":[158],"range":[163],"geometric":[165],"problems.\r\nThe":[166],"experimental":[168],"used":[170,268],"thesis":[173],"simulation":[175,199,250],"animation.":[177],"use":[179],"algorithm":[180],"animation":[181],"validate":[183],"gain":[186],"intuition":[187],"about":[188],"their":[189],"behavior.":[190],"the":[193,223,237,252,280,315,324,332,340],"expected":[194],"using":[198],"experiments,":[200],"some":[202],"knowledge":[203],"as":[204,256,259,322],"how":[206],"much":[207],"critical":[208],"primitive":[209],"operations":[210],"will":[211],"cost":[212],"given":[215],"machine.":[216],"addition,":[218],"do":[220],"this":[221,276,310],"without":[222],"burden":[224],"esoteric":[226],"computational":[227],"models":[228],"attempt":[230],"cover":[232],"every":[233],"possible":[234,260],"variable":[235],"design":[238],"computer":[241],"system.":[242],"An":[243],"iterative":[244],"process":[245],"design,":[247],"validation,":[248],"delays":[251],"actual":[253],"implementation":[254],"until":[255],"details":[258],"accounted":[262],"for.":[263],"Then,":[264],"further":[265],"experiments":[266],"tune":[270],"implementations":[271],"better":[273],"performance.\r\nPart":[274],"was":[278,291],"at":[279],"Department":[281],"Computer":[283],"Science,":[284],"Duke":[285],"University,":[286],"Durham,":[287],"NC":[288],"27708-0129":[289],"supported":[292],"by":[293],"ARPA/ISTO":[294,300],"Grant":[295],"N00014-91-J-1985,":[296],"Subcontract":[297],"KI-92-01-0182":[298],"prime":[301],"Contract":[302],"N00014-92-C-0182.":[303],"The":[304],"views":[305],"conclusions":[307],"contained":[308],"document":[311],"those":[313],"author":[316],"should":[318],"not":[319],"be":[320],"interpreted":[321],"representing":[323],"official":[325],"policies,":[326],"either":[327],"expressed":[328],"or":[329,339],"implied":[330],"Advanced":[333],"Research":[334],"Projects":[335],"Agency,":[336],"NSF,":[337],"ONR":[338],"U.S.":[341],"government.":[342]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}