Computing the minimal perimeter polygon for digital objects in the triangular tiling (Q6671384)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7974861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the minimal perimeter polygon for digital objects in the triangular tiling |
scientific article; zbMATH DE number 7974861 |
Statements
Computing the minimal perimeter polygon for digital objects in the triangular tiling (English)
0 references
27 January 2025
0 references
minimum perimeter polygon
0 references
triangular mosaic
0 references
triangular tiling
0 references
boundary tracing for triangular pixels
0 references
relative convex hull
0 references
geodesic convex hull
0 references
regular complex of triangular tiles
0 references
0 references
0 references
0 references
0.778225302696228
0 references
0.7620063424110413
0 references
0.7549958229064941
0 references
0.7524934411048889
0 references
