A counterexample to an algorithm for computing monotone hulls of simple polygons (Q3667966)
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 counterexample to an algorithm for computing monotone hulls of simple polygons |
scientific article; zbMATH DE number 3821126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A counterexample to an algorithm for computing monotone hulls of simple polygons |
scientific article; zbMATH DE number 3821126 |
Statements
A counterexample to an algorithm for computing monotone hulls of simple polygons (English)
0 references
1983
0 references
convex hull
0 references
monotone hull
0 references
maximal polygons
0 references
simple polygons
0 references
computational geometry
0 references
pattern recognition
0 references
