3 citations · 3 across the 3 of their papers we have counts for
5 papers
The six-dimensional Delaunay polytopes
M. Dutour
Given a lattice , a full dimensional polytope is called a {\em Delaunay polytope} if the set of its vertices is with being an {\em empty sphere} of the lattice…
Zigzag Structure of Simple Two-faced Polyhedra
M. Deza, M. Dutour
A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal f…
4-valent plane graphs with 2-, 3- and 4-gonal faces
M. Deza, M. Dutour, M. Shtogrin
Call {\em i-hedrite} any 4-valent n-vertex plane graph, whose faces are 2-, 3- and 4-gons only and . The edges of an i-hedrite, as of any Eulerian plane graph, are parti…
Computational methods for cones and polytopes with symmetry
M. Dutour
Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one en…
Small cones of oriented semi-metrics
M. Deza, M. Dutour, E. Panteleeva
We consider polyhedral cones, associated with quasi-semi-metrics (oriented distances), in particular, with oriented multi-cuts, on n points. We computed the number of facets and of…