On decomposing polygons into uniformly monotone parts (Q1108793)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On decomposing polygons into uniformly monotone parts |
scientific article |
Statements
On decomposing polygons into uniformly monotone parts (English)
0 references
1988
0 references
We present an \(O(n^ 3)\) algorithm for finding a maximum set of independent chords in a circle with n vertices on its circumference. We use this result to partition simple polygons into the minimum number of uniformly monotone polygons. Two or more polygons are uniformly monotone if they are monotone with respect to a common axis.
0 references
polygon decomposition
0 references
computational geometry
0 references
monotone polygons
0 references
0 references
