English
Related papers

Related papers: Discrete extrinsic curvatures based on polar polyh…

200 papers

We embark in a program of studying the problem of better approximating surfaces by triangulations(triangular meshes) by considering the approximating triangulations as finite metric spaces and the target smooth surface as their…

Graphics · Computer Science 2007-05-23 Emil Saucan

Duality of curves is one of the important aspects of the ``classical'' algebraic geometry. In this paper, using this foundation, the duality of tropical polynomials is constructed to introduce the duality of Non-Archimedean curves. Using…

Algebraic Geometry · Mathematics 2007-05-23 Zur Izhakian

We propose a "decomposition method" to prove non-asymptotic bound for the convergence of empirical measures in various dual norms. The main point is to show that if one measures convergence in duality with sufficiently regular observables,…

Probability · Mathematics 2018-02-13 Benoît Kloeckner

It is hereby established that, in Euclidean spaces of finite dimension, bounded self-contracted curves have finite length. This extends the main result of Daniilidis, Ley, and Sabourau (J. Math. Pures Appl. 2010) concerning continuous…

Classical Analysis and ODEs · Mathematics 2012-11-15 Aris Daniilidis , Guy David , Estibalitz Durand-Cartagena , Antoine Lemenant

We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we…

Classical Analysis and ODEs · Mathematics 2017-08-02 Blanche Buet , Gian Paolo Leonardi , Simon Masnou

Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…

Computational Geometry · Computer Science 2023-06-16 Balázs Ludmány , Zsolt Lángi , Gábor Domokos

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…

Computational Geometry · Computer Science 2017-09-19 Siamak Yousefi , Xiao-Wen Chang , Henk Wymeersch , Benoit Champagne , Godfried Toussaint

Motivated by a M\"obius invariant subdivision scheme for polygons, we study a curvature notion for discrete curves where the cross-ratio plays an important role in all our key definitions. Using a particular M\"obius invariant…

Differential Geometry · Mathematics 2020-09-01 Christian Müller , Amir Vaxman

We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of…

Numerical Analysis · Mathematics 2024-11-19 Nikolai Krivulin

The first results presented in our article are the clear definitions of both intrinsic and extrinsic discrete curvatures in terms of holonomy and plane-angle representation, a clear relation with their deficit angles, and their clear…

General Relativity and Quantum Cosmology · Physics 2017-09-26 Seramika Ariwahjoedi , Freddy P. Zen

A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which generalizes earlier work on the subject. It is shown that each polyhedral metric on a surface is discrete conformal to a constant curvature…

Geometric Topology · Mathematics 2013-09-18 Xianfeng Gu , Feng Luo , Jian Sun , Tianqi Wu

In this paper we establish best approximation property of fully discrete Galerkin solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty(I;W^{1,\infty}(\Om))$ norm. The discretization method…

Numerical Analysis · Mathematics 2018-08-20 Dmitriy Leykekhman , Boris Vexler

There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…

Metric Geometry · Mathematics 2023-02-09 Wiktor Mogilski , Kyle Grant

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , David M. Mount

We study the simplex method over polyhedra satisfying certain "discrete curvature" lower bounds, which enforce that the boundary always meets vertices at sharp angles. Motivated by linear programs with totally unimodular constraint…

Data Structures and Algorithms · Computer Science 2014-12-23 Daniel Dadush , Nicolai Hähnle

The so-called Riemann sums have their origin in the efforts of Greek mathematicians to find the center of gravity or the volume of a solid body. These researches led to the method of exhaustion, discovered by Archimedes and described using…

History and Overview · Mathematics 2024-04-01 Akerele Olofin Segun

Topology and geometry are deeply intertwined in the study of surfaces, though their interaction manifests differently in smooth and discrete settings. In the smooth category, a classical result asserts that any closed smooth surface…

Differential Geometry · Mathematics 2025-12-23 Soto Hisakawa , Shizuo Kaji , Ryo Kawai

For matrix analogues of embedded surfaces we define discrete curvatures and Euler characteristics, and a non-commutative Gauss--Bonnet theorem is shown to follow. We derive simple expressions for the discrete Gauss curvature in terms of…

Mathematical Physics · Physics 2010-01-20 Joakim Arnlind , Jens Hoppe , Gerhard Huisken

The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…

Metric Geometry · Mathematics 2017-03-01 Constantin Vernicos

The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the curvature error. Parametric polynomial curves of low degree are used and a geometric continuity is…

Numerical Analysis · Mathematics 2025-09-03 Ema Češek , Aleš Vavpetič