StackGenVis: Alignment of Data, Algorithms, and Models for Stacking Ensemble Learning Using Performance Metrics
https://doi.org/10.1109/TVCG.2020.3030352
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
37 lines
823 B
37 lines
823 B
triangulate-hypercube
|
|
=====================
|
|
Triangulates an n-dimensional hypercube into a collection of simplices.
|
|
|
|
**Note:** In high dimensions, this triangulation is not very efficient. Pull requests welcome.
|
|
|
|
# Example
|
|
|
|
```javascript
|
|
var triangulateCube = require("triangulate-hypercube")
|
|
|
|
console.log(triangulateCube(2))
|
|
```
|
|
|
|
Output:
|
|
|
|
```javascript
|
|
[ [ 3, 2, 0 ], [ 0, 1, 3 ] ]
|
|
```
|
|
|
|
# Install
|
|
|
|
```
|
|
npm install triangulate-hypercube
|
|
```
|
|
|
|
# API
|
|
|
|
#### `require("triangulate-hypercube")(dimension)`
|
|
Computes a decomposition of an n-dimensional hypercube into simplices using a naive permutation based algorithm.
|
|
|
|
* `dimension` is an integer representing the dimension of the hypercube to triangulate
|
|
|
|
**Returns** A list of `n` dimensional simplices which subdivide the cube.
|
|
|
|
# Credits
|
|
(c) 2014 Mikola Lysenko. MIT License |