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 Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.

Gift Wrap and Incremental Algorithm for the calculation of convex hull. Also, algorithm that finds the lattice points of a circle.

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 ...

A better than quadratic estimate is given for the volume of the convex hull of n points on Hadamard manifolds with pinched curvature. It was known previously that the volume is bounded by some ...

Abstract: In this article, we present an efficient unified algorithm for the minimum Euclidean distance between two collections of compact convex sets, each of which can be a collection of convex ...

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 ...