An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation

DOI10.1137/0913058zbMath0754.65093OpenAlexW2045893335WikidataQ55896541 ScholiaQ55896541MaRDI QIDQ4009010

Tiow Seng Tan, Herbert Edelsbrunner, Roman Waupotitsch

Publication date: 27 September 1992

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0913058

zbMATH Keywords

finite elementminimum weight triangulationcomputational geometryDelaunay triangulationsurface approximationpolygon triangulationconstrained triangulationedge insertioniterative improvement methodedge-insertion schememinmax angle triangulation

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

Edge insertion for optimal triangulations, An optimal bound for high-quality conforming triangulations, Approximating spheres and sphere patches, On the impact of triangle shapes for boundary layer problems using high-order finite element discretization, INSIM-FT in three-dimensions with gravity, Geometrical aggregation of finite fuzzy sets, Flips in planar graphs, Optimization for first order Delaunay triangulations, Simplicial complex with approximate rotational symmetry: a general class of simplicial complexes, LMT-skeleton heuristics for several new classes of optimal triangulations, INSIM-BHP: a physics-based data-driven reservoir model for history matching and forecasting with bottomhole pressure and production rate data under waterflooding, Structural tolerance and Delaunay triangulation