Pages that link to "Item:Q5955142"
From MaRDI portal
The following pages link to Approximation for minimum triangulations of simplicial convex 3-polytopes (Q5955142):
Displaying 11 items.
- An iterative interface reconstruction method for PLIC in general convex grids as part of a coupled level set volume of fluid solver (Q725454) (← links)
- Minimal simplicial dissections and triangulations of convex 3-polytopes (Q1577546) (← links)
- Polynomial-size vectors are enough for the unimodular triangulation of simplicial cones (Q2229183) (← links)
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees (Q2387200) (← links)
- Approximation for minimum triangulation of convex polyhedra (Q2768283) (← links)
- Algorithms for triangulating polyhedra into a small number of tetrahedra (Q3424580) (← links)
- (Q4263585) (← links)
- (Q4474087) (← links)
- (Q4952659) (← links)
- (Q5009355) (← links)
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points (Q5114888) (← links)