Title: Upper and lower bounds of op-code probabilities for Edgebreaker

Authors: Cheol-Hyung Cho, Deok-Soo Kim, Youngsong Cho, Joonghyun Ryu

Addresses: 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

Abstract: This paper presents the probability distribution of the five op-codes (C, R, E, S and L) of Edgebreaker, which is one of the most popular connectivity compression methods for triangular meshes. The paper first makes a conjecture of Pr(C) > Pr(R) > Pr(E) > Pr(S) > Pr(L), where Pr is the probability of the appropriate code. After showing that the conjecture is not true, the theoretical limit values of the upper and lower bounds for the probability of each op-code are presented.

Keywords: Edgebreaker; op-code probability; topology compression; probability distribution; connectivity compression; triangular meshes.

DOI: 10.1504/IJCSE.2007.014462

International Journal of Computational Science and Engineering, 2007 Vol.3 No.1, pp.23 - 28

Published online: 09 Jul 2007 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article