CONY, an algorithm for a nonoverlapping covering of a nonconvex multipy connected polygon by simply connected sets. (Q2756442)
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: CONY, an algorithm for a nonoverlapping covering of a nonconvex multipy connected polygon by simply connected sets. |
scientific article; zbMATH DE number 1673004
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | CONY, an algorithm for a nonoverlapping covering of a nonconvex multipy connected polygon by simply connected sets. |
scientific article; zbMATH DE number 1673004 |
Statements
12 November 2001
0 references
CONY, an algorithm for a nonoverlapping covering of a nonconvex multipy connected polygon by simply connected sets. (English)
0 references
