The following pages link to Simplexity of the cube (Q1815315):
Displaying 16 items.
- On \(0/1\)-polytopes with nonobtuse triangulations (Q669635) (← links)
- Products of foldable triangulations (Q875253) (← links)
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- Simplicial isosurfacing in arbitrary dimension and codimension (Q1408435) (← links)
- Asymptotically efficient triangulations of the \(d\)-cube (Q1422223) (← links)
- Lower bounds for the simplexity of the \(n\)-cube (Q1759408) (← links)
- Convex envelopes for edge-concave functions (Q1780948) (← links)
- A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes (Q1964654) (← links)
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
- Assymptotically efficient triangulations of the d-cube∗ (Q3438984) (← links)
- A Lower Bound Technique for Triangulations of Simplotopes (Q4601211) (← links)
- What is known about unit cubes (Q4663501) (← links)
- A linear programming approach to difference-of-convex piecewise linear approximation (Q6090153) (← links)
- Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability (Q6554650) (← links)
- Efficient P1-FEM for any space dimension in \textsc{Matlab} (Q6557143) (← links)
