Computing correct Delaunay triangulations
From MaRDI portal
Recommendations
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
- NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
- Delaunay triangulations in three dimensions with finite precision arithmetic
- Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
Cited in
(13)- Computing bushy and thin triangulations
- Delaunay triangulations in three dimensions with finite precision arithmetic
- The finite volume method and application in combinations
- New primal and dual matching heuristics
- Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
- Exact computation of Delaunay and power triangulations
- scientific article; zbMATH DE number 6379407 (Why is no real title available?)
- Delaunay properties of digital straight segments
- Star splaying
- A general approach to the analysis of controlled perturbation algorithms
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
- On sorting triangles in a Delaunay tessellation
- Triangulations from topologically correct digital Voronoi diagrams
This page was built for publication: Computing correct Delaunay triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179540)