Finding a maximum set of independent chords in a circle

Abstract Chang, R.C. and H.S. Lee, Finding a maximum set of independent chords in a circle, Information Processing Letters 41 (1992) 99-102. In this note we propose an O(nmI algorithm for finding a maximum independent set of m chords which are incident to n 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