首页/论文/math/0312050

arXiv math/03120502003-12-02math.MG

Properties of the Delaunay Triangulation

Oleg R. Musin

发表信息：: Proc. 13th annu. ACM Sympos. Comput. Geom. ACM Press, 1997, p. 424-426

英文摘要：

We defined several functionals on the set of all triangulations of the finite system of points in d-space achieving global minimum on the Delaunay triangulation (DT). We consider a so called "parabolic" functional and prove it attains its minimum on DT in all dimensions. As the second example we treat "mean radius" functional (mean of circumcircle radii of triangles) for planar triangulations. As the third example we treat a so called "harmonic" functional. For a triangle this functional equals the sum of squares of sides over area. Finally, we consider a discrete analog of the Dirichlet functional. DT is optimal for these functionals only in dimension two.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Proximal Delaunay Triangulation Regions

A main result in this paper is the proof that proximal Delaunay triangulation regions are convex polygons. In addition, it is proved that every Delaunay triangulation region has a local Leader uniform topology.

2014-11-23math.MG

Functionals on Triangulations of Delaunay Sets

We study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets.

2012-11-29math.MG

On the Optimality of Functionals over Triangulations of Delaunay Sets

In this short paper, we consider the functional density on sets of uniformly bounded triangulations with fixed sets of vertices. We prove that if a functional attains its minimum on the Delaunay triangulation, for every finite set in the plane, then for infinite sets the density of this functional attains its minimum also on the Delaunay triangulations.

2012-09-17math.MG

The Voronoi Functional is Maximized by the Delaunay Triangulation in the Plane

We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions.

2014-11-24math.COmath.MG

Embedded Delaunay triangulations for point clouds of surfaces in $\mathbb{R}^3$

In the following article we discuss Delaunay triangulations for a point cloud on an embedded surface in $\mathbb{R}^3$. We give sufficient conditions on the point cloud to show that the diagonal switch algorithm finds an embedded Delaunay triangulation.

2020-05-12math.DGmath.GTmath.MG

二阶 Delaunay 三角剖分优化角度

Order-2 Delaunay Triangulations Optimize Angles

本文将 Delaunay 三角剖分的局部角度性质推广到二阶，证明其二阶剖分在完备二级超三角剖分中字典序最优角度向量，且是极大情形中唯一满足局部角度性质的剖分。

2024-10-12cs.CGmath.COmath.MG

更多相关论文收起更多论文

Neighborly inscribed polytopes and Delaunay triangulations

We construct a large family of neighborly polytopes that can be realized with all the vertices on the boundary of any smooth strictly convex body. In particular, we show that there are superexponentially many combinatorially distinct neighborly polytopes that admit realizations inscribed on the sphere. These are the first examples of inscribable neighborly polytopes that are not cyclic polytopes, and provide the current best lower bound for the number of combinatorial types of inscribable polytopes (which coincides with the current best lower bound for the number of combinatorial types of poly…

2015-06-24cs.CGmath.COmath.MG

Universality theorems for inscribed polytopes and Delaunay triangulations

We prove that every primary basic semialgebraic set is homotopy equivalent to the set of inscribed realizations (up to Möbius transformation) of a polytope. If the semialgebraic set is moreover open, then, in addition, we prove that (up to homotopy) it is a retract of the realization space of some inscribed neighborly (and simplicial) polytope. We also show that all algebraic extensions of $\mathbb{Q}$ are needed to coordinatize inscribed polytopes. These statements show that inscribed polytopes exhibit the Mnëv universality phenomenon. Via stereographic projections, these theorems have a dire…

2014-06-30cs.CGmath.AGmath.CO

Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes

We present a constructive proof of Alexandrov's theorem regarding the existence of a convex polytope with a given metric on the boundary. The polytope is obtained as a result of a certain deformation in the class of generalized convex polytopes with the given boundary. We study the space of generalized convex polytopes and discover a relation with the weighted Delaunay triangulations of polyhedral surfaces. The existence of the deformation follows from the non-degeneracy of the Hessian of the total scalar curvature of a positively curved generalized convex polytope. The latter is shown to be e…

2006-09-15math.COmath.DGmath.MG

Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions

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 $…

2014-04-18cs.CGcs.DSmath.MG

Periodic triangulations of $\mathbb{Z}^n$

We consider in this work triangulations of $\mathbb{Z}^n$ that are periodic along $\mathbb{Z}^n$. They generalize the triangulations obtained from Delaunay tessellations of lattices. Other important property is the regularity and central-symmetry property of triangulations. Full enumeration for dimension at most $4$ is obtained. In dimension $5$ several new phenomena happen: there are centrally-symmetric triangulations that are not Delaunay, there are non-regular triangulations (it could happen in dimension $4$) and a given simplex has a priori an infinity of possible adjacent simplices. We fo…

2018-10-25math.COmath.MG

Construction of the Voronoi Diagram and Secondary Polytope

A set S of n points in general position in R^d defines the unique Voronoi diagram of S. Its dual tessellation is the Delaunay triangulation (DT) of S. In this paper we consider the parabolic functional on the set of triangulations of S and prove that it attains its minimum at DT in all dimensions. The Delaunay triangulation of S is corresponding to a vertex of the secondary polytope of S. We proposed an algorithm for DT's construction, where the parabolic functional and the secondary polytope are used. Finally, we considered a discrete analog of the Dirichlet functional. DT is optimal for this…

2003-12-02math.MG

Stable Delaunay Graphs

Let $P$ be a set of $n$ points in $\mathrm{R}^2$, and let $\mathrm{DT}(P)$ denote its Euclidean Delaunay triangulation. We introduce the notion of an edge of $\mathrm{DT}(P)$ being {\it stable}. Defined in terms of a parameter $α>0$, a Delaunay edge $pq$ is called $α$-stable, if the (equal) angles at which $p$ and $q$ see the corresponding Voronoi edge $e_{pq}$ are at least $α$. A subgraph $G$ of $\mathrm{DT}(P)$ is called {\it $(cα, α)$-stable Delaunay graph} ($\mathrm{SDG}$ in short), for some constant $c \ge 1$, if every edge in $G$ is $α$-stable and every $cα$-stable of $\mathrm{DT}(P)$ is…

2015-04-26cs.CGmath.MG