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, ...

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 ...

Robots with binocular vision often use template matching to identify the parts to be processed, which requires segmentation of the original point cloud data to obtain a separate target point cloud.