Geometric Compression 


The size of geometric models in Computer Graphics is ever increasing and increasing faster than the processing power of commodity graphics cards. Some current models consist of millions or billions of triangle primitives. This is problematic if such models need to be stored or transmitted. On solution is to losslessly compress the geometry (point positions) and connectivity (linking of points into triangles) of models. Unlike previous approaches we separate rather than interleave the two processes.


Patrick Marais, Bruce Merry, Dave Shreiner 


Marais, P., Gain, J. and Shreiner, D., "Distance Ranked Connectivity Compression of Triangle Meshes", Computer Graphics Forum, pp. 813-823, Vol. 26, No. 4, December 2007, pp. 813-823.

Marais, P. and Gain, J., "High fidelity compression of irregularly sampled height-fields", South African Computer Journal, Vol. 38, June 2007, pp. 40-50.

Merry, B., Marais, P. and Gain, J., "Compression of Dense and Regular Point Clouds", AFRIGRAPH 2006, Cape Town, South Africa, 25-27 January 2006, ACM Press, pp. 15-20. 


None as yet

<< Back to research page