Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001
DOI: 10.1109/pccga.2001.962858
|View full text |Cite
|
Sign up to set email alerts
|

Multiresolution interpolation meshes

Abstract: In this paper, we propose a new multiresolution-based shape representation for 3 0 mesh morphing. Our approach does not use combination operations that caused some serious problems in the previous approaches for mesh morphing. Therefore, we can calculate a hierarchical interpolation mesh robustly using two types of subdivision jitting schemes. Our new representation has a hierarchical semiregular mesh structure based on subdivision connectivi9. This leads to various advantages including eficient data storage, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
26
0

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 32 publications
(27 citation statements)
references
References 27 publications
1
26
0
Order By: Relevance
“…An inherent limitation of a spherical parameterization is that it can only be applied to closed, genus zero surfaces. A more general approach is to parameterize the models over a common base mesh [LDSS99,LCLC03,MKFC01,PSS01]. This approach splits the meshes into matching patches with an identical inter-patch connectivity.…”
Section: Joint Parameterizationmentioning
confidence: 99%
“…An inherent limitation of a spherical parameterization is that it can only be applied to closed, genus zero surfaces. A more general approach is to parameterize the models over a common base mesh [LDSS99,LCLC03,MKFC01,PSS01]. This approach splits the meshes into matching patches with an identical inter-patch connectivity.…”
Section: Joint Parameterizationmentioning
confidence: 99%
“…(1) To place source points on a circle within three times the diameter of ∂D, and (2) To sample them on an offset surface of ∂D. As shown in [14], source point locations desirable for analytic cases might work perfectly for discrete surfaces. We conducted experiments by evaluating fitting error under different shapes of D and different distances from ∂D.…”
Section: E Source and Collocation Points Placementmentioning
confidence: 99%
“…2,5,[13][14][15][16] This approach splits the meshes into matching patches with an identical inter-patch connectivity. After the split, each set of matching patches is parameterized on a common convex planar domain.…”
Section: Simplicial Parameterizationmentioning
confidence: 99%