Related papers: Implementing Simulation of Simplicity for geometri…
In our implementation of geometric resolution, the most costly operation is subsumption testing (or matching): One has to decide for a three-valued, geometric formula, if this formula is false in a given interpretation. The formula contains…
We present semisimp, a tool for semiautomatic simplification of three dimensional polygonal models. Existing automatic simplification technology is quite mature, but is not sensitive to the heightened importance of distinct semantic model…
In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the…
Many idealized problems in signal processing, machine learning and statistics can be reduced to the problem of finding the symmetric canonical decomposition of an underlying symmetric and orthogonally decomposable (SOD) tensor. Drawing…
The proliferation of 3D representations, from explicit meshes to implicit neural fields and more, motivates the need for simulators agnostic to representation. We present a data-, mesh-, and grid-free solution for elastic simulation for any…
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of…
Triangulated meshes have become ubiquitous discrete-surface representations. In this paper we address the problem of how to maintain the manifold properties of a surface while it undergoes strong deformations that may cause topological…
This paper studies the obstructions to deforming a map from a complex variety to another variety which is an immersion of codimension one. We extend the classical notion of semiregularity of subvarieties to maps between varieties, and show…
We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in 3D. We do not assume general position. Namely, we handle degenerate input, and produce exact results. We…
We consider the problem of computing exact sums of squares (SOS) decompositions for certain classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. We provide a hybrid numeric-symbolic algorithm…
Finding correspondences between 3D shapes is an important and long-standing problem in computer vision, graphics and beyond. A prominent challenge are partial-to-partial shape matching settings, which occur when the shapes to match are only…
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…
Stochastic Gradient Descent (SGD) is one of the simplest and most popular stochastic optimization methods. While it has already been theoretically studied for decades, the classical analysis usually required non-trivial smoothness…
Removing geometrical details from a complex domain is a classical operation in computer aided design. This procedure simplifies the meshing process, and it enables faster simulations with less memory requirements. However, depending on the…
We study the role of symmetries in control systems through the geometric algebra approach. We discuss two specific control problems on Carnot groups of step $2$ invariant with respect to the action of $SO(3)$. We understand the geodesics as…
In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP). However, due to…
A finite subgroup of the conformal group SL(2,C) can be related to invariant polynomials on a hypersurface in C^3. The latter then carries a simple singularity, which resolves by a finite iteration of basic cycles of deprojections. The…
In machine learning and computer graphics, a fundamental task is the approximation of a probability density function through a well-dispersed collection of samples. Providing a formal metric for measuring the distance between probability…
Recent work has studied the interplay between a galaxy's history and its observable properties using "genetically modified" cosmological zoom simulations. The approach systematically generates alternative histories for a halo, while keeping…
We fully generalize a previously-developed computational geometry tool [1] to perform large-scale simulations of arbitrary two-dimensional faceted surfaces $z = h(x,y)$. Our method uses a three-component facet/edge/junction storage model,…