Abstract
We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by points in 3-space, and in general in dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by points in $\RR^3$ is at most , and there are point sets for which this number is . We also present an time algorithm for reporting all tetrahedra of minimum nonzero volume, and thereby extend an algorithm of Edelsbrunner, O'Rourke, and Seidel. In general, for every $k,d\in \NN$, , the maximum number of -dimensional simplices of minimum (nonzero) volume spanned by points in $\RR^d$ is . (ii) The number of unit-volume tetrahedra determined by points in $\RR^3$ is , and there are point sets for which this number is . (iii) For every $d\in \NN$, the minimum number of distinct volumes of all full-dimensional simplices determined by points in $\RR^d$, not all on a hyperplane, is .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.