IEEE Visualization 2005 - (VIS'05)
DOI: 10.1109/vis.2005.107
|View full text |Cite
|
Sign up to set email alerts
|

Topology-driven Surface Mappings with Robust Feature Alignment

Abstract: Figure 1: Surface mapping between horse and lizard. The color-coding shows the mapping of each region, guided by eight user-specified feature curves. Our topology-driven method provides mappings of different homotopy type between the two surfaces as shown in (c) and (d). We show feature curves in red.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 39 publications
0
1
0
Order By: Relevance
“…A successful strategy to further enlarge the family of domains that can be considered is map composition. Methods in this category internally use the Tutte embedding, generating mappings to strictly convex domains that are then combined to obtain more general mappings to manifolds of arbitrary genus [Liv20c, LBG*08, GJGQ05, KS04, SAPH04], grid spaces for quad remeshing [Liv23], and even non‐convex planar polygons that may also partially overlap [WZ14]. Being internally based on Tutte, all these methods inherit the same theoretical guarantees of correctness.…”
Section: Related Workmentioning
confidence: 99%
“…A successful strategy to further enlarge the family of domains that can be considered is map composition. Methods in this category internally use the Tutte embedding, generating mappings to strictly convex domains that are then combined to obtain more general mappings to manifolds of arbitrary genus [Liv20c, LBG*08, GJGQ05, KS04, SAPH04], grid spaces for quad remeshing [Liv23], and even non‐convex planar polygons that may also partially overlap [WZ14]. Being internally based on Tutte, all these methods inherit the same theoretical guarantees of correctness.…”
Section: Related Workmentioning
confidence: 99%
“…If there is only one singularity p 0 , the cut graph can be constructed using a set of canonical homology basis passing through the singularity as introduced in [Carner et al 2005]. The cut graph has one node and 2g edges.…”
Section: Update Vertex Radiimentioning
confidence: 99%