Triangulation of scattered data in 3D space (Q1823604)
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: Publication:1823604 |
scientific article; zbMATH DE number 4115812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triangulation of scattered data in 3D space |
scientific article; zbMATH DE number 4115812 |
Statements
Triangulation of scattered data in 3D space (English)
0 references
1988
0 references
Suppose a set of points is read off from a surface, a torus, say. The problem is to find a triangulation of those points that in some sense produces optimally shaped triangles. This paper presents a detailed algorithm for the triangulation task and also proposes a criterion to determine ``optimally shaped'' triangles, i.e., triangles such that the polyhedron formed by them is as smooth as possible.
0 references
scattered data
0 references
triangulation
0 references
optimally shaped triangles
0 references
0.8267020583152771
0 references
0.824212908744812
0 references
0.8194637894630432
0 references
