On decomposing polygons into uniformly monotone parts

Authors

Robin Liu, New Jersey Institute of Technology
Simeon Ntafos, The University of Texas at Dallas

Document Type

Article

Publication Date

2-29-1988

Abstract

In this paper we present an O(n³) 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. © 1988.

Identifier

0023965047 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/0020-0190(88)90097-X

ISSN

00200190

First Page

85

Last Page

89

Issue

2

Volume

27

Recommended Citation

Liu, Robin and Ntafos, Simeon, "On decomposing polygons into uniformly monotone parts" (1988). Faculty Publications. 20868.
https://digitalcommons.njit.edu/fac_pubs/20868