Proceedings: GI 2012

5-6-7 meshes

Nima Aghda , Hamid Younesy , Hao Zhang

Proceedings of Graphics Interface 2012: Toronto, Ontario, Canada, 28 - 30 May 2012, 27-34

DOI 10.20380/GI2012.04

  • Bibtex

    @inproceedings{Aghda:2012:10.20380/GI2012.04,
    author = {Aghda, Nima and Younesy, Hamid and Zhang, Hao},
    title = {5-6-7 meshes},
    booktitle = {Proceedings of Graphics Interface 2012},
    series = {GI 2012},
    year = {2012},
    issn = {0713-5424},
    isbn = {978-1-4503-1420-6},
    location = {Toronto, Ontario, Canada},
    pages = {27--34},
    numpages = {8},
    doi = {10.20380/GI2012.04},
    publisher = {Canadian Human-Computer Communications Society},
    address = {Toronto, Ontario, Canada},
    }

Abstract

We introduce a new type of meshes called 5-6-7 meshes. For many mesh processing tasks, low- or high-valence vertices are undesirable. At the same time, it is not always possible to achieve complete vertex valence regularity, i.e., to only have valence-6 vertices. A 5-6-7 mesh is a closed triangle mesh where each vertex has valence 5, 6, or 7. An intriguing question is whether it is always possible to convert an arbitrary mesh into a 5-6-7 mesh. In this paper, we answer the question in the positive. We present a 5-6-7 remeshing algorithm which converts a closed triangle mesh with arbitrary genus into a 5-6-7 mesh which a) closely approximates the original mesh geometrically, e.g., in terms of feature preservation, and b) has a comparable vertex count as the original mesh. We demonstrate the results of our remeshing algorithm on meshes with sharp features and different topology and complexity.