Related papers: Polyhedral representation conversion up to symmetr…
Mathematically representing the shape of an object is a key ingredient for solving inverse rendering problems. Explicit representations like meshes are efficient to render in a differentiable fashion but have difficulties handling topology…
We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…
In the present article the reduced integral representation of partitions in terms of harmonic products has been derived first by using hypergeometry and the new concept of fractional sum and secondly by studying the Fourier series of the…
The K-partitioning problem consists of partitioning the vertices of a graph in K sets so as to minimize a function of the edge weights. We introduce a linear mixed integer formulation with edge variables and representative variables. We…
We show how the Fourier transform of a shape in any number of dimensions can be simplified using Gauss's law and evaluated explicitly for polygons in two dimensions, polyhedra three dimensions, etc. We also show how this combination of…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, best known as a procedure to enable Quantifier Elimination over real-closed fields. However, it has a worst case complexity doubly exponential in…
Lifting methods allow to transform hard variational problems such as segmentation and optical flow estimation into convex problems in a suitable higher-dimensional space. The lifted models can then be efficiently solved to a global optimum,…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
The goal of this document is to survey existing methods for recovering CSG representations from unstructured data such as 3D point-clouds or polygon meshes. We review and discuss related topics such as the segmentation and fitting of the…
We prove descent theorems for semiorthogonal decompositions using techniques from derived algebraic geometry. Our methods allow us to capture more general filtrations of derived categories and even marked filtrations, where one descends not…
We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves…
Splitting methods have emerged as powerful tools to address complex problems by decomposing them into smaller solvable components. In this work, we develop a general approach to forward-backward splitting methods for solving monotone…
A special class of integrable nonlinear differential equations related to A.III-type symmetric spaces and having additional reductions are analyzed via the inverse scattering method (ISM). Using the dressing method we construct two classes…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
This work introduces a methodology to solve ordinary differential equations using the Schur decomposition of the linear representation of the differential equation. This is done by first transforming the system into an upper triangular…
We introduce a new method to reconstruct 3D objects using a set of volumetric primitives, i.e., superquadrics. The method hierarchically decomposes a target 3D object into pairs of superquadrics recovering finer and finer details. While…
We study a homogenisation problem for problems of mixed type in the framework of evolutionary equations. The change of type is highly oscillatory. The numerical treatment is done by a discontinuous Galerkin method in time and a continuous…
We present an alternative Double Description representation for the domain of NNC (not necessarily topologically closed) polyhedra, together with the corresponding Chernikova-like conversion procedure. The representation differs from the…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
A method to construct integrable deformations of Hamiltonian systems of ODEs endowed with Lie-Poisson symmetries is proposed by considering Poisson-Lie groups as deformations of Lie-Poisson (co)algebras. Moreover, the underlying Lie-Poisson…