Progressive Meshes
Cached
Download Links
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [hhoppe.com]
- [www.cfar.umd.edu]
- [research.microsoft.com]
- [www.cs.jhu.edu]
- [ftp.cs.cmu.edu]
- [www.cs.princeton.edu]
- [www.cs.caltech.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu:80]
- [www.cs.princeton.edu:80]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.cs.virginia.edu]
- [inst.eecs.berkeley.edu]
- [www.research.microsoft.com]
- [ftp.research.microsoft.com]
| Citations: | 985 - 11 self |
BibTeX
@MISC{Hoppe_progressivemeshes,
author = {Hugues Hoppe},
title = {Progressive Meshes},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance, transmission bandwidth, and storage capacities. This paper introduces the progressive mesh (PM) representation, a new scheme for storing and transmitting arbitrary triangle meshes. This efficient, lossless, continuous-resolution representation addresses several practical problems in graphics: smooth geomorphing of level-of-detail approximations, progressive transmission, mesh compression, and selective refinement. In addition, we present a new mesh simplification procedure for constructing a PM representation from an arbitrary mesh. The goal of this optimization procedure is to preserve not just the geometry of the original mesh, but more importantly its overall appearance as defined by its discrete and scalar appearance attributes such as material identifiers, color values, normals, and texture coordinates. We demonstrate construction of the PM representation and its applications using several practical models.
