The implementation of an algorithm to find the convex hull of a set of three-dimensional points (Q3358263): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q128028533, #quickstatements; #temporary_batch_1723663638014 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/77635.77640 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964233522 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128028533 / rank | |||
Normal rank | |||
Latest revision as of 20:55, 14 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The implementation of an algorithm to find the convex hull of a set of three-dimensional points |
scientific article |
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
