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

DOI10.1137/0913058zbMath0754.65093WikidataQ55896541 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 element; minimum weight triangulation; computational geometry; Delaunay triangulation; surface approximation; polygon triangulation; constrained triangulation; edge insertion; iterative improvement method; edge-insertion scheme; minmax angle triangulation

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs

65D17: Computer-aided design (modeling of curves and surfaces)

Related Items

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