14 citations · 46 across the 26 of their papers we have counts for
3 papers · 1 filter
Polytopes close to being simple
Guillermo Pineda-Villavicencio, Julien Ugon, David Yost
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that -polytopes with at most nonsimple vertices are reconstructib…
The excess degree of a polytope
Guillermo Pineda-Villavicencio, Julien Ugon, David Yost
We define the excess degree of a -polytope as , where and denote the number of vertices and edges, respectively. This parameter measures how mu…
On the reconstruction of polytopes
Joseph Doolittle, Eran Nevo, Guillermo Pineda-Villavicencio +2
Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its -skeleton. Call a vertex of a -polytope \emph{nonsim…