Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set

Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal

Abstract: Chvátal and Klincsek (1980) gave an O(n3)-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set P of n points in the plane. This paper examines a g...