Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes (Q1972268): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002110050475 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079386274 / rank | |||
Normal rank | |||
Revision as of 01:39, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes |
scientific article |
Statements
Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes (English)
0 references
5 December 2000
0 references
This paper concerns the simplex refinement algorithm of \textit{H. Freudenthal} [Ann. of Math., II. Ser. 43, 580-582 (1942; Zbl 0060.40701)]. The algorithm subdivides any given \((n)\)-simplex into \(2^n\) subsimplices in such a way that recursive application results in a hierarchy of consistent triangulations. The investigations concentrate in particular on the number of congruence classes generated by recursive refinements.
0 references
simplicial grid
0 references
simplex refinement algorithm
0 references
triangulations
0 references
