Timeline for Nonzero convex combinations of convex hull vertices to yield an inner point
Current License: CC BY-SA 3.0
2 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 25, 2012 at 20:55 | comment | added | Gerhard Paseman | Actually, the 2d case might work out if you shift your perspective: replace a facet with k vertices by a certain combination that lies on the facet. You could even start with that to reduce V to the right number of vertices mod d (the integer). Gerhard "Ask Me About System Design" Paseman, 2012.11.25 | |
Nov 25, 2012 at 20:51 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |