Hilbert geometry for convex polygonal domains
英文摘要:
We prove in this paper that the Hilbert geometry associated with an open convex polygonal set is Lipschitz equivalent to Euclidean plane.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Bruno Colbois, Constantin Vernicos, Patrick Verovic
We prove in this paper that the Hilbert geometry associated with an open convex polygonal set is Lipschitz equivalent to Euclidean plane.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
This work has been expanded and fully incorporated into arXiv:1203.5837. Cases of equality in the classical 2-negative type inequalities for Hilbert spaces are characterized in terms of balanced signed simplices. It follows that a metric subspace of a Hilbert space H has strict 2-negative type if and only if it is affinely independent (when H is considered as a real vector space). This allows a complete description of Shkarin's class M.
Identification of generic polygonal domains by integral-geometric invariants
该研究利用点间距离分布、里斯能量函数等积分几何不变量,实现一般多边形区域的唯一识别,还补充了正多边形的识别结果,扩展了经典重建定理的适用范围。
We say that a tiling separates discs of a packing in the Euclidean plane, if each tile contains exactly one member of the packing. It is a known elementary geometric problem to show that for each locally finite packing of circular discs, there exists a separating tiling with convex polygons. In this paper we show that this separating property remains true for circle packings on the sphere and in the hyperbolic plane. Moreover, we show that in the Euclidean plane circles are the only convex discs, whose packings with similar copies can be always separated by polygonal tilings. The analogous sta…
Software for the Thompson and Funk Polygonal Geometry
本文针对凸多边形内的Thompson、Funk等度量空间,开发了一款用于理解这些独特几何并支持其研究的教育软件,提供了操作相关球体及遍历Hilbert几何的可视化工具。
The aim of this paper is to provide two examples in Hilbert geometry which show that volume growth entropy is not always a limit on the one hand, and that it may vanish for a non-polygonal domain in the plane on the other hand.
We investigate the critical points of Coulomb potential of point charges placed at the vertices of a planar polygonal linkage. It is shown that, for a collection of positive charges on a pentagonal linkage, there is a unique critical point in the set of convex configurations which is the point of absolute minimum. This enables us to prove that two controlling charges are sufficient to navigate between any two convex configurations of a pentagonal linkage.
We study inequalities between the hyperbolic metric and intrinsic metrics in convex polygonal domains in the complex plane. Special attention is paid to the triangular ratio metric in rectangles. A local study leads to an investigation of the relationship between the conformal radius at an arbitrary point of a planar domain and the distance of the point to the boundary.
We consider polygons with the following ``pairing property'': for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon $K$ tiles the plane multiply when translated at the locations $Λ$, where $Λ$ is a multiset in the plane. The pairing property of $K$ makes this question particularly amenable to Fourier Analysis. After establishing a necessary and sufficient condition for $K$ to tile with a given lattice $Λ$ (which was first found by Bolle for the case of convex polygons-notice that all convex polygons that tile, necessarily hav…
Convex Hulls of Dragon Curves
本文研究了龙曲线的凸包性质,证明了每条龙曲线都有多边形凸包,并对其凸包进行了完整刻画。
It is shown that convex hypersurfaces in Hilbert spaces have nonnegative Alexandrov curvature. This extends an earlier result of Buyalo for convex hypersurfaces in Riemannian manifolds of finite dimension.
On any convex domain in $\mathbb{R}^n$ we can define the Hilbert metric. A projective transformation is an example of an isometry of the Hilbert metric. In this thesis we will prove that the group of projective transformations on a convex domain has at most index 2 in the group of isometries of the convex domain with its Hilbert metric. Furthermore we will give criteria for which the set of projective transformations between two convex domains is equal to the set of isometries of the Hilbert metric of these convex domains. Lastly we will show that $2$-dimensional convex domains with their corr…
We survey the Hilbert geometry of convex polytopes. In particular we present two important characterisations of these geometries, the first one in terms of the volume growth of their metric balls, the second one as a bi-lipschitz class of the simplexe's geometry.
Let $P$ be a set of $n$ points and $Q$ a convex $k$-gon in ${\mathbb R}^2$. We analyze in detail the topological (or discrete) changes in the structure of the Voronoi diagram and the Delaunay triangulation of $P$, under the convex distance function defined by $Q$, as the points of $P$ move along prespecified continuous trajectories. Assuming that each point of $P$ moves along an algebraic trajectory of bounded degree, we establish an upper bound of $O(k^4nλ_r(n))$ on the number of topological changes experienced by the diagrams throughout the motion; here $λ_r(n)$ is the maximum length of an $…
We show that every (possibly unbounded) convex polygon $P$ in $R^2$ with $m$ edges can be represented by inequalities $p_1 \ge 0,...,p_n \ge 0,$ where the $p_i$'s are products of at most $k$ affine functions each vanishing on an edge of $P$ and $n=n(m,k)$ satisfies $s(m,k) \le n(m,k) \le (1+ε_m) s(m,k)$ with $s(m,k):=\max \{m/k,\log_2 m\}$ and $ε_m \to 0$ as $m \to \infty$. This choice of $n$ is asymptotically best possible. An analogous result on representing the interior of $P$ in the form $p_1 > 0,..., p_n > 0$ is also given. For $k \le m/\log_2 m$ these statements remain valid for represen…
We introduce the flag-approximability of a convex body to measure how easy it is to approximate by polytopes. We show that the flag-approximability is exactly half the volume entropy of the Hilbert geometry on the body, and that both quantities are maximized when the convex body is a Euclidean ball. We also compute explicitly the asymptotic volume of a convex polytope, which allows us to prove that simplices have the least asymptotic volume.
In this paper, we study the properties of the Fermat-Weber point for a set of fixed points, whose arrangement coincides with the vertices of a regular polygonal chain. A $k$-chain of a regular $n$-gon is the segment of the boundary of the regular $n$-gon formed by a set of $k(\leq n)$ consecutive vertices of the regular $n$-gon. We show that for every odd positive integer $k$, there exists an integer $N(k)$, such that the Fermat-Weber point of a set of $k$ fixed points lying on the vertices a $k$-chain of a $n$-gon coincides with a vertex of the chain whenever $n\geq N(k)$. We also show that $…
A subset of a convex body $B$ containing the origin in a Euclidean space is {\it parkable in $B$} if it can be translated inside $B$ in such a manner that the translate the origin. We provide characterizations of ellipsoids and of centrally symmetric convex bodies in Euclidean spaces of dimension $\ge 3$ based on the notion of parkability, answering several questions posed by G. Bergman. The techniques used, which are based on characterizations of Hilbert spaces among finite-dimensional Banach spaces in terms of their lattices of subspaces and algebras of endomorphisms, also apply to improve a…
If $Ω$ is the interior of a convex polygon in $\mathbb{R}^{2}$ and $f,g$ two asymptotic geodesics, we show that the distance function $d\left(f\left(t\right),g\left(t\right)\right)$ is convex for $t$ sufficiently large. The same result is obtained in the case $\partial Ω$ is of class $C^{2}$ and the curvature of $\partial Ω$ at the point $f\left(\infty\right)=g\left(\infty\right) $ does not vanish. An example is provided for the necessity of the curvature assumption.
The paper is centered around a new proof of the infinitesimal rigidity of convex polyhedra. The proof is based on studying derivatives of the discrete Hilbert-Einstein functional on the space of "warped polyhedra" with a fixed metric on the boundary. This approach is in a sense dual to using derivatives of the volume in order to prove the Gauss infinitesimal rigidity of convex polyhedra, which deals with deformations that preserve face normals and face areas. In the spherical and in the hyperbolic-de Sitter space, there is a perfect duality between the Hilbert-Einstein functional and the volum…
In this paper we study the area of ideals triangles in a convex domain with its Hilbert geometry. We obtain a characterization of the hyperbolic geometry among all the Hilbert geometry in terms of area of ideals triangles. We also obtain a sharp lower bound on the hilbert area of ideal triangles, independant of the convex, which characterizes the triangle domains in the plane. Furthermore, under specific geometric assumptions, we obtain an upper bound, which depends on the convex domain.
We prove that the Hilbert Geometry of a convex set is bi-lipschitz equivalent to a normed vector space if and only if the convex is a polytope.
A theorem of Tits - Vinberg allows to build an action of a Coxeter group $Γ$ on a properly convex open set $Ω$ of the real projective space, thanks to the data $P$ of a polytope and reflection across its facets. We give sufficient conditions for such action to be of finite covolume, convex-cocompact or geometrically finite. We describe an hypothesis that make those conditions necessary. Under this hypothesis, we describe the Zariski closure of $Γ$, find the maximal $Γ$-invariant convex, when there is a unique $Γ$-invariant convex, when the convex $Ω$ is strictly convex, when we can find a $Γ$-…
The Hilbert metric is a distance function defined for points lying within a convex body. It generalizes the Cayley-Klein model of hyperbolic geometry to any convex set, and it has numerous applications in the analysis and processing of convex bodies. In this paper, we study the geometric and combinatorial properties of the Voronoi diagram of a set of point sites under the Hilbert metric. Given any convex polygon $K$ bounded by $m$ sides, we present two algorithms (one randomized and one deterministic) for computing the Voronoi diagram of an $n$-element point set in the Hilbert metric induced b…
David Hilbert discovered in 1895 an important metric that is canonically associated to any convex domain $Ω$ in the Euclidean (or projective) space. This metric is known to be Finslerian, and the usual proof assumes a certain degree of smoothness of the boundary of $Ω$ and refers to a theorem by Busemann and Mayer that produces the norm of a tangent vector from the distance function. In this paper, we develop a new approach for the study of the Hilbert metric where no differentiability is assumed. The approach exhibits the Hilbert metric on a domain as a symmetrization of a natural weak metric…
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 and that in higher dimension it is a lower bound of the entropy. As a corollary we solve the entropy upper bound conjecture in dimension three and give a new proof in dimension two from the one found in Berck-Bernig-Vernicos (arXiv:0810.1123v2, published).
We review some basic concepts related to convex real projective structures from the differential geometry point of view. We start by recalling a Riemannian metric which originates in the study of affine spheres using the Blaschke connection (work of Calabi and of Cheng-Yau) mentioning its relation with the Hilbert metric. We then survey some of the deformation theory of convex real projective structures on surfaces. We describe in particular how the set of (Hilbert) lengths of simple closed curves is used in a parametrization of the deformation space in analogy with the classical Fenchel-Niels…
Non-Archimedean Hilbert geometry and degenerations of real Hilbert geometries
本文发展了有序值域上的希尔伯特几何理论,证明缩放实希尔伯特几何的超极限与非阿基米德希尔伯特空间等距,并描述了非阿基米德有界多胞形的希尔伯特度量,从而得到实多胞形缩放度量的 Gromov-Hausdorff 极限。
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。