Mesh Colorization

Leifman, George; Tal, Ayellet

Mesh Colorization

Date

2012

Authors

Leifman, George
Tal, Ayellet

Publisher

The Eurographics Association and John Wiley and Sons Ltd.

Abstract

This paper proposes a novel algorithm for colorization of meshes. This is important for applications in which the model needs to be colored by just a handful of colors or when no relevant image exists for texturing the model. For instance, archaeologists argue that the great Roman or Greek statues were full of color in the days of their creation, and traces of the original colors can be found. In this case, our system lets the user scribble some desired colors in various regions of the mesh. Colorization is then formulated as a constrained quadratic optimization problem, which can be readily solved. Special care is taken to avoid color bleeding between regions, through the definition of a new direction field on meshes.

        @article{10.1111:j.1467-8659.2012.03021.x
,
journal = {Computer Graphics Forum},
title = {{Mesh Colorization
}},
author = {Leifman, George and 
Tal, Ayellet
},
year = {2012
},
publisher = {The Eurographics Association and John Wiley and Sons Ltd.
},
ISSN = {1467-8659
},
DOI = {10.1111/j.1467-8659.2012.03021.x
}
}

URI

https://doi.org/10.1111/j.1467-8659.2012.03021.x

Collections

31-Issue 2
Full Papers 2012 - CGF 31-Issue 2

Full item page