Upper and lower bounds of op-code probabilities for Edgebreaker

Authors:
Cheol-Hyung Cho;Deok-Soo Kim;Youngsong Cho;Joonghyun Ryu
Affiliations:
Mechatronics and Manufacturing Technology Center, SAMSUNG Electronics, South Korea.;Department of Industrial Engineering, Hanyang University, South Korea.;Voronoi Diagram Research Center, Hanyang University, South Korea.;Voronoi Diagram Research Center, Hanyang University, South Korea
Venue:
International Journal of Computational Science and Engineering
Year:
2007

Citing 12
Cited 0

Geometry compression

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
WRAP&Zip decompression of the connectivity of triangle meshes compressed with edgebreaker

Computational Geometry: Theory and Applications - Special issue on multi-resolution modelling and 3D geometry compression
Face fixer: compressing polygon meshes with properties

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Spirale reversi: reverse decoding of the edgebreaker encoding

Computational Geometry: Theory and Applications
An edgebreaker-based efficient compression scheme for regular meshes

Computational Geometry: Theory and Applications
Edgebreaker: Connectivity Compression for Triangle Meshes

IEEE Transactions on Visualization and Computer Graphics
The Compression of the Normal Vectors of 3D Mesh Models Using Clustering

ICCS '02 Proceedings of the International Conference on Computational Science-Part II
An Improved TIN Compression Using Delaunay Triangulation

PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the probability distribution of the fiveop-codes (C, R, E, S and L) of Edgebreaker, which is one of themost popular connectivity compression methods for triangularmeshes. The paper first makes a conjecture of Pr(C) Pr(R) Pr(E) Pr(S) Pr(L), where Pr is the probability of theappropriate code. After showing that the conjecture is not true,the theoretical limit values of the upper and lower bounds for theprobability of each op-code are presented.