Related papers: Equi-affine minimal-degree moving frames for polyn…
We consider the problem of minimizing a convex objective which is the sum of a smooth part, with Lipschitz continuous gradient, and a nonsmooth part. Inspired by various applications, we focus on the case when the nonsmooth part is a…
In this work, merging ideas from compatible discretisations and polyhedral methods, we construct novel fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra. The spaces and operators that appear in these…
In this expository article we give a categorical definition of the integral cohomology ring of a stack. We show that for quotient stacks the categorical cohomology may be identified with equivariant cohomology. Via this identification we…
In this paper we present several formulae for computing the partial degrees of the defining polynomial of the offset curve to an irreducible affine plane curve given implicitly, and we see how these formulae particularize to the case of…
A rotation-minimizing frame $({\bf f}_1,{\bf f}_2,{\bf f}_3)$ on a space curve ${\bf r}(\xi)$ defines an orthonormal basis for $\mathbb{R}^3$ in which ${\bf f}_1={\bf r}'/|{\bf r}'|$ is the curve tangent, and the normal-plane vectors ${\bf…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
The goal of this paper is to introduce a new constructive geometric proof of the affine version of Chevalley's Theorem. This proof is algorithmic and a verbatim implementation resulted in an efficient code for computing the constructible…
The paper looks at a scaled variant of the stochastic gradient descent algorithm for the matrix completion problem. Specifically, we propose a novel matrix-scaling of the partial derivatives that acts as an efficient preconditioning for the…
This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…
In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
We introduce Equivariant Neural Field Expectation Maximization (EFEM), a simple, effective, and robust geometric algorithm that can segment objects in 3D scenes without annotations or training on scenes. We achieve such unsupervised…
For a fixed $k$, this study considers $k$-partition minimization of submodular system $(V, f)$ with a finite set $V$ and symmetric submodular function $f: 2^{V} \mapsto \mathbb{R}$. Our algorithm uses the Queyranne's (1998) algorithm for…
We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…
We present a method for constructing all bounded rational motions that frame a space curve $\mathbf{r}(t)$. This means that the motion guides an orthogonal frame along the curve such that one frame axis is in direction of the curve tangent.…
The affine Grassmannian is a noncompact smooth manifold that parameterizes all affine subspaces of a fixed dimension. It is a natural generalization of Euclidean space, points being zero-dimensional affine subspaces. We will realize the…
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…
In autonomous driving, deep learning enabled motion prediction is a popular topic. A critical gap in traditional motion prediction methodologies lies in ensuring equivariance under Euclidean geometric transformations and maintaining…
We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…
The problem of computing a representation for a real polynomial as a sum of minimum number of squares of polynomials can be casted as finding a symmetric positive semidefinite real matrix (Gram matrix) of minimum rank subject to linear…