A new algorithm for computing the convex hull of a planar point set (Q926679): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1631/jzus.2007.A1210 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1631/jzus.2007.a1210 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020591635 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1631/JZUS.2007.A1210 / rank | |||
Normal rank | |||
Latest revision as of 08:22, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for computing the convex hull of a planar point set |
scientific article |
Statements
A new algorithm for computing the convex hull of a planar point set (English)
0 references
20 May 2008
0 references
computational geometry
0 references
convex hull
0 references
extreme points
0 references
ordered convex hull point sequence
0 references
algorithm
0 references
time complexity
0 references
0 references
0 references
