Timeline for Computionally efficient vertex enumeration for (convex) polytopes
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jul 29, 2019 at 0:50 | history | suggested | Rodrigo de Azevedo |
added tag.
|
|
| Jul 28, 2019 at 22:30 | review | Suggested edits | |||
| S Jul 29, 2019 at 0:50 | |||||
| Apr 29, 2015 at 13:49 | vote | accept | Christopher | ||
| Apr 27, 2015 at 14:05 | history | edited | Christopher | CC BY-SA 3.0 |
edited body
|
| Apr 27, 2015 at 10:10 | comment | added | Christopher | Yes, it is an $\mathcal{H}$-polytope, i.e., intersection of finitely many affine half-spaces. Yes, the facet and the vertex enumeration problem are strongly polynomial equivalent. | |
| S Apr 27, 2015 at 9:36 | history | suggested | Zsbán Ambrus |
add tag [computational-geometry]
|
|
| Apr 27, 2015 at 9:18 | review | Suggested edits | |||
| S Apr 27, 2015 at 9:36 | |||||
| Apr 27, 2015 at 9:17 | comment | added | Zsbán Ambrus | How is the polytope defined? Is it given as an intersection of half-planes? If so, can this problem be transformed to the dual problem of enumerating all the facets of the convex hull if the vertices are given? | |
| Apr 27, 2015 at 5:29 | history | edited | Christopher | CC BY-SA 3.0 |
edited body
|
| Apr 26, 2015 at 22:11 | answer | added | Dima Pasechnik | timeline score: 10 | |
| Apr 26, 2015 at 19:26 | history | asked | Christopher | CC BY-SA 3.0 |