Finding the graph of a convex shape given its coordinates
I want to build a function that takes in a set of Cartesian coordinates in 3D (as a numpy array), and then assuming the coordinates represent the vertices of a convex polyhedron, return a graph in adjacency matrix form that represents the polyhedron. For example, on a cube, I want to input the 8 vertices as Cartesian coordinates, e.g.