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.
 
 
 
 
StackGenVis/frontend/node_modules/incremental-convex-hull
Angelos Chatzimparmpas f521a3509d paper-version 4 years ago
..
example paper-version 4 years ago
test paper-version 4 years ago
.npmignore paper-version 4 years ago
.travis.yml paper-version 4 years ago
LICENSE paper-version 4 years ago
README.md paper-version 4 years ago
ich.js paper-version 4 years ago
package.json paper-version 4 years ago

README.md

incremental-convex-hull

Computes the convex hull of a collection of points in general position by incremental insertion. No attempt is made to handle degeneracies.

This module is meant to be used internally by other modules for calculating convex hulls and Delaunay triangulations. You probably shouldn't call it directly unless you know what you are doing. Instead, there will (eventually) be a wrapper over this module that handles all the special cases and correctly generates a convex hull.

testling badge

build status

Example

var ch = require("incremental-convex-hull")
var points = [
  [0, 0, 0],
  [0, 0, 1],
  [0, 1, 0],
  [1, 0, 0],
  [1, 1, 1]
]
console.log(ch(points))

Output:

[ [ 0, 2, 3 ],
  [ 1, 0, 3 ],
  [ 0, 1, 2 ],
  [ 2, 4, 3 ],
  [ 4, 1, 3 ],
  [ 1, 4, 2 ] ]

Install

npm install incremental-convex-hull

API

require("incremental-convex-hull")(points[, randomInsert])

Constructs a triangulation of the convex hull of points by incremental insertion.

  • points is a list of points
  • randomInsert is a flag, which if set uses a randomized jump and walk instead of walking from the last inserted facet.

Returns A list of the boundary cells of the convex hull of the point cloud.

Notes This module works in any dimension greater than 2, though becomes pretty slow after 5d.

License

(c) 2014 Mikola Lysenko. MIT License