Skip to main content
Game Development

Questions tagged [spatial-partitioning]

Ask Question

Spatial partitioning refers to dividing up some space (such as the game world) into regions with the intent to efficiently search or traverse those regions or the objects within those regions.

22 questions
Newest Active Bountied Unanswered
Filter by
Sorted by
Tagged with
1 vote
1 answer
190 views

I have a spatial hashing grid that's mapped out like ...
Pen's user avatar
  • 13
0 votes
0 answers
70 views

The Goal I'm working on a vr gesture recognition system. Normally these systems are dependent on "drawn" gestures, but I want something that compares position, rotation, velocity, angular ...
Pen's user avatar
  • 13
0 votes
2 answers
120 views

I am creating a client/server that is 2D and based on a map. Characters on the server are then separated into a spatial hash. I am using this to determine who to send data to, essentially, people in ...
Charlie's user avatar
  • 101
1 vote
2 answers
144 views

I am working on a city building game where all buildings are axis aligned rectangles. Currently I am using spatial hashing to detect if the insertion of a building intersects a building in the board. ...
nico.user's user avatar
  • 111
0 votes
0 answers
367 views

I was reading Robert Nystrom's Game Programming Patterns website and, in the section about spatial partitioning, particularly in the section on quadtrees, he mentions: Objects can be added ...
Carmo's user avatar
  • 157
0 votes
0 answers
97 views

In my recent project, I am getting an object file via a request to REST API and found that the OBJs (object file) are in Gauss-Kruger System. I want to know that how exactly I place the model as I ...
Muhammad Faizan Khan's user avatar
  • 2,074
1 vote
2 answers
2k views

I'm developing a 2D ant simulation in JavaScript. I'd like to implement a quadtree to store the positions of ants and other markers. I approximate all of these entities as circles, and I'm only ...
Aaron Eads's user avatar
  • 19
1 vote
1 answer
2k views

I am using an octree to define my 3D voxel world. And I want to use octree subdivision as a LoD system. This means, subdivide close to the player, but far away nodes un-subdivided. But it occurs to me ...
Bram's user avatar
  • 3,744
1 vote
0 answers
190 views

I've recently started looking into BSPs for real-time collision detection, and I'm now looking into improving the performance of my solution. The system that I've implemented is rather similar to the ...
Lolslayer's user avatar
  • 11
0 votes
0 answers
290 views

I simply want to implement some sort of grid where I can sort units in an RTS into cells, and then for each unit check to avoid other units and attack other units, in 2d. My map grid is currently 10 ...
Tree3708's user avatar
  • 31
0 votes
0 answers
830 views

I'm trying to use spatial hashing to speed up collision detection in my game. I believe spatial hashing is better suited for my game than quadtrees, because I have lots of fast-moving objects in my ...
makinGames's user avatar
  • 21
0 votes
2 answers
872 views

A lot of games store object positions as floats and have a closed ball for the game area (eg. a rectangle and objects are allowed to have position coordinates on all 4 edges). However, this becomes ...
Shuri2060's user avatar
  • 113
1 vote
1 answer
192 views

Is it possible to apply spatial split techniques (oct-trees bsp-trees, etc) when meshes are not necessary manifolds? The mesh in question represents the "map". This means that it is static so spatial ...
user877329's user avatar
  • 133
24 votes
4 answers
7k views

I'm looking to create a system that recognizes certain types of buildings and rooms you can create in game, like how Terraria detects "residences." In that game, a house can be constructed in a tile-...
Bernardo Becker's user avatar
  • 353
5 votes
2 answers
4k views

I´ve implemented a quadtree spatial partitioning to my game engine as I wanted to try it and see how it affects the performance checks. The results were great (instead of hundreds collision checks ...
Pins's user avatar
  • 589
3 votes
0 answers
219 views

I am writing an top down 2D game like agario/diep.io and I am using spatial hashing for detecting on screen objects. However I find it is too expensive to do a spatial partition a few times a second. (...
newguy's user avatar
  • 255
0 votes
2 answers
2k views

Hi I am currently using a modified version of spatial hashing algorithm written by Christer Bystrom. This algorithm is OK for collision detection. However when I use it for detecting entities in ...
newguy's user avatar
  • 255
0 votes
1 answer
239 views

I'm developing a 2D game engine and right now I'm designing the collision system. I've read about space partitioning and quad trees, and I understand that only the objects that are in the user's ...
Beto's user avatar
  • 23
2 votes
2 answers
430 views

Well, I have an array with all the terrains. How do I render them? I just add them to a List of terrains that are sent to the Renderer. There, every terrain of the list is rendered. The problem is ...
Daniel Béjar's user avatar
  • 428
1 vote
0 answers
129 views

I have recently started to plan a project in Unity that will be for Android. I have a database that consists of over 150,000 stars (may trim this down if I/O cripples the overhead). The game will ...
MarsYeti's user avatar
  • 135
0 votes
1 answer
1k views

I have an array of objects. Their position is a Vector2. I want to select the closest object, given an X and Y coordinate that represents an user touch on screen. ...
alexpfx's user avatar
  • 137
0 votes
2 answers
300 views

I already have a working algorithm for this but it's home-made and there is some redundancy in the things it checks, so I'm looking for a fast algorithm (or the name of it) that would detect undrawn ...
the_yellow_logo's user avatar
  • 101