scientific article; zbMATH DE number 4062599

MaRDI QIDQ3796756zbMATH OpenFDO

Authors Jyrki Katajainen, M. Koppinen

Publication date 1988

zbMATH Keywords

cell techniquescomputational geometryDelaunay triangulationdivide-and-conquer algorithmquadtree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Recommendations

• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• A comparison of sequential Delaunay triangulation algorithms.
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
• DELAUNAY TRIANGULATIONS IN THE PLANE WITH ${\mathcal O} (\sqrt{N} \log N)$ STORAGE REQUIREMENTS
• A fast algorithm for constructing Delaunay triangulations in the plane

Cited in

(10)

• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• The maximum opposite angulation for mesh construction
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
• A comparison of sequential Delaunay triangulation algorithms.
• Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent
• scientific article; zbMATH DE number 1156715 (Why is no real title available?)
• DELAUNAY TRIANGULATIONS IN THE PLANE WITH ${\mathcal O} (\sqrt{N} \log N)$ STORAGE REQUIREMENTS
• Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent
• The stochastic walk algorithms for point location in pseudo-triangulations
• \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations

This page was built for publication:

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