I have read the Delaunay triangulation for $n$ dimensions. assume that I have $d$ points. using a Delaunay triangulation algorithm, it makes $P$ pyramids. I want to know which of these pyramids has a smaller volume.
I already read this question, but it can't help me, because of each pyramid has 4 vertexes and each vertex has $n$ dimensions. how can I calculate the volume of pyramids?