Minimal simplicial dissections and triangulations of convex 3-polytopes (Q1577546): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Q588087 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Peter McMullen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s004540010058 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1981943800 / rank | |||
Normal rank |
Revision as of 20:55, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimal simplicial dissections and triangulations of convex 3-polytopes |
scientific article |
Statements
Minimal simplicial dissections and triangulations of convex 3-polytopes (English)
0 references
4 January 2001
0 references
The authors prove here the following somewhat surprising results about convex 3-polytopes. Let \(P\) be such a polytope. First, it is possible that the minimum number of tetrahedra in a triangulation of \(P\) can be reduced if one permits interior vertices. Second, there may be dissections of \(P\) into tetrahedra which use fewer tetrahedra than any triangulation. Third, the number of tetrahedra in a minimal triangulation of \(P\) may depend on the geometrical realization of \(P\) (as a combinatorial type). The families of examples they produce exhibit increasing large discrepancies.
0 references
dissection
0 references
geometric realization
0 references
convex 3-polytopes
0 references
triangulation
0 references