Nonobtuse triangulation of polygons

DOI10.1007/BF02187904zbMath0634.57012WikidataQ56813846 ScholiaQ56813846MaRDI QIDQ1096930

Brenda S. Baker, Conor S. Rafferty, Eric H. Grosse

Publication date: 1988

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

Full work available at URL: https://eudml.org/doc/131043

Mathematics Subject Classification ID

Related Items (28)

Provably good mesh generation ⋮ Nonobtuse triangulations of PSLGs ⋮ Parallel construction of quadtrees and quality triangulations ⋮ Unnamed Item ⋮ Linear-size nonobtuse triangulation of polygons ⋮ Acute triangulations of the regular dodecahedral surface ⋮ Balanced triangulations ⋮ Error reduction of the adaptive conforming and nonconforming finite element methods with red-green refinement ⋮ Uniformly acute triangulations of polygons ⋮ Obtuse triangle suppression in anisotropic meshes ⋮ A conservative unstructured scheme for rapidly varied flows ⋮ Triangulating a nonconvex polytope ⋮ Acute triangulations of polyhedra and \(\mathbb R^N\) ⋮ Tiling space and slabs with acute tetrahedra. ⋮ High-quality 2D mesh generation without obtuse and small angles ⋮ Upwind Schemes for Scalar Advection-Dominated Problems in the Discrete Exterior Calculus ⋮ Triangulating a convex polygon with fewer number of non-standard bars ⋮ Drawing the planar dual ⋮ Reprint of: Delaunay refinement algorithms for triangular mesh generation ⋮ Acute triangulations of polygons ⋮ Averaging of directional derivatives in vertices of nonobtuse regular triangulations ⋮ QUADRILATERAL MESHING BY CIRCLE PACKING ⋮ PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS ⋮ A matrix analysis approach to discrete comparison principles for nonmonotone PDE ⋮ Acute and nonobtuse triangulations of polyhedral surfaces ⋮ Safe and stabilizing distributed multi-path cellular flows ⋮ Delaunay refinement algorithms for triangular mesh generation ⋮ Polygon Area Decomposition for Multiple-Robot Workspace Division

Cites Work

• Unnamed Item
• Unnamed Item
• The dissection of a polygon into nearly equilateral triangles
• Triangulating a simple polygon
• Triangulation and shape-complexity
• On the Angle Condition in the Finite Element Method
• Computing Dirichlet Tessellations in the Plane
• Condition of finite element matrices generated from nonuniform meshes.
• An asymmetrical finite difference network

This page was built for publication: Nonobtuse triangulation of polygons