Related papers: Ipelets for the Convex Polygonal Geometry
Inspired by the introduction of Volumetric Modeling via volumetric representations (V-reps) by Massarwi and Elber in 2016, in this paper we present a novel approach for the construction of isogeometric numerical methods for elliptic PDEs on…
This tutorial provides an exposition of a flexible geometric framework for high dimensional estimation problems with constraints. The tutorial develops geometric intuition about high dimensional sets, justifies it with some results of…
We develop a theory of Hilbert geometry over general ordered valued fields, associating with an open convex subset of the projective space a quotient Hilbert metric space. Under natural non-degeneracy assumptions, we prove that the…
We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer…
Swept volume computation, the determination of regions occupied by moving objects, is essential in graphics, robotics, and manufacturing. Existing approaches either explicitly track surfaces, suffering from robustness issues under complex…
In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…
We present a new method for the analysis of images, a fundamental task in observational astronomy. It is based on the linear decomposition of each object in the image into a series of localised basis functions of different shapes, which we…
We present novel mixed-integer programming (MIP) formulations for optimization over nonconvex piecewise linear functions. We exploit recent advances in the systematic construction of MIP formulations to derive new formulations for…
We propose to consider ensembles of cycles (quadrics), which are interconnected through conformal-invariant geometric relations (e.g. "to be orthogonal", "to be tangent", etc.), as new objects in an extended Moebius--Lie geometry. It was…
A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…
A major factor contributing to the success of modern representation learning is the ease of performing various vector operations. Recently, objects with geometric structures (eg. distributions, complex or hyperbolic vectors, or regions such…
A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…
A polyhedral convex set optimization problem is given by a set-valued objective mapping from the $n$-dimensional to the $q$-dimensional Euclidean space whose graph is a convex polyhedron. This problem can be seen as the most elementary…
To investigate the topological structure of planar polygon decomposition on trapezoids, which is formed by height functions. We use the oriented Reeb graph of the function with a marked vertex. We describe all possible optimal Reeb graphs…
Geometric decomposition is a widely used tool for constructing local bases for finite element spaces. For finite element spaces of differential forms on simplicial meshes, Arnold, Falk, and Winther showed that geometric decompositions can…
Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…
Edge detection is widely and fundamental feature used in various algorithms in computer vision to determine the edges in an image. The edge detection algorithm is used to determine the edges in an image which are further used by various…
Partial Isometries are important constructs that help give nontrivial solutions once a simple solution is known. We generalize this notion to Extended Partial Isometries and include operators which have right inverses but no left inverses…
We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…
Rotary Position Embedding (RoPE) is widely adopted in large language models (LLMs) due to its efficient encoding of relative positions with strong extrapolation capabilities. However, while its application in higher-dimensional input…