No label defined (Q4945512)
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 1424299
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1424299 |
Statements
29 August 2000
0 references
polygon decomposition
0 references
0.824658989906311
0 references
0.8107399344444275
0 references
0.7930548787117004
0 references
The author gives a brief survey of the main topics in polygon decomposition. Partitioning a polygon into simpler subpolygons comes very usefull in practice. The application determines the type of subpolygons, which are in use, for example convex subpolygons, spiral subpolygons, star-shaped subpolygons, monotone subpolygons or other subpolygons. Much of the work done concerning covering general polygons has involved convex or star-shaped components. The problem of covering a polygon with the minimum number of convex subpolygons finds application in syntactic pattern recognition. The problem of covering a polygon with star-shaped subpolygons has often been investigated as the problem of guarding an art gallery. The author turns his attention to the problem of decomposing and covering orthogonal polygons (for example squares, orthogonal convex, star-shaped or other subpolygons). For the entire collection see [Zbl 0930.65001].
0 references