Timeline for Do plane projections determine a convex polytope?
Current License: CC BY-SA 2.5
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 21, 2010 at 2:49 | vote | accept | Igor Pak | ||
Feb 21, 2010 at 2:48 | comment | added | Igor Pak | After some thinking, it is now clear to me that what I wanted does easily follow from Klee. I am happy to accept this answer. Let me just mention that the key idea in Klee's paper is given in Mirkil's earlier paper cms.math.ca/cjm/v9/cjm1957v09.0001-0004.pdf, where the author proves that a closed convex cone is polyhedral if and only if all its 2-dim projections are closed and polyhedral (thus, circular cone doesn't work as it has a non-closed projection). Klee first refines and extends Mirkli's ideas, and then gives a "local" proof of the main result based on this. | |
Feb 19, 2010 at 20:03 | comment | added | Igor Pak | This is great! Many thanks. Let me read this paper carefully to understand what it really does and get back to you. | |
Feb 19, 2010 at 15:41 | history | edited | Mark Meckes | CC BY-SA 2.5 |
deleted 42 characters in body
|
Feb 19, 2010 at 14:34 | history | answered | Mark Meckes | CC BY-SA 2.5 |