Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Abstract. This paper presents a novel skeleton-based method for deforming meshes, based on an approximate skeleton. The major difference from previous skeleton-based methods is th...
This paper presents a skeleton-based method for deforming meshes (the skeleton need not be the medial axis). The significant difference from previous skeleton-based methods is that...
Han-Bing Yan, Shi-Min Hu, Ralph R. Martin, Yong-Li...
The paper presents a new approach for revealing regions (nuclei) of crystalline structures in computer models of dense packings of spherical atoms using the Voronoi-Delaunay method...
Alexey V. Anikeenko, Marina L. Gavrilova, Nikolai ...