3
votes
How to read a sparse Octree sequentially, like a 3D array?
To skip all those unwanted nodes, I think what you're looking for is a sparse but contiguously-allocated octree, which can be easily indexed by (x, y, z). You also ...
3
votes
Accepted
Need help with simple octree implementation
When you do
newCentre = self.centre
then that doesn't create a new array, but it uses the same object instead. If you modify ...
3
votes
Accepted
Octree Terrain Destruction and LODs
The primary goal of LOD is to reduce the cost of drawing by not drawing unnecessarily fine detail. It is not usually about discarding information from RAM. In fact, in a conventional polygonal-model ...
2
votes
Accepted
General Octree question: What do you actually store?
Octrees store data, indexed by a 3 dimensional position. That data could be a reference to an object, reference, bool, or whatever you need.
Inserting items into an Octree is typically done from top ...
2
votes
Using octrees as LOD system
As Kromster alludes, this apparent problem occurs because of the small scale of your example. Usually when we reach for sparse octrees, we have more than two levels of subdivision.
Here's your same 2D ...
2
votes
How can I handle voxels that require extra data in my octree?
I would suggest going with a variant an absolute index in a separate array.
Rather than insert/delete with shifting (which would be painful to implement and slow), or leaving gaps, there is a third ...
1
vote
How to read a sparse Octree sequentially, like a 3D array?
One strategy you can use is to make your leaf nodes "chunks" of cells. For example, Minecraft uses 16x16x16 cell chunks if I recall correctly.
This gives you a coarser granularity for ...
1
vote
Accepted
How to construct a octree density from SDF for MC
You use the octree to skip swaths of work.
Anytime you find an octree node that's fully outside or fully inside the volume, you can skip iterating any cells inside it because you know the surface won'...
1
vote
Accepted
Setting up an "Oct-Tree"
If you want div to represent the number of cubes then you need to ensure that div is a cube (as in, is an integer to the 3rd ...
1
vote
Drawbacks to an Octree and Quadtree hybrid?
A k-d tree like Philipp suggested would likely be a good solution, but certainly more complicated to implement. Your proposed solution should work fine, but you may need to be clever with how you ...
1
vote
Accepted
Simplyfing/dissolving octree to simple boxes by adjacent octants with similar traits
If what you mean is that you need a nav-volume with fewer nodes because the oct-tree ends up leaving you with too many nodes, the main issue behind you problem is, of course, symmetry.
Or better said,...
1
vote
Building an Octree for terrain generation
I'm not sure I'm answering the exact question, so I'm going answer in segments, and feel free to reply in comments if there's a misunderstanding about the particulars of a specific question.
I have ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
octree × 74voxels × 19
c++ × 13
opengl × 10
collision-detection × 7
quadtree × 6
3d × 5
terrain × 5
level-of-detail × 5
binary-space-partitioning × 4
unity × 3
c# × 3
algorithm × 3
procedural-generation × 3
path-finding × 3
raycasting × 3
data-structure × 3
culling × 3
frustum × 3
marching-cubes × 3
performance × 2
python × 2
3d-meshes × 2
terrain-rendering × 2
scene-graph × 2