A New Highly Efficient Preprocessing Algorithm for Convex Hull, Maximum Distance and Minimal Bounding Circle in E2: Efficiency Analysis

This contribution describes an efficient and simple preprocessing algorithm for finding a convex hull, maximum distance of points or convex hull diameter, and the smallest enclosing circle in \(E^2\) . The proposed algorithm is convenient for large data sets with unknown intervals and ranges of the data sets. It is based on efficient preprocessing, which significantly reduces points used in final processing by standard available algorithms.