再帰的に二等分割された直角二等辺三角形上の頂点数を求めるアルゴリズム

抄録

Image compression algorithms are evaluated on several performance measures, two of which are the total amount of compressed image data and image quality. In this paper, we deal with an image compression algorithm that divides an image domain into some smaller triangles. Although the triangulations will cause image quality to deteriorate in general, the relationship between the triangles is not trivial. We, therefore, propose an efficient algorithm for counting the number of the internal vertices in a triangulated domain, to investigate their relationship. It is believed that the solution will contribute to further work on improving the process of image compression.