An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (Q2868910): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57659433, #quickstatements; #temporary_batch_1705549208013 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:27, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves |
scientific article |
Statements
An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (English)
0 references
19 December 2013
0 references
geometric computing
0 references
convex hull algorithms
0 references
gift-wrapping algorithm
0 references
method of orienting curves
0 references
