Related papers: Discrete extrinsic curvatures based on polar polyh…
We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…
The multipole expansion method (MEM) is a spatial discretization technique that is widely used in applications that feature scattering of waves from circular cylinders. Moreover, it also serves as a key component in several other numerical…
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we…
The Closest Point Method for solving partial differential equations (PDEs) posed on surfaces was recently introduced by Ruuth and Merriman [J. Comput. Phys. 2008] and successfully applied to a variety of surface PDEs. In this paper we study…
This paper defines a distance function that measures the dissimilarity between planar geometric figures formed with straight lines. This function can in turn be used in partial matching of different geometric figures. For a given pair of…
Classical extremal length (or conformal modulus) is a conformal invariant involving families of paths on the Riemann sphere. In ``Extremal length and functional completion'', Fuglede initiated an abstract theory of extremal length which has…
The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…
The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of…
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
Minimizing a convex function of a measure with a sparsity-inducing penalty is a typical problem arising, e.g., in sparse spikes deconvolution or two-layer neural networks training. We show that this problem can be solved by discretizing the…
Ten years ago, Beresnevich-Dickinson-Velani initiated a project that develops the general Hausdorff measure theory of dual approximation on non-degenerate manifolds. In particular, they established the divergence part of the theory based on…
We introduce a novel concept of coarse extrinsic curvature for Riemannian submanifolds, inspired by Ollivier's notion of coarse Ricci curvature. This curvature is derived from the Wasserstein 1-distance between probability measures…
Motivated by problems where the response is needed at select localized regions in a large computational domain, we devise a novel finite element discretization that results in exponential convergence at pre-selected points. The two key…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
Seminal work by Edmonds and Lovasz shows the strong connection between submodularity and convexity. Submodular functions have tight modular lower bounds, and subdifferentials in a manner akin to convex functions. They also admit poly-time…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
We discuss a notion of discrete conformal equivalence for decorated piecewise euclidean surfaces (PE-surface), that is, PE-surfaces with a choice of circle about each vertex. It is closely related to inversive distance and hyperideal circle…
Since the 1960's the finite element method emerged as a powerful tool for the numerical simulation of countless physical phenomena or processes in applied sciences. One of the reasons for this undeniable success is the great versatility of…
We present an explicit formula for the orthogonal projection onto the subspace of analytic polynomials of degree at most $n$ in the local Dirichlet space $D_\mu$ , where the positive measure $\mu$ consists of a finite number of Dirac…