I have a question. If I run classic Marching Cubes i need to iterate all voxels and calculate iso surface in them. That means I need to decompress my data to get RAW stream (or use compression, that allows random access. Most of those compressions, that also brings high ratios are slow to do in realtime.
So my thoughts. If I compress data with DCT (and Huffman, that is fast for decompress), I can detect edges in DCT domain (I have found this article about it http://www.sciencedirect.com/science/article/pii/S187770581106557X). So basicly, I compress each slice as single 2D image. During extraction, I do edge detection in DCT. Than I got point cloud of edge points. On this, I run triangulation. Now, points from edges are in grid and most likely if point at [x,y] is edge, one of its neighbour will be detected as edge as well. I connect those points in a similar way as Marching Cube does.
Its just idea, I dont tested it. I would like to discuss, if it is possible and also see some remarks on my approach (or if it is totally stupid :-))