Compression of triangular meshes by simultaneously processing pairs of triangles

Authors:
Sebastian Krivograd;Mladen Trlep;Borut Žalik
Affiliations:
University of Maribor, Maribor, Slovenia;University of Maribor, Maribor, Slovenia;University of Maribor, Maribor, Slovenia
Venue:
Proceedings of the 21st spring conference on Computer graphics
Year:
2005

Citing 9
Cited 0

Geometry compression

SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Time/space tradeoffs for polygon mesh rendering

ACM Transactions on Graphics (TOG)
Progressive meshes

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Data compression: the complete reference

Data compression: the complete reference
Real time compression of triangle mesh connectivity

Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Compressing TINs

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Progressive compression for lossless transmission of triangle meshes

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 1.2

OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 1.2
Compressing Triangulated Irregular Networks

Geoinformatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper introduces a new method for lossless compression of triangular meshes. The number of commands describing the spatial relationships of the mesh is reduced by expressing the topological relation of pair of triangles. The approach bases on the eight states, which are described by the four commands. A comparison with Touma and Gotsman approach has been made using over 150 testing examples. The proposed approach turns out as more suitable for 2.5D and regular 3D triangular meshes.