I was going to post something about your thoughts are on a possible alternative to rendering voxel (while still using PolyVox for data organization) using hierarchical based ray / voxel intersection on the GPU. Well, actually, I only thought about how it may apply to cube voxel world; I'm not sure what the implications are for smooth terrain.
Basically this paper (
http://www.rendering.ovgu.de/rendering_ ... oxelGI.pdf) describes a voxel based GI method. But I think one could use this also for rendering voxel based world (cube worlds). Their voxelization technique is not really needed here because my world is already voxelized. However, this technique makes a "binary" voxel representation of a 3d world by using only one bit to represent depth (actually I thought about doing this exactly I just haven't gotten around to it). So in my case, instead of extracting surface, I would just construct this 2D binary voxel map (through bitmasking). All that is invovled for each voxel are some bit operations so it ought to be fast.
Once you have the 2d "binary" voxel. You just ray cast it in the pixel shader. One quick way is to render 512 * 3 quads then "sample" the 2d "binary" voxel texture using a fast ray / voxel intersecting technique, but all you have to do is check this one depth value at a point, you don't even have to ray cast (not 100% sure about this), and it is fast because checking depth against this "binary" texture involves only bit operations. Or maybe just render a fullscreen quad and ray cast.
The advantages of this are that is done on the GPU. You can do ambient occlusion. The "binary" voxel texture construction may be faster than extracting the mesh. AND LOD. With a ray cast method you may get LOD for free because it's a ray casting method.