Algorithms for clustering data
Algorithms for clustering data
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Optimized geometry compression for real-time rendering
VIS '97 Proceedings of the 8th conference on Visualization '97
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
An Improved TIN Compression Using Delaunay Triangulation
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Vertex Data Compression for Triangular Meshes
PG '00 Proceedings of the 8th Pacific Conference on Computer Graphics and Applications
| Hi-index | 0.00 |
As the transmission of 3D shape models through Internet becomes more important, the compression issue of shape models gets more critical. While the compressions of topology and geometry have been explored significantly, the same issue for normal vectors has not yet been studied as much as it deserves. Presented in this paper is an approach to compress the normal vectors of a 3D mesh model using the concept of clustering and relative indexing. The model is assumed to be manifold triangular mesh model with normal vectors associated with vertices. The proposed scheme clusters the normal vectors of given model and the representative normal vector of each cluster is referred to via a mixed use of relative as well as absolute indexing concepts. It turns out that the proposed approach achieves a significant compression ratio (less than 10% of the original VRML model files) without a serious sacrifice of the visual quality.