Minimal simplicial dissections and triangulations of convex 3-polytopes

DOI10.1007/s004540010058zbMath0966.52009OpenAlexW1981943800MaRDI QIDQ1577546

N. Delaunay

Publication date: 4 January 2001

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004540010058

zbMATH Keywords

triangulationgeometric realizationdissectionconvex 3-polytopes

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10)

Related Items (8)

Classifying Simplicial Dissections of Convex Polyhedra with Symmetry ⋮ Approximating the minimum triangulation of convex 3-polytopes with bounded degrees ⋮ ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS ⋮ Minimizing visible edges in polyhedra ⋮ COMPUTATIONAL GEOMETRY COLUMN 40 ⋮ Lower bounds for the simplexity of the \(n\)-cube ⋮ What is known about unit cubes ⋮ A polytopal generalization of Sperner's lemma

This page was built for publication: Minimal simplicial dissections and triangulations of convex 3-polytopes