Minimal simplicial dissections and triangulations of convex 3-polytopes

DOI10.1007/S004540010058zbMATH Open0966.52009OpenAlexW1981943800MaRDI QIDQ1577546FDOQ1577546

Authors: 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

Recommendations

• Extremal properties for dissections of convex 3-polytopes
• scientific article; zbMATH DE number 2123350
• scientific article; zbMATH DE number 5642599
• Approximation for minimum triangulations of simplicial convex 3-polytopes

zbMATH Keywords

triangulationgeometric realizationdissectionconvex 3-polytopes

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10)

Cited In (18)

• Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
• MINIMAL DISSECTIONS OF BORDERED MANIFOLDS
• What is known about unit cubes
• On primitive subdivisions of an elementary tetrahedron.
• Classifying simplicial dissections of convex polyhedra with symmetry
• Title not available (Why is that?)
• On minimal triangulations of products of convex polygons
• Extremal properties for dissections of convex 3-polytopes
• The vertex-preserving simplicial dissection of convex polytopes
• Title not available (Why is that?)
• ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
• Decompositions and boundary coverings of non-convex fat polyhedra
• On 3-triangulation of toroids
• Title not available (Why is that?)
• Minimizing visible edges in polyhedra
• A polytopal generalization of Sperner's lemma
• Computational geometry column 40
• Lower bounds for the simplexity of the \(n\)-cube

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577546)