Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347)
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 7255767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently testing digital convexity and recognizing digital convex polygons |
scientific article; zbMATH DE number 7255767 |
Statements
Efficiently testing digital convexity and recognizing digital convex polygons (English)
0 references
6 October 2020
0 references
digital geometry
0 references
digital convexity
0 references
convex
0 references
digital polyhedron
0 references
digital polyhedron recognition
0 references
quickhull
0 references
polygonal separation
0 references
0 references
0 references
0 references
0 references
0 references
0.958647847175598
0 references
0.7925167679786682
0 references
