Nonobtuse triangulation of polygons
From MaRDI portal
The authors solve a problem that occurs in partial differential equations (discretization). They triangulate any polygon without using obtuse triangles. Also they point out the impossibility of a simple divide-and- conquer approach. The methods used are elementary.
Recommendations
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- Triangulating a nonconvex polytope
- Linear-size nonobtuse triangulation of polygons
- A non-recursive algorithm for polygon triangulation
- Orthogonal triangulation of polygons
- scientific article; zbMATH DE number 2052963
- On nontriangulable polyhedra
- scientific article; zbMATH DE number 512921
- scientific article; zbMATH DE number 2105675
- On triangulating three-dimensional polygons
Cites work
- An asymmetrical finite difference network
- Computing Dirichlet Tessellations in the Plane
- Condition of finite element matrices generated from nonuniform meshes.
- scientific article; zbMATH DE number 3555381 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- On the Angle Condition in the Finite Element Method
- The dissection of a polygon into nearly equilateral triangles
- Triangulating a simple polygon
- Triangulation and shape-complexity
Cited in
(45)- Acute and nonobtuse triangulations of polyhedral surfaces
- Drawing the planar dual
- Provably good mesh generation
- Tiling space and slabs with acute tetrahedra.
- Delaunay refinement algorithms for triangular mesh generation
- On recursive refinement of convex polygons
- Orthogonal triangulation of polygons
- High-quality 2D mesh generation without obtuse and small angles
- Non-Hamiltonian triangulations with distant separating triangles
- Linear-size nonobtuse triangulation of polygons
- Error reduction of the adaptive conforming and nonconforming finite element methods with red-green refinement
- Reprint of: Delaunay refinement algorithms for triangular mesh generation
- A matrix analysis approach to discrete comparison principles for nonmonotone PDE
- Safe and stabilizing distributed multi-path cellular flows
- Triangulating a convex polygon with fewer number of non-standard bars
- Nonobtuse triangulations of PSLGs
- A conservative unstructured scheme for rapidly varied flows
- On Nonobtuse Simplicial Partitions
- Balanced triangulations
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- Obtuse triangle suppression in anisotropic meshes
- scientific article; zbMATH DE number 2052963 (Why is no real title available?)
- Polygon Area Decomposition for Multiple-Robot Workspace Division
- Acute triangulations of polyhedra and \(\mathbb R^N\)
- Upwind Schemes for Scalar Advection-Dominated Problems in the Discrete Exterior Calculus
- QUADRILATERAL MESHING BY CIRCLE PACKING
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
- scientific article; zbMATH DE number 2105675 (Why is no real title available?)
- On the triangulation without obtuse angles.
- scientific article; zbMATH DE number 1445692 (Why is no real title available?)
- Parallel construction of quadtrees and quality triangulations
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- On nondegenerate triangulation with condensation at the boundary of a domain
- Acute triangulations of polygons
- Uniformly acute triangulations of polygons
- Fat triangles inscribed in arbitrary planar domains
- Averaging of directional derivatives in vertices of nonobtuse regular triangulations
- Equi-Triangulation of Polygons
- Computing non-obtuse triangulations with few Steiner points (CG challenge)
- A study on size-optimal longest edge refinement algorithms
- Hexagonal Delaunay triangulation
- Optimal triangulation of polygons
- Acute triangulations of the regular dodecahedral surface
- Triangulating a nonconvex polytope
This page was built for publication: Nonobtuse triangulation of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096930)
