Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques 2001
DOI: 10.1145/383259.383277
|View full text |Cite
|
Sign up to set email alerts
|

Consistent mesh parameterizations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
166
0

Year Published

2004
2004
2009
2009

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 224 publications
(166 citation statements)
references
References 9 publications
0
166
0
Order By: Relevance
“…Praun et al [15] consistently parameterize a set of genus-0 models onto a user-specified simplicial complex. Unlike their method, we do not impose a fixed consistent connectivity of the base domain, but only satisfy the given point constraints, thereby providing the map more freedom.…”
Section: Previous Workmentioning
confidence: 99%
See 4 more Smart Citations
“…Praun et al [15] consistently parameterize a set of genus-0 models onto a user-specified simplicial complex. Unlike their method, we do not impose a fixed consistent connectivity of the base domain, but only satisfy the given point constraints, thereby providing the map more freedom.…”
Section: Previous Workmentioning
confidence: 99%
“…Once we have such a path network, we simplify the mesh to produce a progressive mesh, but we keep the feature vertices, and only allow vertices on the feature paths to be collapsed into other path or feature vertices [16]. To produce the path network on the 3D surface, we use a method similar to those of Praun et al [15] and Kraevoy et al [11]. We link together pairs of feature points, with great circle arcs on the sphere, and paths on the mesh, until we complete a full "triangulation".…”
Section: Constrained Spherical Parameterizationmentioning
confidence: 99%
See 3 more Smart Citations