Take the 2-minute tour ×
Game Development Stack Exchange is a question and answer site for professional and independent game developers. It's 100% free, no registration required.

Working with an infinite set of cubes, is there a way of detecting which cubes exist within a frustum?

Most frustum culling seems to work along the lines of running through all objects and seeing if they intersect - this is ok with a finite set of objects, or something like Octrees.

I'm currently finding all cubes within the frustum's bounding box - but that's far more than I really need.

I could then test these all against it, but I was wondering if I could skip a step.

share|improve this question

3 Answers 3

With an infinite set of cubes, even the frustum has an infinite number of them. If someone has a better idea I am very interested to hear it. However, the octrees that you mention have worked wonderfully for me in the past. Basically any hierarchical structure will let you quickly eliminate huge number of objects. Then you can chose, depending on the complexity of the objects, whether you want to process all objects within an octtree node, or do you want to do finer detection which objects are within the frustum.

When you talk about cubes, I have a feeling you are talking about some kind of Minecraft like or voxel terrain. The frustum test is an important step, however do notice that in terrain case (and some others) you will have a great deal of objects (cubes) hidden "under" the visible ones. Finding a way to cull those efficiently will be of great importance. My point is that you should not spend every last CPU cycle frustum culling. If you can spend 20% of the time to frustum cull 80%, and then another 20% to cull 80% of hidden ones, it will be bigger improvement then to perform perfect frustum cull.

There are several ways of dealing with an infinite terrain.

1) If the terrain starts simple or small, but then grows, the octree should be balancing. This means that as you add more nodes into the tree, when a particular subtree grows beyond some threshold, one or more children should be pushed up or to the neighbouring tree. The idea is to try at all times have the (roughly) same number of subnodes in each subtree. This is a complex task, so you should definitely look for libraries rather then reinventing it yourself. It is worth noting that in most cases you do not need this complexity as it can be avoided using next method.

2) The easiest way to deal with seemingly "infinite" scene is to use two methods. A higher level structure that basically divides a terrain into a grid. Each grid location, chunk or area is a cube comrised of say 1000x1000x1000 of your cubes. Then use an octree to organize these 1024x1024x1024 area. Since you know the geometry of the large cube, it is easy to organize the octree. When rendering, you can use simple math to come up with several (10-is) large grid chunks that are in the frustum, and then process each one as a separate octree.

share|improve this answer
1  
My understanding is that a frustum was finite - a chopped pyramid. That is how I have a bounding box. Yes, it's a voxel terrain, I've chunked up the terrain into blocks (16^3) - and am looking for the best method to add blocks to the generation, and rendering queue. I can't conceptually grasp how you'd use octrees in infinite scenarios. –  salmonmoose Oct 10 '12 at 2:26
    
Infinite frustrum was a joke. Practically you have to limit it with near and far plane thus make it finite. Any way, I will edit the answer to provide some clues on how to use octrees for infinite terrain. –  MikiJ Oct 10 '12 at 13:57

I'd go with recursive subdivision of a cuboid that is axis aligned and contains the frustum, which should be straightforward to construct based on the location of the corners of the frustum.

Firstly mark all small cubes as not intersecting the frustum.

Then test to see which case you have for the current cuboid, and apply the appropriate action:

  1. Not intersecting the frustum - do nothing they are already marked correctly.

  2. Completely inside the frustum - mark all small cubes within the big cube as inside the frustum.

  3. It intersects the frustum - If it contains more than one cube then subdivide into two smaller cuboids (splitting on the longest axis), and apply the same test recursively to each one. If it can't be subdivided mark it as intersecting.

At the end of the process all cubes should be marked appropriately.

Note that instead of actually setting a flag on each small cube you may want to collect a list of the intersecting ones in some other way, or the mark them all as outside step will take forever.

share|improve this answer

You're a bit confused. (Axis-aligned) Bounding box checks are there to make things cheaper.

They exist as a broadphase attempt to see whether a given voxel (volume or point) is likely to be within the frustum (containing volume) or not. In other words, they explicitly exist as an "early fail" mechanism. This sort of tiered elimination approach is common in graphics and collision detection, and in practice is computationally much more efficient than going straight for the final step -- which in your case is testing specifically to see whether each and every voxel in your world or zone is exactly inside or outside the frustum. It's costly to test every voxel in your world against exact frustum bounds, but it's much, much cheaper to test all of those against AABB bounds.

So don't skip a step. Listen to what the early warning system tells you. Let your axis-aligned bounding box serve its intended purpose -- cheap, early elimination. Then you do the expensive "on-which-side-of-each-of-6-arbitrarily-oriented-frustum-planes-is-this-voxel" tests only on that subset that you've found to lie within the bounding volume.

share|improve this answer
    
No, I get what happens with AABBoxes - however the solutions are tailored to finding objects that exist in floating point space, and work along the lines of "Is this object in this space" - rather than the inverse "Find all objects in this space" I didn't propose to do the "which-side" at all, rather I was thinking something similar to en.wikipedia.org/wiki/Bresenham's_line_algorithm start with the near plane, generate a unit surface, and then move along until I hit the far plane. Intuitively to me it made more sense to work with unitcubes if I could. –  salmonmoose Oct 11 '12 at 2:50
    
You're going to need to be a lot clearer in how your describe your problem. "The solutions". What solutions? "Skip a step". Which step? How many degrees of freedom does your camera have? 6DoF rules out Bresenhams. Until these questions are answered, it is very difficult to give you a spot-on answer. Re floating point / unit cube -- numerically that may be pertinent, but conceptually it really isn't, and I get the feeling your problem (like most) is a conceptual one. Re "move along", unless the voxels are orthogonally-aligned to the frustum (unlikely), you'll be using 3DDDA raycasts -- costly. –  Nick Wiggill Oct 11 '12 at 13:40

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.