An upper bound for conforming Delaunay triangulations

DOI10.1007/BF02573974zbMath0774.68093MaRDI QIDQ685182

Herbert Edelsbrunner, Tiow Seng Tan

Publication date: 30 September 1993

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131270

zbMATH Keywords

Delaunay triangulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (16)

Nonobtuse triangulations of PSLGs ⋮ Linear-size nonobtuse triangulation of polygons ⋮ An optimal bound for high-quality conforming triangulations ⋮ Conforming Delaunay triangulations in 3D ⋮ An enhanced semi-explicit particle finite element method for incompressible flows ⋮ A novel model of conforming Delaunay triangulation for sensor network configuration ⋮ A Lagrangian nodal integration method for free-surface fluid flows ⋮ Improving accuracy of the moving grid particle finite element method via a scheme based on Strang splitting ⋮ General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties ⋮ 2D and 3D finite element meshing and remeshing ⋮ A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION ⋮ A Gabriel-Delaunay triangulation of 2D complex fractured media for multiphase flow simulations ⋮ PFEM formulation for thermo-coupled FSI analysis. Application to nuclear core melt accident ⋮ 3D regularized \(\mu(I)\)-rheology for granular flows simulation ⋮ PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES ⋮ Triangulations in CGAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal roughness property of the Delaunay triangulation
• Generalized Delaunay triangulation for planar graphs
• A sweepline algorithm for Voronoi diagrams
• Corrections to Lee's visibility polygon algorithm
• Delaunay triangulation of arbitrarily shaped planar domains
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Provably good mesh generation
• Representing stereo data with the Delaunay triangulation
• Visibility of a simple polygon
• On Optimal Interpolation Triangle Incidences
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• A linear algorithm for computing the visibility polygon from a point
• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
• Automatic triangulation of arbitrary planar domains for the finite element method

This page was built for publication: An upper bound for conforming Delaunay triangulations