An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092)
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: An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in R^n |
scientific article; zbMATH DE number 7290726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) |
scientific article; zbMATH DE number 7290726 |
Statements
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (English)
0 references
6 January 2021
0 references
convex hull computation
0 references
gift wrapping algorithm
0 references
orienting curves method
0 references
0 references
0 references
0 references
0 references
0.849854052066803
0 references
0.7918047904968262
0 references
0.7882571220397949
0 references
