Pages that link to "Item:Q1906047"
From MaRDI portal
The following pages link to Bounds on the size of tetrahedralizations (Q1906047):
Displaying 7 items.
- Efficiently hex-meshing things with topology (Q471135) (← links)
- Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon (Q1924710) (← links)
- Strategies for polyhedral surface decomposition: an experimental study. (Q2482891) (← links)
- The cubic limiting complexes of the tetragonal lattice complexes (Q2887889) (← links)
- 3D boundary recovery by constrained Delaunay tetrahedralization (Q3018042) (← links)
- Almost tight upper bounds for vertical decompositions in four dimensions (Q3069906) (← links)
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points (Q5114888) (← links)