scientific article; zbMATH DE number 3261280

Recommendations

scientific article; zbMATH DE number 2008526
Convex Polytopes
scientific article; zbMATH DE number 1995972
scientific article; zbMATH DE number 863487
scientific article; zbMATH DE number 4197779
On some characterizations of convex polyhedra
Convex polytopes: extremal constructions and f-vector shapes
Convex polytopes and enumeration
scientific article; zbMATH DE number 5875567
Convex Polyhedra

Cited in

(only showing first 100 items - show all)

Projective re-normalization for improving the behavior of a homogeneous conic linear system
Coxeter polytopes with a unique pair of non-intersecting facets
A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
Interpretation of De Finetti coherence criterion in Łukasiewicz logic
On visualization scaling, subeigenvectors and Kleene stars in max algebra
New cases of Reay's conjecture on partitions of points into simplices with \(k\)-dimensional intersection
Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
Type-B generalized triangulations and determinantal ideals
Non-existence of super-additive solutions for 3-person games
All triangulations of the projective plane are geometrically realizable in \(E^ 4\).
Sets of finite order and (2,k)-divisibility
Unions of oriented matroids
Quotient polytopes of cyclic polytopes. II: Stability of the f-vector and the k-skeleton
A survey of the asymptotic behaviour of maps
Dual pairs of non-polynomial diagrams and spheres
A theorem about antiprisms
A combinatorial perspective on the non-Radon partitions
How many cyclic subpolytopes can a non-cyclic polytope have?
Polarity and inner products in oriented matroids
A problem of McMullen on the projective equivalences of polytopes
Neighborly combinatorial 3-manifolds with dihedral automorphism group
Real addition and the polynomial hierarchy
An extension of Jung's theorem
An inequality for 3-polytopes
A simple proof of the upper bound theorem
5-connected 3-polytopes are refinements of octahedra
Finding extreme points in three dimensions and solving the post-office problem in the plane
Convex hulls of generalized moment curves
On the maximal number of edges of many faces in an arrangement
The Steiner point in infinite dimensions
Preassigning the shape of projections of convex polytopes
On the cuts and cut number of the 4-cube
Matrices satisfying a conjecture of G. N. de Oliveira on determinants
On weakly neighborly polyhedral maps of arbitrary genus
n-connectedness in pure 2-complexes
Geometric realizations for Dyck's regular map on a surface of genus 3
The complexity of cells in three-dimensional arrangements
Extensions of Radstrom's lemma with application to stability theory of mathematical programming
An application of valuation theory to two problems in discrete geometry
On the sufficiency of the Hamilton-Jacobi-Bellman equation for optimality of the controls in a linear optimal-time problem
A lower bound theorem for polytope pairs
Finite rank operators with large trace
Convex surfaces which intersect each congruent copy of themselves in a connected set
A simplicial 3-arrangement of 21 planes
Central and parallel projections of polytopes
The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
Divisible points of compact convex sets
The number of extreme pairs of finite point-sets in Euclidean spaces
-nets and simplex range queries
Determining a matroid polytope by non-Radon partitions
A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
Computing convolutions by reciprocal search
Approximation of convex bodies by polytopes with uniformly bounded valences
Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs)
Volumes of complementary projections of convex polytopes
Invertible relations on polytopes
Many triangulated spheres
An algorithm for the characterization of the nonplanarity of a maximal graphical partition
Newton polyhedra and irreducibility
Balanced subdivision and enumeration in balanced spheres
Recognising polytopical cell complexes and constructing projection polyhedra
Combinatorial d-tori with a large symmetry group
Combinatorial behavior of extreme points of perturbed polyhedra
On the covering cuts of c d (d\(\leq 5)\)
Ein Henkeltheorem für geschlossene semilineare Mannigfaltigkeiten. (A handle theorem for closed semilinear manifolds)
Polytopal and nonpolytopal spheres. An algorithmic approach
A combinatorial result on points and circles on the plane
An infinite family of minor-minimal nonrealizable 3-chirotopes
Valuations and polarity
\(W_ v\) paths in the projective plane
An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope
Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
A lower bound on the number of sharp shadow-boundaries of convex polytopes
A simple proof of the kinematic formula
Completely unimodal numberings of a simple polytope
Totally positive matrices and cyclic polytopes
On a class of Hamiltonian polytopes
Incidence-polytopes with toroidal cells
Intersection bodies and dual mixed volumes
Random triangulations of the plane
The face lattice of hyperplane arrangements
Facet-to-facet implies face-to-face
The complexity of cutting complexes
A classification of toric varieties with few generators
A non-involutory selfduality
Determining classes of convex bodies by restricted sets of Steiner symmetrizations
An embedding theorem for smooth projective toric varieties
A simple way to tell a simple polytope from its graph
Support functions on ordinal products
Cell decomposition of polytopes by bending
A combinatorial result about points and balls in Euclidean space
An upper bound on the shortness exponent of inscribable polytopes
An intrinsic characterization of foldings of Euclidean space
Complexes whose boundaries cannot be pushed around
Circular planar graphs and resistor networks
A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
On the intermediate area functions of convex bodies
Voronoi diagrams from convex hulls
An invertible 3-diagram with 8 vertices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5547252)