Pages that link to "Item:Q2484008"
From MaRDI portal
The following pages link to Lower bounds for simplicial covers and triangulations of cubes (Q2484008):
Displaying 19 items.
- Edge detection by adaptive splitting (Q361559) (← links)
- Uniform tree approximation by global optimization techniques (Q600944) (← links)
- Čech type approach to computing homology of maps (Q603858) (← links)
- Representation complexity of adaptive 3D distance fields (Q632926) (← links)
- Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) (Q685587) (← links)
- Products of foldable triangulations (Q875253) (← links)
- On minimal triangulations of products of convex polygons (Q1017917) (← links)
- On simplicial partitions of polytopes (Q1033998) (← links)
- The lower and upper bound problems for cubical polytopes (Q1209839) (← links)
- Lower bounds on cube simplexity (Q1336691) (← links)
- Coating by cubes (Q1339976) (← links)
- Lower bounds for the simplexity of the \(n\)-cube (Q1759408) (← links)
- Edge detection by adaptive splitting. II: The three-dimensional case (Q2276408) (← links)
- On the number of simplices required to triangulate a Lie group (Q2661708) (← links)
- Force-stepping integrators in Lagrangian mechanics (Q3065654) (← links)
- A Lower Bound Technique for Triangulations of Simplotopes (Q4601211) (← links)
- Almost Simplicial Polytopes: The Lower and Upper Bound Theorems (Q5222174) (← links)
- Efficient P1-FEM for any space dimension in \textsc{Matlab} (Q6557143) (← links)
- Cellular approximations to the diagonal map (Q6657199) (← links)