SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Using semi-regular 4-8 meshes for subdivision surfaces
Journal of Graphics Tools
Interactive geometry remeshing
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Proceedings of the conference on Visualization '01
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
The distance of a subdivision surface to its control polyhedron
Journal of Approximation Theory
Editing operations for irregular vertices in triangle meshes
ACM SIGGRAPH Asia 2010 papers
Connectivity editing for quadrilateral meshes
Proceedings of the 2011 SIGGRAPH Asia Conference
| Hi-index | 0.00 |
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.