3 citations · 3 across the 3 of their papers we have counts for
Showing math.MGShow all
3 papers · 1 filter
math.MG2002
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…
math.MG2002
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…
math.MG2001
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…