Abstract
This paper is concerned with finding a lower bound for ϕ(n), the minimum number of simplices required to triangulate an n-cube. We prove that ϕ(n)≥Ln, where Ln is the minimum value of the sum of n−1 unknowns subject to n−1 inequality constraints. In particular, it is shown that ϕ(5)≥60.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
