Incremental topological flipping works for regular triangulations

  title={Incremental topological flipping works for regular triangulations},
  author={Herbert Edelsbrunner and Nimish R. Shah},
A set ofn weighted points in general position in ℝd defines a unique regular triangulation. This paper proves that if the points are added one by one, then flipping in a topological order will succeed in constructing this triangulation. If, in addition, the points are added in a random sequence and the history of the flips is used for locating the next point, then the algorithm takes expected time at mostO(nlogn+n[d/2]). Under the assumption that the points and weights are independently and… 
Construction of the segment Delaunay triangulation by a flip algorithm
The main result of this paper is that any given segment triangulation can be transformed by a finite sequence of local improvements in a segment Triangulation that has the same topological structure as the segment Delaunay triangulations of S.
A new insertion sequence for incremental Delaunay triangulation
Using parent nodes as search-hints and a simple deterministic insertion sequence based on the breadth-first-search on a Kd-tree with some minor modifications for better performance proves to be faster and more stable than the Hilbert curve order and biased randomized insertion order (BRIO).
Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips
In geometric data processing, structures that partition the geometric input, as well as connectivity structures for geometric objects, play an important role and triangular meshes, often called triangulations, are a versatile tool.
Delaunay Edge Flips in Dense Surface Triangulations
It is shown that the surface triangulations which closely approximate a smooth surface with uniform density can be transformed to a Delaunay triangulation with a simple edge flip algorithm.
Constrained Construction of Planar Delaunay Triangulations without Flipping
A novel method of construction is proposed, which is based directly on the empty circle property of Delaunay, which permits convenient specification of the constraints and the triangulation of concave and multiply-connected domains.
Dense point sets have sparse Delaunay triangulations
It is proved that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3), and this upper bound is tight in the worst case for all D = O(sqrt{n}.
Nice Point Sets Can Have Nasty Delaunay Triangulations
A family of smooth connected surfaces is constructed such that the Delaunay triangulation of any good point sample has near-quadratic complexity.
Conforming weighted delaunay triangulations
  • M. Alexa
  • Computer Science
    ACM Trans. Graph.
  • 2020
An algorithm that incrementally selects a small subset of inequalities, repeatedly updating the weights, until the weighted Delaunay triangulation contains all constrained simplices or the problem becomes infeasible is devised.
Fast Delaunay Triangulation and Voronoi Diagram Generation on the Sphere
A heuristic point search method which can locate a random point within the current triangle efficiently and test the performance on a collection of point sample sets and demonstrate a 30% performance improvement compared to existing 3D randomized incremental algorithms.
Relaxing and lifting triangulations
This work investigates the differences between triangulations and pseudo-triangulations with respect to the optimality criterion of minimal total edge length, and shows that, although (especially pointed) pseudotriangulations have significantly less edges than triangulation, the minimum weight pseudotRIangulation can be a triangulated in general.


Three-dimensional triangulations from local transformations
A new algorithm is presented that uses a local transformation procedure to construct a triangulation of a set of n three-dimensional points that is pseudo-locally optimal with respect to the sphere
Optimality of the Delaunay triangulation in Rd
It is shown that if a triangulation consists of only self-centered triangles (a simplex whose circumcenter falls inside the simplex), then it is the Delaunay triangulated, and the weighted sum of squares of the edge lengths is the smallest for Delaunays triangulations.
On the Randomized Construction of the Delaunay Tree
Construction of three-dimensional Delaunay triangulations using local transformations
  • B. Joe
  • Computer Science, Mathematics
    Comput. Aided Geom. Des.
  • 1991
Properties of n-dimensional triangulations
  • C. Lawson
  • Mathematics
    Comput. Aided Geom. Des.
  • 1986
Higher-dimensional voronoi diagrams in linear expected time
A general method is presented for determining the mathematical expectation of the combinatorial complexity and other properties of the Voronoi diagram ofn independent and identically distributed
On the shape of a set of points in the plane
A generalization of the convex hull of a finite set of points in the plane leads to a family of straight-line graphs, "alpha -shapes," which seem to capture the intuitive notions of "fine shape" and "crude shape" of point sets.
Applications of random sampling in computational geometry, II
Asymptotically tight bounds for (≤k)-sets are given, which are certain halfspace partitions of point sets, and a simple proof of Lee's bounds for high-order Voronoi diagrams is given.
Software for C1 Surface Interpolation
Constructing higher-dimensional convex hulls at logarithmic cost per face
  • R. Seidel
  • Computer Science, Mathematics
    STOC '86
  • 1986
The main tool in this new approach is the notion of a straight line shelling of a polytope in convex hull problems, which has best case time complexity O(m 2 -tFlogm), which is an improvement over the best previously achieved bounds for a large range of values of F.