The following pages link to A triangulation of the n-cube (Q1163234):
Displaying 17 items.
- Probability density function estimation with the frequency polygon transform (Q528669) (← links)
- Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) (Q685587) (← links)
- A note on triangulating the 5-cube (Q802144) (← links)
- A simple and relatively efficient triangulation of the n-cube (Q804290) (← links)
- Minimal triangulation of the 4-cube (Q1163235) (← links)
- A note on minimal triangulations of an n-cube (Q1166776) (← links)
- A better triangulation for Wright's \(2^n\)-ray algorithm (Q1365094) (← links)
- Simplicial isosurfacing in arbitrary dimension and codimension (Q1408435) (← links)
- Lower bounds for the simplexity of the \(n\)-cube (Q1759408) (← links)
- Convex envelopes for edge-concave functions (Q1780948) (← links)
- Simplexity of the cube (Q1815315) (← links)
- Unique representation in convex sets by extraction of marked components (Q1837113) (← links)
- A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes (Q1964654) (← links)
- Bayesian inference over ICA models: application to multibiometric score fusion with quality estimates (Q2953276) (← links)
- $J'$: A New Triangulation of $R^n $ (Q3330396) (← links)
- The Middle-Cut Triangulations of the <i>n</i>-Cube (Q3331832) (← links)
- Extensions of functions of 0-1 variables and applications to combinatorial optimization (Q3337950) (← links)
