Multiresolution Modeling
A Very Brief Introduction
1
Spring 2010
Multiresolution Modeling A Very Brief Introduction 1 Spring 2010 - - PowerPoint PPT Presentation
Multiresolution Modeling A Very Brief Introduction 1 Spring 2010 Multiresolution Multiresolution Models: Multiresolution Multiresolution Models: Models: Definition odels: Definition Definition Definition A multiresolution model
1
Spring 2010
A multiresolution model consists of a collection of Mesh fragments, usually describing small g y g portions of an object with different LOD (i.e., level of details) Suitable relations that allow selecting a subset
criteria) and combining them into a mesh that represents the object. represents the object.
2
Th i i ll d d fi i i f There is no universally accepted definition for LOD, level of details. In general, more faces means more details and perhaps higher accuracy means more details and perhaps higher accuracy. Thus, to accurately represent a curvilinear
needed (i.e., higher LOD or resolution). Not all meshes in a scene require very high Not all meshes in a scene require very high
need much details.
3
There are in general two different approaches: On-the-Fly (i.e., real time): A new mesh with y ( ) the desired resolution is constructed from scratch whenever it is needed. Off-Line: Design a data structure to collect the mesh fragments and relations in a the mesh fragments and relations in a preprocessing step, and generate the new mesh with a given resolution on-line. mesh with a given resolution on line.
4
input model resolution requirements q construction query processing multi-resolution model processing model desired mesh
5
A difi ti ( f h) M i th b i ti A modification (of a mesh) M is the basic operation
1 locally to mesh X 2 written
M X X M (X X ) as M: X 1⇒ X 2, or M =(X 1, X 2). A modification is a refinement (resp., coarsening) if X 2 has more (resp., less) faces than X 1 has.
M
the yellow region of X is
M ⇒
the yellow region of X 1 is re-tessellated to yield X 2
6
X 1 X 2
Not all modifications are independent of each other.
M i M j X 1 X 3
M j removes some faces inserted by M i
7
X 2 X 4
Gi difi i M (X X ) d Given two modifications M i=(X p,X q) and M j=(X s,X t), if modification M j removes some faces inserted by M we say M directly depends faces inserted by M i, we say M j directly depends
Given two modifications they are either Given two modifications, they are either independent of each other, M i < M j or M j < M i. We may apply all possible modifications to a We may apply all possible modifications to a mesh or to its intermediate results until the simplest mesh is obtained. simplest mesh is obtained. The modifications may be the Euler operators used in mesh simplifications.
8
used in mesh simplifications.
The base mesh X 0, all modifications M 1, M 2, …, M k, and the dependency relation < together f i i M X {M form a multiresolution model M=[X 0,{M 1, M 2, …, M k},<] Why do we keep track modifications rather than the intermediate results? This is because we can regenerate them from X 0 and the necessary modifications. Storing intermediate results may require very high space consumption.
9
A directed graph can be constructed as follows: The root is X 0, the base mesh The directed arcs from X 0 are all modifications applied to X 0 modifications applied to X 0 If there is a modification M i < M j, draw a directed arc from M to M directed arc from M i to M j. In this way, we have a directed acyclic graph, DAG So those M ’s are nodes of this DAG!
Why is it a DAG?
10
following:
may perform a depth-first search (DFS) or y p p any search from the root until an intermediate result which satisfies the desired resolution.
region of a mesh and a “resolution/LOD” region of a mesh and a resolution/LOD requirement, we may perform a search and
11
e e t e es t e d cated eg o .
12