research-article

A hash table construction algorithm for spatial hashing based on linear memory

Authors:

Cesar Tadeu Pozzer,

Cícero A. de Lara Pahins,

Ilona HeldalAuthors Info & Claims

ACE '14: Proceedings of the 11th Conference on Advances in Computer Entertainment Technology

Article No.: 35, Pages 1 - 4

https://doi.org/10.1145/2663806.2663862

Published: 11 November 2014 Publication History

Get Access

Abstract

Spatial hashing is an efficient technique to speed up proximity queries on moving objects in the space domain, suitable for computer entertainment applications and simulations. This paper presents an efficient three-step algorithm for building a 1D hash table for spatial hashing needed to perform fast queries on objects for location and proximity detection. In contrast to existing solutions, this algorithm uses fixed-size vectors and pivots instead of dynamic data structures to deal with collisions in the hash table. This also enables iterating through entities and performing proximity queries in a linear memory. Experiments conducted shows that the proposed algorithm is, on average, at least 3 times faster than existing solutions based on dynamic data structures. This contributes to realizing interactive frame rates with massive number of moving entities.

References

[1]

Buckland, M. Programming Game AI by Example, 1 ed. Wordware game developer's library. 2005.

Google Scholar

[2]

Chiara, R. D., Erra, U., Scarano, V., and Tatafiore, M. Massive simulation using gpu of a distributed behavioral model of a flock with obstacle avoidance. In Proceedings of the International Workshop on Vision, Modeling, and Visualization (VMV) (2004), 233--240.

Google Scholar

[3]

Hastings, E. J., Mesit, J., and Guha, R. K. Optimization of large-scale, real-time simulations by spatial hashing. In Proceedings of the Summer Computer Simulation Conference, vol. 37 (2005), 9--17.

Google Scholar

[4]

Koutsiamanis, R.-A., and Efraimidis, P. S. An exact and o(1) time heaviest and lightest hitters algorithm for sliding-window data streams. In Proceedings of the Fifth FTRA International Conference on Multimedia and Ubiquitous Engineering (2011), 89--94.

Digital Library

Google Scholar

[5]

Lefebvre, S., and Hoppe, H. Perfect spatial hashing. In ACM SIGGRAPH (2006), 579--588.

Digital Library

Google Scholar

[6]

Passos, E. B., Joselli, M., Zamith, M., Clua, E. W. G., Montenegro, A., Conci, A., and Feijo, B. A bidimensional data structure and spatial optimization for supermassive crowd simulation on gpu. Computer Entertainment 7, 4 (2010), 1--15.

Digital Library

Google Scholar

[7]

Reynolds, C. W. Interaction with groups of autonomous characters. In Proceedings of Game Developers Conference, CMP Game Media Group (2000), 449--460.

Google Scholar

Cited By

View all

Mishra RGodhaneeya SSoni A(2024)Minimizing Intra-Interference in LoRaWAN for Seamless Connectivity in Ubiquitous Networking2024 16th International Conference on COMmunication Systems & NETworkS (COMSNETS)10.1109/COMSNETS59351.2024.10427471(123-128)Online publication date: 3-Jan-2024
https://doi.org/10.1109/COMSNETS59351.2024.10427471
Berwaldt NBettker RPozzer C(2020)Procedural Generation of Favela Layouts on Arbitrary Terrains2020 19th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)10.1109/SBGames51465.2020.00027(136-144)Online publication date: Nov-2020
https://doi.org/10.1109/SBGames51465.2020.00027
Torres do Nascimento BTadeu Pozzer CPaulus Franzin F(2019)Procedural Editing of Virtual Terrains Using 3D Bézier Curves2019 18th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)10.1109/SBGames.2019.00027(135-143)Online publication date: Oct-2019
https://doi.org/10.1109/SBGames.2019.00027
Show More Cited By

Index Terms

A hash table construction algorithm for spatial hashing based on linear memory
1. Information systems
  1. Information storage systems
    1. Record storage systems
      1. Record storage alternatives

Recommendations

Performance comparison of extendible hashing and linear hashing techniques

Based on seven assumptions, the following comparison factors are used to compare the performance of linear hashing with extendible hashing: 1. storage utilization; 2. average unsuccessful search cost; 3. average successful search cost; 4. split cost; 5. ...
Indexing internal memory with minimal perfect hash functions
SBBD '08: Proceedings of the 23rd Brazilian symposium on Databases

A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each key can be retrieved from the table with a single probe. A minimal perfect ...
Performance comparison of extendible hashing and linear hashing techniques
SIGSMALL '90: Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems

Based on seven assumptions, the following comparison factors are used to compare the performance of linear hashing with extendible hashing: 1. storage utilization; 2. average unsuccessful search cost; 3. average successful search cost; 4. split cost; 5. ...

Comments

Information & Contributors

Information

Published In

ACE '14: Proceedings of the 11th Conference on Advances in Computer Entertainment Technology

November 2014

422 pages

ISBN:9781450329453

DOI:10.1145/2663806

General Chair:
Yoram Chisik
University of Madeira, Portugal
,
Program Chairs:
Christian Geiger
FH Düsseldorf, Germany
,
Shoichi Hasegawa
Tokyo Institute of Technology, Japan

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 November 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

CAPES-Brazil

Conference

ACE '14

ACE '14: 11th ADVANCES IN COMPUTER ENTERTAINMENT TECHNOLOGY CONFERENCE

November 11 - 14, 2014

Funchal, Portugal

Acceptance Rates

ACE '14 Paper Acceptance Rate 36 of 90 submissions, 40%;

Overall Acceptance Rate 36 of 90 submissions, 40%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
258
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mishra RGodhaneeya SSoni A(2024)Minimizing Intra-Interference in LoRaWAN for Seamless Connectivity in Ubiquitous Networking2024 16th International Conference on COMmunication Systems & NETworkS (COMSNETS)10.1109/COMSNETS59351.2024.10427471(123-128)Online publication date: 3-Jan-2024
https://doi.org/10.1109/COMSNETS59351.2024.10427471
Berwaldt NBettker RPozzer C(2020)Procedural Generation of Favela Layouts on Arbitrary Terrains2020 19th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)10.1109/SBGames51465.2020.00027(136-144)Online publication date: Nov-2020
https://doi.org/10.1109/SBGames51465.2020.00027
Torres do Nascimento BTadeu Pozzer CPaulus Franzin F(2019)Procedural Editing of Virtual Terrains Using 3D Bézier Curves2019 18th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)10.1109/SBGames.2019.00027(135-143)Online publication date: Oct-2019
https://doi.org/10.1109/SBGames.2019.00027
Frasson AEngel TPozzer CMcGuire MNowrouzezahari D(2018)Efficient screen-space rendering of vector features on virtual terrainsProceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games10.1145/3190834.3190851(1-10)Online publication date: 15-May-2018
https://dl.acm.org/doi/10.1145/3190834.3190851
do Nascimento BFranzin FPozzer C(2018)GPU-Based Real-Time Procedural Distribution of Vegetation on Large-Scale Virtual Terrains2018 17th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)10.1109/SBGAMES.2018.00027(157-15709)Online publication date: Oct-2018
https://doi.org/10.1109/SBGAMES.2018.00027
Menezes VPozzer C(2018)Development of an Autonomous Vehicle Controller for Simulation Environments2018 17th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)10.1109/SBGAMES.2018.00018(75-755)Online publication date: Oct-2018
https://doi.org/10.1109/SBGAMES.2018.00018
Buckley LByrne JMoloney D(2018)Investigating the Impact of Suboptimal Hashing Functions2018 IEEE Games, Entertainment, Media Conference (GEM)10.1109/GEM.2018.8516265(324-331)Online publication date: Aug-2018
https://doi.org/10.1109/GEM.2018.8516265
Burger MNguyen GBischof C(2017)Extending Perfect Spatial Hashing to Index Tuple-based Graphs Representing Super Carbon NanotubesProcedia Computer Science10.1016/j.procs.2017.05.136108(435-444)Online publication date: 2017
https://doi.org/10.1016/j.procs.2017.05.136

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Performance comparison of extendible hashing and linear hashing techniques

Indexing internal memory with minimal perfect hash functions

Performance comparison of extendible hashing and linear hashing techniques