## Abstract

In this paper we propose a novel geometry compression technique for 3D triangle meshes. We focus on a commonly used technique for predicting vertex positions via a flipping operation using the parallelogram rule. We show that the efficiency of the flipping operation is dependent on the order in which triangles are traversed and vertices are predicted accordingly. We formulate the problem of optimally (traversing triangles and) predicting the vertices via flippings as a combinatorial optimization problem of constructing a constrained minimum spanning tree. We give heuristic solutions for this problem and show that we can achieve prediction efficiency within 17.4% on average as compared to the unconstrained minimum spanning tree which is an unachievable lower bound. We also show significant improvements over previous techniques in the literature that strive to find good traversals that also attempt to minimize prediction errors obtained by a sequence of flipping operations, albeit using a different approach.

Original language | English (US) |
---|---|

Title of host publication | Data Compression Conference Proceedings |

Editors | J.A. Storer, M. Cohn |

Pages | 83-92 |

Number of pages | 10 |

State | Published - 2005 |

Event | DCC 2005: Data Compression Conference - Snowbird, UT, United States Duration: Mar 29 2005 → Mar 31 2005 |

### Other

Other | DCC 2005: Data Compression Conference |
---|---|

Country/Territory | United States |

City | Snowbird, UT |

Period | 3/29/05 → 3/31/05 |

## ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Hardware and Architecture