Hierarchy of surface models and irreducible triangulations.

DOI10.1016/j.comgeo.2003.07.001zbMath1040.65016OpenAlexW2015829893WikidataQ62041843 ScholiaQ62041843MaRDI QIDQ1428114

Sheung-Hung Poon, Siu-Wing Cheng, Tamal Krishna Dey

Publication date: 14 March 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2003.07.001

zbMATH Keywords

greedy algorithmcomputer graphicshomology2-manifoldedge contractionirreducible triangulationsurface simplificationsurface triangulationshierarchy of surface models

Mathematics Subject Classification ID

Related Items (9)

Subgraph densities in a surface ⋮ Irreducible triangulations of surfaces with boundary ⋮ RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS ⋮ The complexity of contracting bipartite graphs into small cycles ⋮ The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases ⋮ On graph contractions and induced minors ⋮ A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\) ⋮ On the maximum number of cliques in a graph embedded in a surface ⋮ Irreducible triangulations are small

Cites Work

• All 2-manifolds have finitely many minimal triangulations
• Optimal Search in Planar Subdivisions
• Note on irreducible triangulations of surfaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hierarchy of surface models and irreducible triangulations.