FINDING A MAXIMUM SET OF INDEPENDENT CHORDS IN A CIRCLE
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
DOI
10.1016/0020-0190(92)90262-T
Abstract
In this note we propose an O(nm) algorithm for finding a maximum independent set of m chords which are incident to , vertices on a circle. This result can be applied to improving the time complexity of the algorithm for partitioning simple polygons into a minimum number of uniformly monotone polygons.