Pages that link to "Item:Q4030350"
From MaRDI portal
The following pages link to POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS (Q4030350):
Displaying 22 items.
- Nonobtuse triangulations of PSLGs (Q306497) (← links)
- Obtuse triangle suppression in anisotropic meshes (Q426170) (← links)
- Acute triangulations of polyhedra and \(\mathbb R^N\) (Q452820) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- Acute and nonobtuse triangulations of polyhedral surfaces (Q1024275) (← links)
- Nonobtuse triangulation of polygons (Q1096930) (← links)
- An algorithm for set operations on nonconvex polygons (with an application to census tracts) (Q1112631) (← links)
- Provably good mesh generation (Q1329150) (← links)
- Anisotropic mesh transformations and optimal error control (Q1330491) (← links)
- Flow simulation and high performance computing (Q1368145) (← links)
- Layer based solutions for constrained space-time meshing. (Q1405147) (← links)
- Tiling space and slabs with acute tetrahedra. (Q1428462) (← links)
- A framework for advancing front techniques of finite element mesh generation (Q1899932) (← links)
- Linear-size nonobtuse triangulation of polygons (Q1906045) (← links)
- An optimal bound for high-quality conforming triangulations (Q1911767) (← links)
- Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon (Q1924710) (← links)
- Polynomial-size vectors are enough for the unimodular triangulation of simplicial cones (Q2229183) (← links)
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001) (Q2777710) (← links)
- QUADRILATERAL MESHING BY CIRCLE PACKING (Q4682180) (← links)
- Quadrangulations of planar sets (Q5057435) (← links)
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points (Q5114888) (← links)
- Stability and existence of solutions of time-implicit finite volume schemes for viscous nonlinear conservation laws (Q5932825) (← links)
