An optimal bound for high-quality conforming triangulations

DOI10.1007/BF02717730zbMath0843.68090OpenAlexW2075801335MaRDI QIDQ1911767

Tiow Seng Tan

Publication date: 24 April 1996

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

Full work available at URL: https://doi.org/10.1007/bf02717730

zbMATH Keywords

triangulation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Nonobtuse triangulations of PSLGs

Cites Work

• Unnamed Item
• Unnamed Item
• An upper bound for conforming Delaunay triangulations
• Three- and four-dimensional surfaces
• Incremental topological flipping works for regular triangulations
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
• On the Angle Condition in the Finite Element Method
• Automatic triangulation of arbitrary planar domains for the finite element method

This page was built for publication: An optimal bound for high-quality conforming triangulations