Computing homology.
Computing parametric rational generating functions with a primal Barvinok algorithm.
Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
Conditional probabilities and permutahedron
Configuration spaces and limits of voronoi diagrams
The Voronoi diagram of n distinct generating points divides the plane into cells, each of which consists of points most close to one particular generator. After introducing 'limit Voronoi diagrams' by analyzing diagrams of moving and coinciding points, we define compactifications of the configuration space of n distinct, labeled points. On elements of these compactifications we define Voronoi diagrams.
Congruent Embedding of Metric Quadruples on a Unit Sphere.
Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
Nous construisons des familles de facettes du polytope du sac-à-dos quadratique en 0-1 selon les deux approches suivantes. Le Boolean quadric polytope (introduit dans le cas sans contraintes par Padberg [12]) contenant le polytope du sac-à-dos quadratique, une première approche consiste à se demander sous quelles conditions une facette du premier est aussi une facette du second et quand ces conditions ne sont pas remplies quels liftings permettent d'en faire une facette. Des réponses à ces questions...
Construction of non-Wythoffian perfect 4-polytopes.
Construction techniques for cubical complexes, odd cubical 4-polytopes, and prescribed dual manifolds.
Constructions of triangular and quadrangular polyhedra of inscribable type
Constructive approximation of a ball by polytopes
Convex 4-valent polytopes with prescribed types of faces
Convex cones in finite-dimensional real vector spaces
Convex hulls of spatial polygons with a fixed convex projection.
Convex Polyhedra With Triangular Faces and Cone Triangulation
Convex polytopes as matrix invariants
Convex-ear decompositions and the flag -vector.
Corner cuts and their polytopes.
Countably convex sets
We investigate countably convex subsets of Banach spaces. A subset of a linear space is countably convex if it can be represented as a countable union of convex sets. A known sufficient condition for countable convexity of an arbitrary subset of a separable normed space is that it does not contain a semi-clique [9]. A semi-clique in a set S is a subset P ⊆ S so that for every x ∈ P and open neighborhood u of x there exists a finite set X ⊆ P ∩ u such that conv(X) ⊈ S. For closed sets this condition...