Go backward to INTRODUCTION
Go up to Top
Go forward to TWO BASIC APPROACHES TO SIMPLIFICATION
LOD HIERARCHIES
- SCENE: a collection of individual models (chairs, cars,
teapots, etc).
- LOD Hierarchy for (an original) model M0:
H=(M_0, M_1, ..., M_k)
where each Mi is a simplification of Mi-1.
- Typically, k5.
- SIMPLIFICATION ALGORITHM:
MiMi-1 by an application of algorithm.
- MEASURE OF DISTORTION:
- distance function d(M0,Mi)
- E.g. Hausdorff Measure
- MEASURE OF SIMPLICITY:
- SIZE, Ki=|Mi| = number of vertices, edges and faces.
- (simplification target) Ki< c.Ki-1 for some 0<c<1.
- TRADEOFFS BETWEEN THE TWO MEASURES:
- minimize distortion eps and maximize simplicity K.
- TWO KINDS OF SIMPLIFICATION PROBLEMS:
- MIN-DISTORTION PROBLEM:
Given M0 and K, find M1 of minimal size
subject to |M1| <K.
- MIN-SIZE PROBLEM:
Given M0 and eps, find M1 of minimal
distortion subject to d(M0,M1) <eps.
- USING LOD MODELS:
Choose Mi based on
perceptual Importance of model in scene.
- MEASURES OF PERCEPTUAL IMPORTANCE?
- (usually) Real estate on screen when rendered.
- (propose) Distance from gaze point.
- Parameter for Simplification:
- Target complexity (K>0)
- or, Bound on distortion (eps>0)
Chee Yap