Upper and lower bounds of op-code probabilities for Edgebreaker
by Cheol-Hyung Cho, Deok-Soo Kim, Youngsong Cho, Joonghyun Ryu
International Journal of Computational Science and Engineering (IJCSE), Vol. 3, No. 1, 2007

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.

Online publication date: Mon, 09-Jul-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com