\textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations

DOI10.1142/S1793830923500143MaRDI QIDQ6551197zbMATH OpenFDO

Authors Phan Thanh An, Trinh Minh Duc, Dang Thi Oanh

Publication date 6 June 2024

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830923500143

zbMATH Keywords

Delaunay triangulationdivide-and-conquermethod of orienting curves

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07)

Recommendations

• scientific article; zbMATH DE number 4062599
• A fast algorithm for constructing Delaunay triangulations in the plane
• A faster circle-sweep Delaunay triangulation algorithm
• A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations

Cites work

• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• A parallel algorithm based on convexity for the computing of Delaunay tessellation
• A sweepline algorithm for Voronoi diagrams
• Applications of random sampling in computational geometry. II
• Computational Geometry in C
• Computing Dirichlet Tessellations in the Plane
• Delaunay triangulation and the convex hull of n points in expected linear time
• Design and implementation of a practical parallel Delaunay algorithm
• Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
• Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
• Higher-dimensional Voronoi diagrams in linear expected time
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1079755 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• Method of orienting curves for determining the convex hull of a finite set of points in the plane
• Method of orienting curves for solving optimal control problems with state constraints¹
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Two algorithms for constructing a Delaunay triangulation
• Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven

This page was built for publication: \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551197)