Convex combination maps over triangulations, tilings, and tetrahedral meshes

DOI10.1007/s10444-004-7620-5zbMath1101.05028OpenAlexW2046729013MaRDI QIDQ2509165

Michael S. Floater, Valérie Pham-Trong

Publication date: 18 October 2006

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-004-7620-5

zbMATH Keywords

discrete maximum principleparameterizationplanar embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Harmonic maps, etc. (58E20) Graph algorithms (graph-theoretic aspects) (05C85) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (6)

A Novel Algorithm for Volume-Preserving Parameterizations of 3-Manifolds ⋮ Embedding a triangular graph within a given boundary ⋮ A New Efficient Algorithm for Volume-Preserving Parameterizations of Genus-One 3-Manifolds ⋮ 27 variants of Tutte's theorem for plane near-triangulations and an application to periodic spline surface fitting ⋮ Computing locally injective mappings by advanced MIPS ⋮ Discrete one-forms on meshes and applications to 3D mesh parameterization

Cites Work

• Unnamed Item
• How to morph tilings injectively
• Parametrization and smooth approximation of surface triangulations
• Tutte's barycenter method applied to isotopies
• One-to-one piecewise linear mappings over triangulations
• How to Draw a Graph

This page was built for publication: Convex combination maps over triangulations, tilings, and tetrahedral meshes