Texture Mapping with Hard Constraints

Eckstein, Ilya; Surazhsky, Vitaly; Gotsman, Craig

doi:10.1111/1467-8659.00502

Cited by 44 publications

(41 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However it did not provide a valid parameterization for situations where there are a large number of constraints. Hard constraints were further studied in [4], [16], since a perfect alignment of texture is essential at certain delicate places of a mesh. Tang et al [17] proposed a RBF-based parameterisation method.…”

Section: A Related Workmentioning

confidence: 99%

Constrained Texture Mapping and Foldover-Free Condition

Yu¹,

Yang²,

Zhang³

2013

IJCTE

View full text Add to dashboard Cite

Abstract-Texture mapping has been widely used in image processing and graphics to enhance the realism of CG scenes. However to perfectly match the feature points of a 3D model with the corresponding pixels in texture images, the parameterisation which maps a 3D mesh to the texture space must satisfy the positional constraints. Despite numerous research efforts, the construction of a mathematically robust foldover-free parameterisation subject to internal constraints is still a remaining issue. In this paper, we address this challenge by developing a two-step parameterisation method. First, we produce an initial parameterisation with a method traditionally used to solve structural engineering problems, called the bar-network. We then derive a mathematical foldover-free condition, which is incorporated into a Radial Basis Function based scheme. This method is therefore able to guarantee that the resulting parameterization meets the hard constraints without foldovers.Index Terms-Foldover, constrained texture mapping, parameterization. I. INTRODUCTIONTexture mapping is an effective means in image processing and graphics to achieve improved visual realism. Existing research has largely concentrated on the production of planar parameterization [1]- [7] in order to map a 3D mesh to the planar domain. Most recent works are concerned with texture distortion reduction when mapping a planar image (texture) to a curved surface. Although this is an important issue, in practice the animator is also challenged with other problems in texture mapping. One of them is to register a texture map accurately with the features of a 3D model. For example, if one is to texture map a human face, in addition to reducing texture distortion, one has to ensure the important feature points and lines on the 3D model match those on the texture plane during the mapping process, such as the eyes, nose, eyebrows and lips. In another word, one needs to accurately register the 3D features with their 2D counterparts.With the current production practice, this registration operation is almost completely manual. Once a texture map is generated by animation software, the animator has to painstakingly tweak the unwrapped mesh on the texture plane to align the key feature points on the texture image with the 3D features. He/she has to manually move many vertices around each feature in order to avoid texture distortion being concentrated and visible. This is a timeconsuming task. Manuscript received September 18, 2012; revised December 7, 2012. The authors are with the National Center for Computer Animation, Bournemouth University, Poole, UK. (email:cnyuhc@yahoo.com, xyang@bournemouth.ac.uk, jzhang@bournemouth.ac.uk).Attempts have been made to formulate it as a constrained optimization problem [3]- [5], [7] where the important features in the texture images are to be located correctly on the 3D surface. Despite varying degree of success, a key issue yet to be solved is there is currently no robust solution to controlling the spread of the mesh points such th...

show abstract

Section: A Related Workmentioning

confidence: 99%

Constrained Texture Mapping and Foldover-Free Condition

Yu¹,

Yang²,

Zhang³

2013

IJCTE

View full text Add to dashboard Cite

show abstract

“…The most important application of constrained parameterization is texture mapping 3D models from photographs [29,68,76]. Zhou et al [139] go further and allow the user to combine several images to produce a complete texture for a mesh.…”

Section: Constraintsmentioning

confidence: 99%

“…Methods that enforce hard constraints therefore modify the provided meshes by inserting a few new Steiner vertices [29,68] or by complete remeshing [99].…”

Section: Constraintsmentioning

confidence: 99%

Mesh Parameterization Methods and Their Applications

Sheffer

Praun

Rose

2006

FNT in Computer Graphics and Vision

383

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

“…Lévy [13] texture maps meshes under soft constraints by introducing additional terms in the quality metric. Eckstein et al [2] propose a method for satisfying hard constraints for planar parameterization.…”

Section: Previous Workmentioning

confidence: 99%

Consistent Spherical Parameterization

Asirvatham

Praun

Hoppe

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Many applications benefit from surface parameterization, including texture mapping, morphing, remeshing, compression, object recognition, and detail transfer, because processing is easier on the domain than on the original irregular mesh. We present a method for simultaneously parameterizing several genus-0 meshes possibly with boundaries onto a common spherical domain, while ensuring that corresponding user-highlighted features on each of the meshes map to the same domain locations. We obtain visually smooth parameterizations without any cuts, and the constraints enable us to directly associate semantically important features such as animal limbs or facial detail. Our method is robust and works well with either sparse or dense sets of constraints.

show abstract

Texture Mapping with Hard Constraints

Cited by 44 publications

References 14 publications

Constrained Texture Mapping and Foldover-Free Condition

Constrained Texture Mapping and Foldover-Free Condition

Mesh Parameterization Methods and Their Applications

Consistent Spherical Parameterization

Contact Info

Product

Resources

About