issues
search
make-github-pseudonymous-again
/
js-convex-hull-2d
:gem: Convex hull algorithms in R² for JavaScript
https://make-github-pseudonymous-again.github.io/js-convex-hull-2d
GNU Affero General Public License v3.0
1
stars
0
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Update aureooms-js-array to version 4.0.0 🚀
#17
greenkeeperio-bot
closed
7 years ago
2
Update dependencies to enable Greenkeeper 🌴
#16
greenkeeper[bot]
closed
4 years ago
0
Update aureooms-js-heapsort to version 9.0.0 🚀
#15
greenkeeperio-bot
closed
7 years ago
2
Update aureooms-js-itertools to version 3.0.0 🚀
#14
greenkeeperio-bot
closed
7 years ago
2
👻😱 Node.js 0.10 is unmaintained 😱👻
#13
greenkeeperio-bot
closed
4 years ago
1
Update aureooms-node-package to version 7.0.0 🚀
#12
greenkeeperio-bot
closed
4 years ago
0
Update all dependencies 🌴
#11
greenkeeperio-bot
closed
4 years ago
1
handle case n < 4 properly
#10
make-github-pseudonymous-again
opened
8 years ago
0
fix quickhull
#9
make-github-pseudonymous-again
opened
8 years ago
0
use generators where useful
#8
make-github-pseudonymous-again
closed
8 years ago
0
Chan's Algorithm
#7
make-github-pseudonymous-again
opened
8 years ago
1
compute convex hull using Chan's algorithm O(n log h)
#6
make-github-pseudonymous-again
opened
8 years ago
1
compute convex hull using the Kirkpatrick-Seidel algorithm O(n log h)
#5
make-github-pseudonymous-again
opened
8 years ago
1
compute convex hull using the incremental algorithm O(n log n)
#4
make-github-pseudonymous-again
opened
8 years ago
1
compute convex hull using the online algorithm O(log n) per additional vertex
#3
make-github-pseudonymous-again
opened
8 years ago
1
compute convex hull using the dynamic algorithm O(log² n) per added or removed vertex
#2
make-github-pseudonymous-again
opened
8 years ago
1
implement Akl-Toussaint heuristic for convex hulls
#1
make-github-pseudonymous-again
opened
8 years ago
1