An upper bound for conforming Delaunay triangulations
From MaRDI portal
Publication:685182
DOI10.1007/BF02573974zbMATH Open0774.68093MaRDI QIDQ685182FDOQ685182
Authors: 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
Recommendations
- A tight bound for the Delaunay triangulation of points on a polyhedron
- Conforming Delaunay triangulations in 3D
- Conforming Delaunay triangulations in 3D
- An optimal bound for high-quality conforming triangulations
- Delaunay-admissibilité des triangulations de surfaces
- Constrained Delaunay triangulations
- Constrained higher order Delaunay triangulations
- Improved upper bound on the stretch factor of Delaunay triangulations
- Towards a definition of higher order constrained Delaunay triangulations
- Duality of constrained Voronoi diagrams and Delaunay triangulations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sweepline algorithm for Voronoi diagrams
- Provably good mesh generation
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Title not available (Why is that?)
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
- On Optimal Interpolation Triangle Incidences
- Title not available (Why is that?)
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Generalized Delaunay triangulation for planar graphs
- Corrections to Lee's visibility polygon algorithm
- Minimal roughness property of the Delaunay triangulation
- A linear algorithm for computing the visibility polygon from a point
- Visibility of a simple polygon
- Representing stereo data with the Delaunay triangulation
- Automatic triangulation of arbitrary planar domains for the finite element method
- Delaunay triangulation of arbitrarily shaped planar domains
Cited In (24)
- Angle-monotonicity of Delaunay triangulation
- An enhanced semi-explicit particle finite element method for incompressible flows
- A monotonicity property for weighted Delaunay triangulations
- Towards a definition of higher order constrained Delaunay triangulations
- 3D regularized \(\mu(I)\)-rheology for granular flows simulation
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
- Title not available (Why is that?)
- A Gabriel-Delaunay triangulation of 2D complex fractured media for multiphase flow simulations
- Triangulations in CGAL
- Nonobtuse triangulations of PSLGs
- Conforming Delaunay triangulations in 3D
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
- Linear-size nonobtuse triangulation of polygons
- A novel model of conforming Delaunay triangulation for sensor network configuration
- Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks
- Improving accuracy of the moving grid particle finite element method via a scheme based on Strang splitting
- An optimal bound for high-quality conforming triangulations
- PFEM formulation for thermo-coupled FSI analysis. Application to nuclear core melt accident
- A uniqueness theorem for Delaunay graphs
- A Lagrangian nodal integration method for free-surface fluid flows
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Outerplanar graphs and Delaunay triangulations
- PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
This page was built for publication: An upper bound for conforming Delaunay triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685182)
