{"id":"https://openalex.org/W6926358327","doi":"https://doi.org/10.2312/cgvc.20191258","title":"Fast and Efficient Nearest Neighbor Search for Particle Simulations","display_name":"Fast and Efficient Nearest Neighbor Search for Particle Simulations","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W6926358327","doi":"https://doi.org/10.2312/cgvc.20191258"},"language":"en","primary_location":{"id":"doi:10.2312/cgvc.20191258","is_oa":true,"landing_page_url":"https://doi.org/10.2312/cgvc.20191258","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/cgvc.20191258","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Gross, Julian","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gross, Julian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"K\u00f6ster, Marcel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K\u00f6ster, Marcel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Kr\u00fcger, Antonio","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kr\u00fcger, Antonio","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0852,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50088526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11879","display_name":"Protist diversity and phylogeny","score":0.15520000457763672,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T11879","display_name":"Protist diversity and phylogeny","score":0.15520000457763672,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11340","display_name":"Marine Sponges and Natural Products","score":0.0681999996304512,"subfield":{"id":"https://openalex.org/subfields/1305","display_name":"Biotechnology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12215","display_name":"Phytochemical Studies and Bioactivities","score":0.06340000033378601,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6144999861717224},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.503000020980835},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.45489999651908875},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4471000134944916},{"id":"https://openalex.org/keywords/particle","display_name":"Particle (ecology)","score":0.39010000228881836},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.38510000705718994},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.3508000075817108},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.32679998874664307}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7114999890327454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6182000041007996},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6144999861717224},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.503000020980835},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.45489999651908875},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4471000134944916},{"id":"https://openalex.org/C2778517922","wikidata":"https://www.wikidata.org/wiki/Q7140482","display_name":"Particle (ecology)","level":2,"score":0.39010000228881836},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.38510000705718994},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.3508000075817108},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.3379000127315521},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.32679998874664307},{"id":"https://openalex.org/C77660652","wikidata":"https://www.wikidata.org/wiki/Q150971","display_name":"Computer graphics","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.31130000948905945},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.2777000069618225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2768000066280365},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/cgvc.20191258","is_oa":true,"landing_page_url":"https://doi.org/10.2312/cgvc.20191258","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.2312/cgvc.20191258","is_oa":true,"landing_page_url":"https://doi.org/10.2312/cgvc.20191258","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"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":{"One":[0],"of":[1,16,91],"the":[2,9,54],"fundamental":[3],"algorithms":[4,62],"in":[5,32,53,89],"particle":[6,85],"simulations":[7,25],"is":[8],"identification":[10],"and":[11,29,60,65],"iteration":[12],"over":[13],"nearest":[14,40],"neighbors":[15,41],"every":[17,33],"particle.":[18],"Well-known":[19],"examples":[20],"are":[21],"SPH":[22],"or":[23,47,94],"PBD":[24],"that":[26,102,110,129],"compute":[27],"forces":[28],"particle-position":[30],"updates":[31],"simulation":[34,86,108],"step.":[35],"In":[36],"order":[37],"to":[38,70,106],"find":[39],"for":[42],"all":[43],"particles,":[44],"hash-based,":[45],"grid-based":[46],"tree-based":[48],"approaches":[49],"have":[50,81],"been":[51],"developed":[52],"past.":[55],"The":[56],"two":[57],"most":[58],"prominent":[59],"fastest":[61],"use":[63],"virtual":[64],"explicitly":[66],"allocated":[67],"uniform":[68],"grids":[69],"achieve":[71,123],"high":[72],"performance":[73],"on":[74,125],"Graphics":[75],"Processing":[76],"Units":[77],"(GPUs).":[78],"However,":[79],"they":[80],"disadvantages":[82],"with":[83],"numerous":[84],"domains,":[87],"either":[88],"terms":[90],"run":[92],"time":[93],"memory":[95,113],"consumption.":[96],"We":[97],"present":[98],"a":[99,116],"novel":[100],"algorithm":[101],"can":[103],"be":[104],"applied":[105],"large":[107],"domains":[109],"significantly":[111],"reduces":[112],"consumption":[114],"using":[115],"shared-memory":[117],"based":[118],"neighbor":[119],"search.":[120],"Furthermore,":[121],"we":[122],"high-performance":[124],"our":[126],"evaluation":[127],"scenarios":[128],"often":[130],"outperforms":[131],"existing":[132],"state-of-the-art":[133],"methods.":[134]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}