A simple algorithm for building the 3-D convex hull (Q2266570)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3894384
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple algorithm for building the 3-D convex hull |
scientific article; zbMATH DE number 3894384 |
Statements
A simple algorithm for building the 3-D convex hull (English)
0 references
1983
0 references
This paper discusses an algorithm for finding the convex hull of a finite set of distinct points in 3-dimensional space. The algorithm is described at a 'high-level' and theoretical complexity bounds are discussed; however, no experimental results are provided.
0 references
stepwise refinement
0 references
minimum convex polyhedron
0 references
convex hull
0 references
complexity bounds
0 references
0.7327548861503601
0 references
0.7279967069625854
0 references
0.690190315246582
0 references
0.6790375113487244
0 references
0.6712877750396729
0 references
