Abstract
A novel progressive geometry compression scheme is presented in this paper. In this scheme, a mesh is represented as a base mesh followed by some groups of vertex split operations using an improved simplification method in which each level of the mesh can be refined into the next level by carrying out a group of vertex split operations in any order. Consequently, the progressive mesh (PM) representation can be effectively encoded by permuting the vertex split operations in each group. Meanwhile, a geometry predictor using the Laplacian operator is designed to predict each new vertex position using its neighbours. The correction is quantized and encoded using a Huffman coding scheme. Experimental results show that our algorithm obtains higher compression ratios than previous work. It is very suitable for the progressive transmission of geometric models over the Internet.
Original language | English |
---|---|
Title of host publication | Proceedings - 8th Pacific Conference on Computer Graphics and Applications, PG 2000 |
Editors | Brian A. Barsky, Yoshihisa Shinagawa, Wenping Wang |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 408-410 |
Number of pages | 3 |
ISBN (Electronic) | 0769508685 |
DOIs | |
Publication status | Published - 2002 |
Externally published | Yes |
Event | Pacific Conference on Computer Graphics and Applications 2000 - Hong Kong, China Duration: 3 Oct 2000 → 5 Oct 2000 Conference number: 8th https://ieeexplore.ieee.org/xpl/conhome/7096/proceeding (Proceedings) |
Conference
Conference | Pacific Conference on Computer Graphics and Applications 2000 |
---|---|
Abbreviated title | PG 2000 |
Country/Territory | China |
City | Hong Kong |
Period | 3/10/00 → 5/10/00 |
Internet address |
|
Keywords
- Application software
- Bandwidth
- Computational geometry
- Computer graphics
- Computer science
- Huffman coding
- Information geometry
- Internet
- Laplace equations
- Solid modeling