\textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
From MaRDI portal
Publication:6551197
DOI10.1142/S1793830923500143MaRDI QIDQ6551197
Trinh Minh Duc, Dang Thi Oanh, Phan Thanh An
Publication date: 6 June 2024
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A parallel algorithm based on convexity for the computing of Delaunay tessellation
- Delaunay triangulation and the convex hull of n points in expected linear time
- Higher-dimensional Voronoi diagrams in linear expected time
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- A sweepline algorithm for Voronoi diagrams
- Design and implementation of a practical parallel Delaunay algorithm
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Applications of random sampling in computational geometry. II
- 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
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
- Two algorithms for constructing a Delaunay triangulation
- Method of orienting curves for solving optimal control problems with state constraints1
- Computing Dirichlet Tessellations in the Plane
- Computational Geometry in C
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- 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)
