Related papers: How to flatten a soccer ball
We define a natural compactification of an arrangement complement in a ball quotient. We show that when this complement has a moduli space interpretation, then this compactification is often one that appears naturally by means of geometric…
This work is a thorough and detailed study on the geometry of the unit sphere of certain Banach spaces of homogeneous polynomials in ${\mathbb{R}}^2$. Specifically, we provide a complete description of the unit spheres, identify the extreme…
Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a…
Recently, a method to compute the implicit equation of a parametrized hypersurface has been developed by the authors. We address here some questions related to this method. First, we prove that the degree estimate for the stabilization of…
We present an algorithm which computes a cylindrical algebraic decomposition of a semialgebraic set using projection sets computed for each cell separately. Such local projection sets can be significantly smaller than the global projection…
We consider curves $\gamma : [0, 1]\to\mathbb{R}^3$ endowed with an adapted orthonormal frame $r : [0, 1]\to SO(3)$. We are interested in the cases where the frame is constrained, in the sense that one of its `curvatures' (i.e.,…
We characterize the space of restrictions of real rational functions to certain algebraic Jordan curves in the plane via the Dirichlet-to-Neumann map associated to the domain in the complex plane bounded by the curve and its Bergman kernel.…
Goals are results of pin-point shots and it is a pivotal decision in soccer when, how and where to shoot. The main contribution of this study is two-fold. At first, after showing that there exists high spatial correlation in the data of…
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…
We consider variational problems that model the bending behavior of curves that are constrained to belong to given hypersurfaces. Finite element discretizations of corresponding functionals are justified rigorously via Gamma-convergence.…
We study convexity of image of a general multidimensional quadratic map. We split the full image into two parts by an appropriate hyperplane such that one part is compact, and formulate a sufficient condition for convexity of the compact…
We give an introduction to the study of algebraic hypersurfaces, focusing on the problem of when two hypersurfaces are isomorphic or close to being isomorphic. Working with hypersurfaces and emphasizing examples makes it possible to discuss…
Illumination of scenes is usually generated in computer graphics using polygonal meshes. In this paper, we present a geometric method using projections. Starting from an implicit polynomial equation of a surface in 3-D or a curve in 2-D, we…
Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the…
We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…
Topological data analysis asks when balls in a metric space $(X,d)$ intersect. Geometric data analysis asks how much balls have to be enlarged to intersect. We connect this principle to the traditional core geometric concept of curvature.…
The paper uses a frame-theoretic setting to study the injectivity of a ReLU-layer on the closed ball of $\mathbb{R}^n$ and its non-negative part. In particular, the interplay between the radius of the ball and the bias vector is emphasized.…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
One of the questions investigated in deformation theory is to determine to which algebras can a given associative algebra be deformed. In this paper we investigate a different but related question, namely: for a given associative…