Removing Outliers to Minimize Area and Perimeter

We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c + log n time algorithm that solves this problem when "smallest" is taken to mean least area or least perimeter.

• Type: Conference
• Year: 2006
• Where: CCCG
• Authors: Rossen Atanassov, Pat Morin, Stefanie Wuhrer
• Keywords: CCCG 2006, CCCG 2007, Point Set, Smallest Possible Convex