“Matchmaker: constructing constrained texture maps” by Kraevoy, Sheffer and Gotsman

  • ©Vladislav Kraevoy, Alla Sheffer, and Craig Gotsman




    Matchmaker: constructing constrained texture maps



    Texture mapping enhances the visual realism of 3D models by adding fine details. To achieve the best results, it is often necessary to force a correspondence between some of the details of the texture and the features of the model.The most common method for mapping texture onto 3D meshes is to use a planar parameterization of the mesh. This, however, does not reflect any special correspondence between the mesh geometry and the texture. The Matchmaker algorithm presented here forces user-defined feature correspondence for planar parameterization of meshes. This is achieved by adding positional constraints to the planar parameterization. Matchmaker allows users to introduce scores of constraints while maintaining a valid one-to-one mapping between the embedding and the 3D surface. Matchmaker’s constraint mechanism can be used for other applications requiring parameterization besides texture mapping, such as morphing and remeshing.Matchmaker begins with an unconstrained planar embedding of the 3D mesh generated by conventional methods. It moves the constrained vertices to the required positions by matching a triangulation of these positions to a triangulation of the planar mesh formed by paths between constrained vertices. The matching triangulations are used to generate a new parameterization that satisfies the constraints while minimizing the deviation from the original 3D geometry.


    1. ALEXA, M. 2000 Merging Polyhedral Shapes with Scattered Features, The Visual Computer 16, 26–37.Google ScholarDigital Library
    2. DE BERG, M., VAN KREVELD, M., OVERMARS, M., AND SCHWARZKOPF, O., Eds. 2000. Computational Geometry, 2nd ed. Springer.Google Scholar
    3. BIERMANN, H., MARTIN, I., BERNARDINI, F., AND ZORIN, D. 2002. Cut-and-paste Editing of Multiresolution Surfaces. ACM Transactions on Graphics, 21, 3, 312–321. Google ScholarDigital Library
    4. CYBERWARE INC., http://www.cyberware.comGoogle Scholar
    5. DESBRUN, M., MEYER, M., AND ALLIEZ, P. 2002. Intrinsic Parametrizations of Surface Meshes. In Proceedings of Eurographics 2002, Blackwell Publishing, Saarbrucken, G. Drettakis and H.-P. Seidel, Eds., Computer Graphics forum, 21, 3, 210–218.Google Scholar
    6. ECK, M., DEROSE, T., DUCHAMP, T., HOPPE, H., LOUNSBERY, M., AND STUETZLE, W. 1995. Multiresolution Analysis of Arbitrary Meshes. In Proceedings of ACM SIGGRAPH 1995, Computer Graphics Proceedings, Annual Conference Proceedings, 173–182. Google Scholar
    7. ECKSTEIN, I., SURAZHSKY, V., AND, GOTSMAN, C. 2001. Texture Mapping with Hard Constraints, Computer Graphics Forum 20, 3, 95–104.Google ScholarCross Ref
    8. FLOATER, M. S. 1997. Parameterization and Smooth Approximation of Surface Triangulation, Computer Aided Geometric Design, 14, 231–250. Google ScholarDigital Library
    9. GU, X., GORTLER, S., AND HOPPE, H. 2002. Geometry Images. ACM Transactions on Graphics, 21, 3, 355–361. Google ScholarDigital Library
    10. GUENTER, B., GRIM, C., WOOD, D., MALVAR, H., AND PIGHIN, F. 1998. Making Faces. In Proceedings of ACM SIGGRAPH 1998, Computer Graphics Proceedings, Annual Conference Proceedings, 55–66. Google Scholar
    11. HAKER, S., ANGENENT, S., TANNENBAUM, A., KIKINIS, R., SAPIRO, G., AND HALLE, M. 2000. Conformal Surface Parameterization for Texture Mapping. IEEE Transactions on Visualization and Computer Graphics, 6, 2, 181–189. Google ScholarDigital Library
    12. HORMANN, K., AND GREINER, G. 1999. MIPS – An Efficient Global Parametrization Method. In Curve and Surface Design Conference Proceedings 1999, 153–162.Google Scholar
    13. HURDAL, M., BOWERS, P., STEPHENSON, K., SUMNERS, D., REHMS, I. K., SCHAPER, K., AND ROTTENBERG, D. 1999. Quasi-conformally Flat Mapping the Human Cerebellum. In Proceedings of MICCAI’99, volume 1679 of Lecture Notes in Computer Science, 279–286, Springer-Verlag. Google ScholarDigital Library
    14. LÉVY, B. Constrained Texture Mapping for Polygonal Meshes. In Proceedings of ACM SIGGRAPH 2001, Computer Graphics Proceedings, Annual Conference Proceedings, 417–424. Google Scholar
    15. LÉVY, B., AND MALLET, J. L. 1998. Non-distorted Texture Mapping for Sheared Triangulated Meshes. In Proceedings of ACM SIGGRAPH 1998, Computer Graphics Proceedings, Annual Conference Proceedings, 343–352. Google Scholar
    16. LÉVY, B., PETITJEAN, S., RAY, N., AND MAILLOT, J. 2002. Least Squares Conformal Maps for Automatic Texture Atlas Generation. ACM Transactions on Graphics, 21, 3, 362–371. Google ScholarDigital Library
    17. MAILLOT, J., YAHIA, H., AND VERROUST, A. 1993. Interactive Texture Mapping. In Proceedings of ACM SIGGRAPH 1993, Computer Graphics Proceedings, Annual Conference Proceedings, 27–34. Google Scholar
    18. PACH, J., AND WENGER, R. 1998. Embedding Planar Graphs with Fixed Vertex Locations. In Proceedings of Graph Drawing ’98. Lecture Notes in Computer Science 1547, Springer-Verlag, 263–274. Google ScholarDigital Library
    19. PRAUN, E., SWELDENS, W., AND SCHRÖDER, P. 2001. Consistent Mesh Parameterizations. In Proceedings of ACM SIGGRAPH 2001, E. Fiume, Ed., Computer Graphics Proceedings, Annual Conference Proceedings, 179–184. Google Scholar
    20. SANDER, P., GORTLER, S., SNYDER, J., AND HOPPE, H. 2002. Signal-specialized Parametrization. In Proceedings of Eurographics Workshop on Rendering 2002. Google ScholarDigital Library
    21. SANDER, P. V., SNYDER, J., GORTLER, S., AND HOPPE, H. 2001. Texture Mapping Progressive Meshes. In Proceedings of ACM SIGGRAPH 2001, Computer Graphics Proceedings, Annual Conference Proceedings, 409–416. Google Scholar
    22. SHEFFER, A., ANDDE STURLER, E. 2000. Surface Parameterization for Meshing by Triangulation Flattening. In Proceedings of the 9th International Meshing Roundtable, 161–172.Google Scholar
    23. SHEFFER, A., AND HART, J. 2002. Seamster: Inconspicuous Low-Distortion Texture Seam Layout, Proceedings of IEEE Visualization, 291–298. Google ScholarDigital Library
    24. SHEWCHUK, J. R. Triangle: A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator. http://www.cs.cmu.edu/~quake/triangle.htmlGoogle Scholar
    25. SOLER, C., CANI, M. P., AND ANGELIDIS, A. 2002. Hierarchical Pattern Mapping. ACM Transactions on Graphics, 21, 3, 673–680. Google ScholarDigital Library
    26. TUTTE, W. T. How to Draw a Graph, 1963, Proceedings of the London Mathematical Society, 13, 743–768.Google ScholarCross Ref

ACM Digital Library Publication: