Abstract: The convex hull of a set of points is the smallest convex set that contains the points. This article presents a multi-objective differential evolutionary algorithm based on quick convex hull ...

The Convex Hull algorithm is a computational geometry algorithm used to find the smallest convex polygon that contains all the given points in a set. In simpler terms, it helps identify the outer ...

Abstract: A quick convex hull building algorithm using grid and binary tree is proposed for the minimum convex buidling of planar point set. Grids are used to assess and eliminate those interior ...

Convex geometry and point set configurations form a pivotal area of research in computational geometry, where the primary focus is the study of convex sets and the intricate arrangements of points in ...

Mathematics of Operations Research, Vol. 38, No. 2 (May 2013), pp. 248-264 (17 pages) In this paper, we address the basic geometric question of when a given convex set is the image under a linear map ...