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
Normal vector compression of 3D mesh model based on clustering and relative indexing
Future Generation Computer Systems - Special issue: Computer graphics and geometric modeling
Upper and lower bounds of op-code probabilities for Edgebreaker
International Journal of Computational Science and Engineering
Distribution of vertex indices in Edgebreaker
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Probability distribution of index distances in normal index array for normal vector compression
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
| 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. The issues for normal vectors have not yet been explored as much as it deserves, even though the size of the data for normal vectors can be significantly larger than its counterparts of topology and geometry. Presented in this paper is an approach to compress the normal vectors of a shape model represented in a mesh using the concept of clustering. It turns out that the proposed approach has a significant compression ratio without a serious sacrifice of the visual quality of the model.