High quality compatible triangulations

Authors:
V. Surazhsky;C. Gotsman
Affiliations:
Oslo University, Department of Informatics, Oslo, Norway;Technion—Israel Institute of Technology, Center for Graphics and Geometric Computing, Department of Computer Science, 32000, Haifa, Israel
Venue:
Engineering with Computers
Year:
2004

Citing 0
Cited 4

Geodesics-Based One-to-One Parameterization of 3D Triangle Meshes

IEEE MultiMedia
Mesh Topological Optimization for Improving Piecewise-Linear Image Registration

Journal of Mathematical Imaging and Vision
Sketch based image deformation and editing with guaranteed feature correspondence

Proceedings of the 10th International Conference on Virtual Reality Continuum and Its Applications in Industry
Embedding a triangular graph within a given boundary

Computer Aided Geometric Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Compatible meshes are isomorphic meshings of the interiors of two polygons having a correspondence between their vertices. Compatible meshing may be used for constructing sweeps, suitable for finite element analysis, between two base polygons. They may also be used for meshing a given sequence of polygons forming a sweep. We present a method to compute compatible triangulations of planar polygons, sometimes requiring extra (Steiner) vertices. Experimental results show that for typical real-life inputs, the number of Steiner vertices introduced is very small. However, having a small number of Steiner vertices, these compatible triangulations are usually not of high quality, i.e. they do not have well-shaped triangles. We show how to increase the quality of these triangulations by adding Steiner vertices in a compatible manner, using remeshing and mesh smoothing techniques. The total scheme results in high-quality compatible meshes with a small number of triangles. These meshes may then be morphed to obtain the intermediate triangulated sections of a sweep, if needed.