Skip to main content
Filter by
Sorted by
Tagged with
Advice
1 vote
7 replies
158 views

As the title suggests, I'm trying to tackle Hashlife. Am I jumping in blind? No, well, not entirely. First thing, I've studied this article concerning GoL: https://medium.com/@d.dadiani343/how-to-...
BitBump's user avatar
6 votes
3 answers
418 views

I've got a list P of 2-dimensional points, 100 ≤ |P| ≤ 100000, and a list C of circle centers, 100 ≤ |C| ≤ 100000. All coordinates (x,y) ∈ P or (x,y) ∈ C are integral, 0 ≤ x,y ≤ 4095. P and C may ...
hidefromkgb's user avatar
  • 6,012
1 vote
1 answer
152 views

Context I've been trying to learn C and have become a little more comfortable in it recently. I am building a 2d space shooting game (kind of Galaga inspired, written using SDL) and decided to use ...
Luke Fisher's user avatar
0 votes
0 answers
51 views

for a k-ary tree? Why is it 2L - 1 for a binary tree and not 4L - 1 for a quad tree?
Pasha's user avatar
  • 1,996
0 votes
1 answer
206 views

Im trying to make a quadtree implementation in rust that takes as input an Array2<u8>. Any node that contains all the same values should become a leaf. Problem is it just keeps dividing anyway ...
Simon Thalén's user avatar
0 votes
1 answer
111 views

First of all thanks to TARN4T1ON. His recommendation to use boundingBoxes for distance detection helped me to solve my problem. Now I have a new obstacle. I want a radially symmetrical gradation of ...
Spiri's user avatar
  • 439
0 votes
0 answers
89 views

I have a quadtree and the subdivision currently works with the distance from the camera to the center of a child and the width of the child. _LODCircles(pos){ const height = pos.y; //...
Spiri's user avatar
  • 439
0 votes
0 answers
117 views

I am trying to create a simulation of particles using the Barnes Hut Algorithm. I am representing the particles as a structured array where rows represent particles and the columns represent ...
Trevor Stern's user avatar
0 votes
0 answers
308 views

I am trying to implement Conway’s Game of Life using a quadtree data structure in Java. I have a QuadTree class that stores points in a two-dimensional space, and each point has a Cell object as its ...
ambolakabloa's user avatar
1 vote
0 answers
44 views

As part of a larger program, I have this function which takes 4 arguments: r, z, c, and grid. r and z represents the coordinates of the point. c is the parent cell for which we first make the check ...
peakcipher's user avatar
0 votes
0 answers
145 views

Scenario I am using a quadtree to store positional data on objects that represent asteroids/planets/stars in a program to model a realistic solar system with realistic distances. The use of a quadtree ...
Danni111111's user avatar
1 vote
0 answers
63 views

Following the CGAL's example in the documentation linked below: [https://doc.cgal.org/latest/Orthtree/Orthtree_2octree_build_with_custom_split_8cpp-example.html][1] Is it possible for one to run ...
Tunity's user avatar
  • 141
0 votes
0 answers
184 views

I am trying to implement a quadtree to store points in R2. My project requires a square centered at (0,0) with side lengths l, so the quadtree must be able to store all points in the closed rectangle [...
Tacet.Discipulus's user avatar
0 votes
0 answers
91 views

Hello I am trying to create a function Gravity that make all the black pixels of a Quadtree to "fall" if they can (if there is a white pixel under). for instance Gravity(Qt1) gives Qt2 : ...
uiuiui's user avatar
  • 11
1 vote
1 answer
214 views

I have a simple QuadTree. For readability and to help me understand what is happening, It avoids recursion and has a static depth. The QuadTree stores references to the points that are owned by ...
Blue7's user avatar
  • 2,064
0 votes
0 answers
63 views

I have a set of points denoted by (x y) coordinates in a space with a specified width and height, let's call this set s. Given any point p (p is not necessarily in s), I want to find the point q in s, ...
ronalama's user avatar
0 votes
2 answers
134 views

I need to make a Quadtree in Haskell. But I never used the language before. As I understand, there is no null pointers in Haskell. So how could I instantiate a null version of Group for the pointers ...
sSalvi's user avatar
  • 3
0 votes
1 answer
87 views

I have this simple code that is supposed to create a quadtree. /* here is my quadtree struct */ typedef struct QuadTree { AABB *boundry; Point **points; struct QuadTree** NW; struct ...
bat's user avatar
  • 1
-1 votes
1 answer
103 views

Below is the script for the quadtree... I'm relatively new to the concept of pointers, so my guess is that I have done something wrong with a double pointer, or something along those lines! #include &...
Oscar James Pope-Lenkowiec's user avatar
1 vote
1 answer
309 views

Assumed we would like to create a strategy game. What is the best way (using flutter together with the flame engine) to detect other units (e.g. enemies) around an element? I've checked out the ...
hypnomaki's user avatar
  • 652
0 votes
1 answer
389 views

I faced "java.lang.StackOverflowError", while doing recursion method. Basically, I am solving quad compression algorithm problem. Problem is In Solution class, there is a solution method, ...
Hg-lab's user avatar
  • 23
1 vote
1 answer
915 views

I am trying to implement a a quad tree with the very basic functionality of inserting points and then querying it to find all points that lie within a specific rectangle. I've referenced this for my ...
sweet_summer_child's user avatar
-2 votes
2 answers
244 views

I need to figure out how to check if certain points lie inside or outside a rectangle given as coordinates (x1,x2,y1,y2) i.e. top left and bottom right points of rectangle. The total number of points ...
sweet_summer_child's user avatar
2 votes
1 answer
378 views

I am still quite new to the advanced topics in rust, but for context, I am trying to implement a generic quadtree in rust. With the method find_mut(&mut self,x,y) I want to traverse the quadtree ...
RibsGrowBack's user avatar
2 votes
1 answer
499 views

I'm learning C++ and am doing something I'm comfortable with in java to start out. Particle simulation and flocking using a quadtree to cheaply find particles in a region. Everything is working but ...
Fractal Salamander's user avatar
0 votes
0 answers
97 views

folks! Apologies if this is a duplicate question and I've done some research on the topic but don't know if I'm heading in the right direction. I have converted gridded data of population density to ...
Chris Jarzynka's user avatar
1 vote
1 answer
859 views

So I am using OpenCV to do some object tracking. What I have so far is a script that finds good points to track in this video What I would like to now do is draw lines between the points, however I ...
blakemoreb's user avatar
0 votes
1 answer
651 views

I have a quadtree. The root node (level 0) is positioned at 0,0 by its centre. It has a width of 16, so its corners are at -8,-8 and 8,8. Since it's a quadtree, the root contains four children, each ...
Clonkex's user avatar
  • 3,675
0 votes
0 answers
90 views

I've been working on a decoder that reconstructs data encoded as a depth-first traversal of a quad tree structure. When I encode the offset of each, its pretty simple. deconstructed_matrix = np.empty([...
Jackie Carson's user avatar
1 vote
1 answer
221 views

Given is a finite 2-dimensional continuous space, a set of points s from that space and a line l: y = mx + b through that space. I want to filter out all points in s whose shortest distance from l is ...
Hans Dampf's user avatar
1 vote
1 answer
363 views

I need some help with this problem I'm having of how to do Neighbor find of multiple quadtrees. I have a cube. Each side of the cube is made of N individually colored quads (as you can see from the ...
Memory1's user avatar
  • 67
1 vote
1 answer
312 views

this function is supposed to find if there is above a set number of points within the window, and if there is draw a rectangle around it and then subdivide by recursively calling the same function on ...
quank77's user avatar
  • 13
1 vote
0 answers
109 views

How can I modify the code shown below to apply different depth level of quadtree to each instance contained in the image. I would like to apply a finer quadtree level on instances such as the 'teddy ...
ashah's user avatar
  • 269
0 votes
1 answer
1k views

I am trying to do a quadtree algorithm on numpy array of points created by make_blobs function from sklearn. I am trying to create an Recursive Partition KMeans in which the centroids are found in ...
Kuba Głowacz's user avatar
2 votes
1 answer
392 views

As stated in the title, how can I represent a quad-tree as a binary tree? I know that it is possible to represent general trees as binary trees but I wasn't able to wrap my head around binary tree ...
ezpzzzz's user avatar
  • 23
1 vote
0 answers
235 views

I'm working on a C++ quadtree implementation for collision detection. I tried to adapt this Java implementation to C++ by using pointers; namely, storing the child nodes of each node as Node pointers (...
Nick Román's user avatar
4 votes
3 answers
3k views

I have a list of coordinates and I need to find the closest coordinate to a specific point which I'll call P. At first I tried to just calculate the distance from each coordinate to P, but this is too ...
Kittiesrcute's user avatar
0 votes
1 answer
84 views

I know quadkeys have the basic regex of [0-3]{6,23}. But is it possible for a number to match that regex and not be a quadkey? I.e. random number 2010210202020021 Given a random number, I would like ...
Paula's user avatar
  • 35
0 votes
1 answer
93 views

Few weeks ago, I was trying to implement a function to display a quadtree. My current problem is concerning the same work, so I pass you this link for all the context: How to display composed ...
mxbr236's user avatar
  • 39
0 votes
1 answer
439 views

Currently I’m trying to implement different functions to realize operations on quadtrees using C language. Context: A quadtree (black and white picture) is: White Black Is broken down into 4 sub-...
mxbr236's user avatar
  • 39
0 votes
1 answer
113 views

I don’t know if this is the right place to write about my question. However my question is this: I’m trying to find examples of quadtree implementations using real datasets. The only ones I find ...
Wannahelp 's user avatar
-1 votes
1 answer
266 views

I am making a Quadtree in C++. I need to find the leaf nodes of the tree. To do this I have this function that needs to return a vector of the leaf nodes. For now everything else seems to work, but ...
Ilya Iakoub's user avatar
3 votes
0 answers
111 views

How do I separate N number of moving circles? I am making a small game where I have hundreds of moving circles colliding. I have them all stored in a qTree, which I recreate every frame. The collision ...
Charles Darwin's user avatar
0 votes
2 answers
1k views

Let's say I have a list of restaurants and I have the location of a customer that's looking for restaurants that are nearby. How could I use S2? From my understanding without S2, I would maintain my ...
Dipen's user avatar
  • 546
0 votes
1 answer
651 views

I am doing a compuational geometric issue which uses TriangularMeshQuadtree from a C# library, and some of its constructors is written as follows (from metadata, so I cannot see the details of ...
Lake_Lagunita's user avatar
2 votes
0 answers
192 views

I'm having trouble understanding how inserting into a Barnes-Hut quadtree works. If the root represents the center of mass and all of nodes within the quadtree, what happens if you insert something ...
rkuang25's user avatar
  • 141
0 votes
0 answers
207 views

I am creating a quadtree for a 2D game in C# to make the rendering faster. Some of the objects (planets) are moving and that is why, I created a method called removeAndUpdate to update the tree by ...
Fox1942's user avatar
  • 376
2 votes
1 answer
166 views

Any "W" refers to half-width and any "H" refers to half-height. Any "X" and "Y" refers to the center of a rectangle aligned with the co-ordinate axes. I am ...
Disgusting's user avatar
0 votes
1 answer
503 views

I have a boids flocking simulation setup. It originally worked by having every boid loop through every boid so that they all constantly know where each other are at in order to tell if they are close ...
Michael Moreno's user avatar
1 vote
1 answer
1k views

I've created a flocking simulation using Boid's algorithm and have integrated a quadtree for optimization. Boids are inserted into the quadtree if the quadtree has not yet met its boid capacity. If ...
Michael Moreno's user avatar

1
2 3 4 5
8