-
polytopes to
polytopal bodies,
which need not be
convex or simply-connected. In particular, if P is a polytope, then the set of its
faces is a
polytopal body...
-
orientation that is
strongly connected. Balinski's
theorem states that the
polytopal graph (1-skeleton) of a k-dimensional
convex polytope is a k-vertex-connected...
- polytope. It is a
connected and
closed figure,
composed of lower-dimensional
polytopal elements: vertices, edges,
faces (polygons), and
cells (polyhedra). Each...
- of a
convex polytope.
Branko Grünbaum
constructed an
example of a non-
polytopal simplicial sphere (that is, a
simplicial sphere that is not the boundary...
-
there pivot rules which lead to polynomial-time
simplex variants? Do all
polytopal graphs have
polynomially bounded diameter?
These questions relate to the...
-
isomorphic if
their face
lattices are isomorphic. The
polytope graph (
polytopal graph,
graph of the polytope, 1-skeleton) is the set of
vertices and edges...
-
guarantees that the
graph of the
function will be
composed of
polygonal or
polytopal pieces.
Splines generalize piecewise linear functions to higher-order...
- In mathematics, a
polyhedral complex is a set of
polyhedra in a real
vector space that fit
together in a
specific way.
Polyhedral complexes generalize...
-
through a
point just
outside one of its facets. The
resulting entity is a
polytopal subdivision of the
facet in R d − 1 {\textstyle \mathbb {R} ^{d-1}} that...
- The Knaster–Kuratowski–Mazurkiewicz
lemma is a
basic result in
mathematical fixed-point
theory published in 1929 by Knaster,
Kuratowski and Mazurkiewicz...
