Exactly computes the orientation of a tuple of points
Want to see pretty graphs? Log in now!
npm install robust-orientation
|5||downloads in the last week|
|25||downloads in the last month|
|Last Published By|
|Version||1.0.1 last updated a month ago|
|Keywords||robust, orientation, point, predicate, geometry|
|Dependencies||robust-scale, robust-sum, two-product, robust-subtract|
|Dependents (12)||bitmap-triangulate, compare-angle, incremental-delaunay, mikolalysenko-hoarders, planar-graph-to-polyline, point-in-big-polygon, robust-point-in-polygon, robust-point-in-simplex, robust-segment-intersect, simplify-2d-complex, simplify-planar-graph, slab-decomposition|
Robust orientation test for n-simplices. Based on the work of Jonathan Shewchuk:
This implementation is robust in the sense that the answers returned are exact, but it is not fully adaptive. Basically an initial test is computed, and if the accuracy of this is too low then an exact version of the test is executed. Compared to Shewchuk's original C code this is slower, but eventually I hope to make improvements that bring the performance closer in line to his version.
var orientation = require("robust-orientation") console.log(orientation([0, 0], [1e-64, 0], [0, 1]))
require("robust-orientation")(p0, p1, p2, ...)
Exactly computes the orientation of a collection of (n+1) points in n-dimensions.
p0,p1,p2,...is a list of points
Returns The orientation of the point set:
<0if the tuple of points is positively oriented
>0if the tuple of points is negatively oriented
=0if the points are coplanar
(c) 2013 Mikola Lysenko. MIT License