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.
|
|
5 years ago | |
|---|---|---|
| .. | ||
| bench | 5 years ago | |
| example | 5 years ago | |
| test | 5 years ago | |
| .npmignore | 5 years ago | |
| .travis.yml | 5 years ago | |
| LICENSE | 5 years ago | |
| README.md | 5 years ago | |
| delaunay3d.png | 5 years ago | |
| package.json | 5 years ago | |
| triangulate.js | 5 years ago | |
README.md
delaunay-triangulate
Triangulates a set of points into a Delaunay triangulation. This code works in arbitrary dimensions, and both in the server and in the browser.
Here are some in browser demos:
Example
var triangulate = require("delaunay-triangulate")
var points = [
[0, 1],
[1, 0],
[1, 1],
[0, 0],
[0.5, 0.5]
]
var triangles = triangulate(points)
console.log(triangles)
Install
npm install delaunay-triangulate
API
require("delaunay-triangulate")(points[,pointAtInfinity])
Constructs a Delaunay triangulation over points
pointsis a collection of points in Euclidean space.pointAtInfinityis a flag, which if set adds an extra point at infinity to give the spherical compactification of the triangulation. The index of the point at infinity is-1
Returns A list of cells representing the faces of the triangulation. These are triangles in 2D or tetrahedra in 3D.
Credits
(c) 2013-2014 Mikola Lysenko. MIT License

