Finding convex hull vertices in metric space

The convex hull has been extensively studied in computational geometry and its applications have spread over an impressive number of fields. How to find the convex hull is an important and challenging problem. Although many algorithms had been proposed for that, most of them can only tackle the problem in two or three dimensions and the biggest issue is that those algorithms rely on the samples' coordinates to find the convex hull. In this paper, we propose an approximation algorithm named FVDM, which only utilizes the information of the samples' distance matrix to find the convex hull. Experiments demonstrate that FVDM can effectively identify the vertices of the convex hull