The implementation of an algorithm to find the convex hull of a set of three-dimensional points (Q3358263)
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: The implementation of an algorithm to find the convex hull of a set of three-dimensional points |
scientific article; zbMATH DE number 4211548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The implementation of an algorithm to find the convex hull of a set of three-dimensional points |
scientific article; zbMATH DE number 4211548 |
Statements
The implementation of an algorithm to find the convex hull of a set of three-dimensional points (English)
0 references
1990
0 references
object modelling
0 references
divide and conquer
0 references
edge structure
0 references
tetrahedron
0 references
triangulation
0 references
implementation in Pascal
0 references
three-dimensional convex hull algorithm
0 references
0 references
0 references
0.8963335
0 references
0 references
0.89178705
0 references
0.8865499
0 references
0.8848546
0 references
