POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
From MaRDI portal
Publication:4030350
DOI10.1142/S0218195992000159zbMath0759.68085MaRDI QIDQ4030350
David Eppstein, Marshall W. Bern
Publication date: 1 April 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (18)
Provably good mesh generation ⋮ Anisotropic mesh transformations and optimal error control ⋮ Nonobtuse triangulations of PSLGs ⋮ Quadrangulations of planar sets ⋮ A framework for advancing front techniques of finite element mesh generation ⋮ Linear-size nonobtuse triangulation of polygons ⋮ Flow simulation and high performance computing ⋮ An optimal bound for high-quality conforming triangulations ⋮ Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon ⋮ Layer based solutions for constrained space-time meshing. ⋮ Obtuse triangle suppression in anisotropic meshes ⋮ Acute triangulations of polyhedra and \(\mathbb R^N\) ⋮ Tiling space and slabs with acute tetrahedra. ⋮ An upper bound for conforming Delaunay triangulations ⋮ Stability and existence of solutions of time-implicit finite volume schemes for viscous nonlinear conservation laws ⋮ 2D and 3D finite element meshing and remeshing ⋮ QUADRILATERAL MESHING BY CIRCLE PACKING ⋮ Acute and nonobtuse triangulations of polyhedral surfaces
This page was built for publication: POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
