English
Related papers

Related papers: A Remark on the Rigidity of Delaunay Triangulated …

200 papers

We show that a uniformly acute triangulation of the plane is rigid under Luo's discrete conformal change, extending previous results on hexagonal triangulations. Our result is a discrete analogue of the conformal rigidity of the plane. We…

Geometric Topology · Mathematics 2022-08-09 Tianqi Wu

We show the rigidity of the hexagonal Delaunay triangulated plane under Luo's PL conformality. As a consequence, we obtain a rigidity theorem for a particular type of locally finite convex ideal hyperbolic polyhedra.

Geometric Topology · Mathematics 2020-05-06 Song Dai , Huabin Ge , Shiguang Ma

We proved a rigidity result for Delaunay triangulations of the plane under Luo's discrete conformal change, extending previous results on hexagonal triangulations. Our result is a discrete analogue of the conformal rigidity of the plane. We…

Geometric Topology · Mathematics 2024-08-21 Song Dai , Tianqi Wu

In the paper, we consider the rigidity problem of the infinite hexagonal triangulation of the plane under the piecewise linear conformal changes introduced by Luo in [5]. Our result shows that if a geometric hexagonal triangulation of the…

Geometric Topology · Mathematics 2013-06-18 Tianqi Wu , Xianfeng Gu , Jian Sun

We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of $\delta$-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay…

Computational Geometry · Computer Science 2015-05-08 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh

Delaunay has shown that the Delaunay complex of a finite set of points $P$ of Euclidean space $\mathbb{R}^m$ triangulates the convex hull of $P$, provided that $P$ satisfies a mild genericity property. Voronoi diagrams and Delaunay…

Computational Geometry · Computer Science 2016-12-12 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh , Nikolay Martynchuk

We describe an efficient algorithm to compute a conformally equivalent metric for a discrete surface, possibly with boundary, exhibiting prescribed Gaussian curvature at all interior vertices and prescribed geodesic curvature along the…

Computational Geometry · Computer Science 2021-04-13 Marcel Campen , Ryan Capouellez , Hanxiao Shen , Leyi Zhu , Daniele Panozzo , Denis Zorin

We present a self-contained short proof of the seminal result of Dillencourt (SoCG 1987 and DCG 1990) that Delaunay triangulations, of planar point sets in general position, are 1-tough. An important implication of this result is that…

Computational Geometry · Computer Science 2019-10-11 Ahmad Biniaz

We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted…

Geometric Topology · Mathematics 2013-09-17 Boris A. Springborn

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

Combinatorics · Mathematics 2024-09-26 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa

Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of…

Computational Geometry · Computer Science 2007-12-13 Siu-Wing Cheng , Tamal K. Dey

This article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved. To describe…

Logic in Computer Science · Computer Science 2010-07-26 Jean-François Dufourd , Yves Bertot

We consider the problem of maintaining the Euclidean Delaunay triangulation $\DT$ of a set $P$ of $n$ moving points in the plane, along algebraic trajectories of constant description complexity. Since the best known upper bound on the…

Computational Geometry · Computer Science 2015-03-19 Pankaj K. Agarwal , Jie Gao , Leonidas J. Guibas , Haim Kaplan , Vladlen Koltun , Natan Rubin , Micha Sharir

Via circle pattern techniques, random planar triangulations (with angle variables) are mapped onto Delaunay triangulations in the complex plane. The uniform measure on triangulations is mapped onto a conformally invariant spatial point…

Mathematical Physics · Physics 2013-12-23 Francois David , Bertrand Eynard

We present an algorithm that takes as input a finite point set in Euclidean space, and performs a perturbation that guarantees that the Delaunay triangulation of the resulting perturbed point set has quantifiable stability with respect to…

Computational Geometry · Computer Science 2015-05-08 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh

We establish linearized well-posedness of the Triple-Deck system in Gevrey-$\frac32$ regularity in the tangential variable, under concavity assumptions on the background flow. Due to the recent result \cite{DietertGV}, one cannot expect a…

Analysis of PDEs · Mathematics 2023-08-09 David Gerard-Varet , Sameer Iyer , Yasunori Maekawa

In this paper, we determine the topology of the spaces of convex polyhedra inscribed in the unit $2$-sphere and the spaces of strictly Delaunay geodesic triangulations of the unit $2$-sphere. These spaces can be regarded as discretized…

Geometric Topology · Mathematics 2023-05-31 Yanwen Luo , Tianqi Wu , Xiaoping Zhu

Using the construction of a Lyapunov function, it is shown that the Douglas-Rachford iteration with respect to a sphere and a line in $\mathbb R^d$ is robustly $\mathcal{KL}$-stable. This implies a convergence which is stronger than uniform…

Optimization and Control · Mathematics 2016-09-29 Ohad Giladi

We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it…

Computational Geometry · Computer Science 2007-05-23 Vin de Silva

In a granular solid, mechanical equilibrium requires a delicate balance of forces at the disordered grain scale. To understand how macroscopic rigidity can emerge in this amorphous solid, it is crucial that we understand how Newton's laws…

Soft Condensed Matter · Physics 2015-05-30 Eric DeGiuli , Jim McElwaine
‹ Prev 1 2 3 10 Next ›