Given a weighted, undirected graph G with K knodes k1 … kK. I have a K times K matrix containing the shortest distances between each pair of points.
Is it possible (if yes how), to decide if a point lies inside/outside the convex hull of another set of points? I don't have coordinates of the points - only distances between them. If possible, I would like to avoid making any assumptions regarding the dimensionality of the space. If this is unavoidable, let's assume the space is two dimensional.