We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
Face recognition and many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. In brain imaging, surfac...
We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such...