In this article, we present an efficient unified algorithm for the minimum Euclidean distance between two collections of compact convex sets, each of which can be a collection of convex primitives, ...

Euclidean distance matrices (EDMs) are matrices of the squared distances between points. The definition is deceivingly simple; thanks to their many useful properties, they have found applications in ...

Les procédés usuels de réduction, et en particulier l'algorithme LLL, deviennent plus performants lorsqu'on les adapte à ces structures, Numerous important lattices (𝔻₄, 𝔼₈, the Coxeter-Todd lattice ...