Scott, this is discussed (rather tersely) here: http://www.ics.uci.edu/~eppstein/junkyard/cube-triangulation.html . Also, if you don't know about David Eppstein's Geometry Junkyard, you should. It's a treasure trove of all sorts of wonderful things: http://www.ics.uci.edu/~eppstein/junkyard Victor On Thu, Sep 26, 2013 at 8:51 PM, <rcs@xmission.com> wrote:
This is from Scott Huddleston <scott.huddleston@intel.com> --Rich ---
What's the minimum number of pieces for dissecting an n-cube into n-simplices? You can always dissect into n! simplices, but that's not minimal for n>2.
This was an open problem when I was in grad school (awhile back).
Is there always a minimal dissection that includes a maxvol simplex?
- Scott
______________________________**_________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/**cgi-bin/mailman/listinfo/math-**fun<http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun>