Add to ORKGWe consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface is connected. We give upper bounds on the number of edge flips that are necessary to transform any geometric triangulation on such a surface into a Delaunay triangulation
peer reviewedWe study flip-graphs of triangulations on topological surfaces where distance is measur...
Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay t...
Given a triangulated piecewise-flat surface and a function on the vertices we can define the Dirichl...
We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized b...
Triangulations are among the most important and well-studied objects in computational geometry. A tr...
In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—...
We review results concerning edge flips in triangulations concentrating mainly on various aspects of...
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. W...
AbstractAny two triangulations of a closed surface with the same number of vertices can be transform...
Motivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal ...
Flips in triangulations have received a lot of attention over the past decades. However, the problem...
Seiya Negami showed that any two triangulations of a closed surface with the same number of vertices...
Guided by insights on the mapping class group of a surface, we give experimental evidence that the u...
The set of all triangulations of a finite point set in the plane attains structure via flips: The gr...
Intrinsic Delaunay triangulation (IDT) naturally generalizes Delaunay triangulation from R2 to curve...
peer reviewedWe study flip-graphs of triangulations on topological surfaces where distance is measur...
Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay t...
Given a triangulated piecewise-flat surface and a function on the vertices we can define the Dirichl...
We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized b...
Triangulations are among the most important and well-studied objects in computational geometry. A tr...
In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—...
We review results concerning edge flips in triangulations concentrating mainly on various aspects of...
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. W...
AbstractAny two triangulations of a closed surface with the same number of vertices can be transform...
Motivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal ...
Flips in triangulations have received a lot of attention over the past decades. However, the problem...
Seiya Negami showed that any two triangulations of a closed surface with the same number of vertices...
Guided by insights on the mapping class group of a surface, we give experimental evidence that the u...
The set of all triangulations of a finite point set in the plane attains structure via flips: The gr...
Intrinsic Delaunay triangulation (IDT) naturally generalizes Delaunay triangulation from R2 to curve...
peer reviewedWe study flip-graphs of triangulations on topological surfaces where distance is measur...
Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay t...
Given a triangulated piecewise-flat surface and a function on the vertices we can define the Dirichl...