Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time (Q6569247)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time |
scientific article; zbMATH DE number 7878345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time |
scientific article; zbMATH DE number 7878345 |
Statements
Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time (English)
0 references
8 July 2024
0 references
closed cone
0 references
discrete fracture network
0 references
polygon of adjacent vertices
0 references
Steiner points
0 references
triangulation of polyhedra
0 references
0 references
0 references
0.7744336128234863
0 references
0.7388726472854614
0 references
0.7374255657196045
0 references
