{"id":"https://openalex.org/W2070324861","doi":"https://doi.org/10.1080/2151237x.2009.10129281","title":"A Hierarchical Hashing Scheme for Nearest Neighbor Search and Broad-Phase Collision Detection","display_name":"A Hierarchical Hashing Scheme for Nearest Neighbor Search and Broad-Phase Collision Detection","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2070324861","doi":"https://doi.org/10.1080/2151237x.2009.10129281","mag":"2070324861"},"language":"en","primary_location":{"id":"doi:10.1080/2151237x.2009.10129281","is_oa":false,"landing_page_url":"https://doi.org/10.1080/2151237x.2009.10129281","pdf_url":null,"source":{"id":"https://openalex.org/S4210194830","display_name":"Journal of Graphics GPU and Game Tools","issn_l":"2151-2272","issn":["2151-2272","2151-237X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graphics, GPU, and Game Tools","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/A5008944814","display_name":"Mickael Pouchol","orcid":null},"institutions":[{"id":"https://openalex.org/I4210093397","display_name":"XLIM","ror":"https://ror.org/00f7srh09","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I32881790","https://openalex.org/I4210093397","https://openalex.org/I4210095849","https://openalex.org/I65806277"]},{"id":"https://openalex.org/I65806277","display_name":"Universit\u00e9 de Limoges","ror":"https://ror.org/02cp04407","country_code":"FR","type":"education","lineage":["https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mickael Pouchol","raw_affiliation_strings":["XLIM Research Institute, University of Limoges"],"affiliations":[{"raw_affiliation_string":"XLIM Research Institute, University of Limoges","institution_ids":["https://openalex.org/I4210093397","https://openalex.org/I65806277"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070694254","display_name":"Alexandre Ahmad","orcid":null},"institutions":[{"id":"https://openalex.org/I65806277","display_name":"Universit\u00e9 de Limoges","ror":"https://ror.org/02cp04407","country_code":"FR","type":"education","lineage":["https://openalex.org/I65806277"]},{"id":"https://openalex.org/I4210093397","display_name":"XLIM","ror":"https://ror.org/00f7srh09","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I32881790","https://openalex.org/I4210093397","https://openalex.org/I4210095849","https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alexandre Ahmad","raw_affiliation_strings":["XLIM Research Institute, University of Limoges"],"affiliations":[{"raw_affiliation_string":"XLIM Research Institute, University of Limoges","institution_ids":["https://openalex.org/I4210093397","https://openalex.org/I65806277"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027030525","display_name":"Beno\u00eet Crespin","orcid":"https://orcid.org/0000-0002-9105-0243"},"institutions":[{"id":"https://openalex.org/I4210093397","display_name":"XLIM","ror":"https://ror.org/00f7srh09","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I32881790","https://openalex.org/I4210093397","https://openalex.org/I4210095849","https://openalex.org/I65806277"]},{"id":"https://openalex.org/I65806277","display_name":"Universit\u00e9 de Limoges","ror":"https://ror.org/02cp04407","country_code":"FR","type":"education","lineage":["https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Benoit Crespin","raw_affiliation_strings":["XLIM Research Institute, University of Limoges"],"affiliations":[{"raw_affiliation_string":"XLIM Research Institute, University of Limoges","institution_ids":["https://openalex.org/I4210093397","https://openalex.org/I65806277"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011348641","display_name":"Olivier Terraz","orcid":null},"institutions":[{"id":"https://openalex.org/I65806277","display_name":"Universit\u00e9 de Limoges","ror":"https://ror.org/02cp04407","country_code":"FR","type":"education","lineage":["https://openalex.org/I65806277"]},{"id":"https://openalex.org/I4210093397","display_name":"XLIM","ror":"https://ror.org/00f7srh09","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I32881790","https://openalex.org/I4210093397","https://openalex.org/I4210095849","https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Olivier Terraz","raw_affiliation_strings":["XLIM Research Institute, University of Limoges"],"affiliations":[{"raw_affiliation_string":"XLIM Research Institute, University of Limoges","institution_ids":["https://openalex.org/I4210093397","https://openalex.org/I65806277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008944814"],"corresponding_institution_ids":["https://openalex.org/I4210093397","https://openalex.org/I65806277"],"apc_list":null,"apc_paid":null,"fwci":1.2858,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84535637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"2","first_page":"45","last_page":"59"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9955999851226807,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9955999851226807,"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/T11106","display_name":"Data Management and Algorithms","score":0.9722999930381775,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9686999917030334,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.6578355431556702},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.6448141932487488},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.6445856690406799},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.6089181900024414},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5761640071868896},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.5198003053665161},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5038236975669861},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.49401217699050903},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.4859427213668823},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.44823402166366577},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.419908344745636},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4167516827583313},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.41350191831588745},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3865915536880493},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3447430729866028},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.1908273696899414},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18199607729911804},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16559168696403503},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.1635136604309082},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12695005536079407},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09376287460327148},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.08275222778320312}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6578355431556702},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6448141932487488},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.6445856690406799},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.6089181900024414},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5761640071868896},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.5198003053665161},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5038236975669861},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.49401217699050903},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.4859427213668823},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.44823402166366577},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.419908344745636},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4167516827583313},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.41350191831588745},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3865915536880493},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3447430729866028},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.1908273696899414},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18199607729911804},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16559168696403503},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.1635136604309082},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12695005536079407},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09376287460327148},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.08275222778320312},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/2151237x.2009.10129281","is_oa":false,"landing_page_url":"https://doi.org/10.1080/2151237x.2009.10129281","pdf_url":null,"source":{"id":"https://openalex.org/S4210194830","display_name":"Journal of Graphics GPU and Game Tools","issn_l":"2151-2272","issn":["2151-2272","2151-237X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graphics, GPU, and Game Tools","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2811247857","https://openalex.org/W2136399778","https://openalex.org/W102859714","https://openalex.org/W4298343607","https://openalex.org/W2334522381","https://openalex.org/W2040748620","https://openalex.org/W2951881567","https://openalex.org/W2084899141","https://openalex.org/W2149143947","https://openalex.org/W1994360333"],"abstract_inverted_index":{"Increasing":[0],"computational":[1],"power":[2],"allows":[3],"computer":[4],"graphics":[5],"researchers":[6],"to":[7,48,71],"model":[8,47],"spectacular":[9],"phenomena":[10],"such":[11,88],"as":[12,89],"fluids":[13],"and":[14,20,26,33,55,79],"their":[15],"interactions":[16],"with":[17],"deformable":[18],"objects":[19],"structures.":[21],"Particle-based":[22],"(or":[23],"Lagrangian)":[24],"fluid":[25],"solid":[27],"simulations":[28],"are":[29],"commonly":[30],"managed":[31],"separately":[32],"mixed":[34],"together":[35],"for":[36,51],"the":[37],"collision":[38,57],"detection":[39],"phase.":[40],"We":[41],"present":[42],"a":[43,61],"unified":[44],"dynamic":[45],"acceleration":[46,86],"be":[49],"used":[50],"particle":[52],"neighborhood":[53],"queries":[54],"broad-phase":[56],"detection,":[58],"based":[59],"on":[60],"hierarchical":[62],"hash":[63],"table":[64],"data":[65],"structure.":[66],"Our":[67],"method":[68],"is":[69],"able":[70],"significantly":[72],"reduce":[73],"computations":[74],"in":[75,95],"large,":[76],"empty":[77],"areas,":[78],"thus":[80],"gives":[81],"better":[82],"results":[83],"than":[84],"existing":[85],"techniques,":[87],"multilevel":[90],"hashing":[91],"schemes":[92],"or":[93],"KD-trees,":[94],"most":[96],"situations.":[97]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}