A linear-time algorithm to compute the triangular hull of a digital object (Q528337)
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: A linear-time algorithm to compute the triangular hull of a digital object |
scientific article; zbMATH DE number 6714927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm to compute the triangular hull of a digital object |
scientific article; zbMATH DE number 6714927 |
Statements
A linear-time algorithm to compute the triangular hull of a digital object (English)
0 references
12 May 2017
0 references
triangular hull
0 references
triangular convex hull
0 references
triangular polygon
0 references
shape analysis
0 references
combinatorics
0 references
0 references
0.91635275
0 references
0.88047385
0 references
0 references
0.87551826
0 references
0.8754022
0 references
0.87249917
0 references
