Multiresolution mesh morphing

Lee, Aaron W. F.; Dobkin, David P.; Sweldens, Wim; Schröder, Peter

doi:10.1145/311535.311586

Cited by 211 publications

(123 citation statements)

References 33 publications

Supporting

Mentioning

121

Contrasting

Order By: Relevance

“…Morphing and Detail Transfer A map between the surfaces of two objects allows the transfer of detail from one object to another [81,99,121], or the interpolation between the shape and appearance of several objects [2,63,66,71,109]. By varying the interpolation ratios over time, one can produce morphing animations.…”

Section: 1)mentioning

confidence: 99%

“…By varying the interpolation ratios over time, one can produce morphing animations. In spatially varying and frequency-varying morphs, the rate of change can be different for different parts of the objects, or different frequency bands (coarseness of the features being transformed) [63,66,71]. Such a map can either be computed directly or, as more commonly done, computed by mapping both object surfaces to a common domain (Sections 5 and 6).…”

Section: 1)mentioning

confidence: 99%

See 1 more Smart Citation

Mesh Parameterization Methods and Their Applications

Sheffer

Praun

Rose

2006

FNT in Computer Graphics and Vision

371

118

View full text Add to dashboard Cite

We present a survey of recent methods for creating piecewise linear mappings between triangulations in 3D and simpler domains such as planar regions, simplicial complexes, and spheres. We also discuss emerging tools such as global parameterization, inter-surface mapping, and parameterization with constraints. We start by describing the wide range of applications where parameterization tools have been used in recent years. We then briefly review the pertinent mathematical background and terminology, before proceeding to survey the existing parameterization techniques. Our survey summarizes the main ideas of each technique and discusses its main properties, comparing it to other methods available. Thus it aims to provide guidance to researchers and developers when assessing the suitability of different methods for various applications. This survey focuses on the practical aspects of the methods available, such as time complexity and robustness and shows multiple examples of parameterizations generated using different methods, allowing the reader to visually evaluate and compare the results.

show abstract

Section: 1)mentioning

confidence: 99%

Section: 1)mentioning

confidence: 99%

Mesh Parameterization Methods and Their Applications

Sheffer

Praun

Rose

2006

FNT in Computer Graphics and Vision

371

118

View full text Add to dashboard Cite

show abstract

“…Mesh parameterization methods that can achieve mappings to satisfy the constraint on semantic feature correspondences will be useful for several DGP applications [10]. A more general approach is to parameterize the meshes onto a common base mesh [11]- [14]. These techniques accelerate the convenience of the parameterization between meshes since the use of a common base mesh is suitable for creating a map from one mesh to another with semantic feature correspondences.…”

Section: Related Workmentioning

confidence: 99%

3D Triangular Mesh Parameterization with Semantic Features Based on Competitive Learning Methods

Matsui

Aoki

Nagahashi

2008

IEICE Transactions on Information and Systems

View full text Add to dashboard Cite

Shun MATSUI† , Kota AOKI †a) , and Hiroshi NAGAHASHI †b) , Members SUMMARY In 3D computer graphics, mesh parameterization is a key technique for digital geometry processings such as morphing, shape blending, texture mapping, re-meshing and so on. Most of the previous approaches made use of an identical primitive domain to parameterize a mesh model. In recent works of mesh parameterization, more flexible and attractive methods that can create direct mappings between two meshes have been reported. These mappings are called "cross-parameterization" and typically preserve semantic feature correspondences between target meshes. This paper proposes a novel approach for parameterizing a mesh into another one directly. The main idea of our method is to combine a competitive learning and a least-square mesh techniques. It is enough to give some semantic feature correspondences between target meshes, even if they are in different shapes or in different poses.

show abstract

“…Cross parameterizations determine a bijective mapping between a source mesh and a target mesh. Many of the existing approaches [30,21,3,22] require that the source and target be of the same genus. The methods of [30,21] find compatible base triangulations on the input models.…”

Section: Related Workmentioning

confidence: 99%

Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps

House

Singh²

2007

15th Pacific Conference on Computer Graphics and Applications (PG'07)

View full text Add to dashboard Cite

We consider the problem of generating a map between two triangulated meshes, M and M ', with arbitrary and possibly differing genus. This problem has rarely been tackled in its generality. Early schemes considered only topological spheres. Recent algorithms allow inputs with an arbitrary number of tunnels but require M and M ' to have equal genus, mapping tunnel to tunnel. Other schemes which allow more general inputs are not guaranteed to work and the authors do not provide a characterization of the input meshes that can be processed successfully. Moreover, the techniques have difficulty dealing with coarse meshes with many tunnels.In this paper we present the first robust approach to build a map between two meshes of arbitrary unequal genus. We also provide a simplified method for setting the initial alignment between M and M ', reducing reliance on landmarks and allowing the user to select "landmark tunnels" in addition to the standard landmark vertices. After computing the map, we automatically derive a continuous deformation from M to M ' using a variational implicit approach to describe the evolution of non-landmark tunnels.Overall, we achieve a cross parameterization scheme that is provably robust in the sense that it can map M to M ' without constraints on their relative genus or on the density of the triangulation with respect to the number of tunnels. To demonstrate the practical effectiveness of our scheme we provide a number of examples of inter-surface parameterizations between meshes of different genus and shape.

show abstract

Multiresolution mesh morphing

Cited by 211 publications

References 33 publications

Mesh Parameterization Methods and Their Applications

Mesh Parameterization Methods and Their Applications

3D Triangular Mesh Parameterization with Semantic Features Based on Competitive Learning Methods

Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps

Contact Info

Product

Resources

About