make-github-pseudonymous-again/js-cg
:triangular_ruler: Computational geometry data structures and algorithms for JavaScript
HTMLAGPL-3.0
Issues
- 0
- 0
Vertical ray shooting data structure for non intersecting segments in two dimensions.
#46 opened by make-github-pseudonymous-again - 0
max separating rectangle
#41 opened by make-github-pseudonymous-again - 0
convex-hull-2d
#38 opened by make-github-pseudonymous-again - 1
Chan's Algorithm
#9 opened by make-github-pseudonymous-again - 1
- 1
compute convex hull using the Kirkpatrick-Seidel algorithm O(n log h)
#34 opened by make-github-pseudonymous-again - 1
compute convex hull using the online algorithm O(log n) per additional vertex
#32 opened by make-github-pseudonymous-again - 1
compute convex hull using the incremental algorithm O(n log n)
#33 opened by make-github-pseudonymous-again - 1
compute convex hull using the dynamic algorithm O(log² n) per added or removed vertex
#31 opened by make-github-pseudonymous-again - 1
- 0
shoelace formula
#23 opened by make-github-pseudonymous-again - 0
rayshoot
#37 opened by make-github-pseudonymous-again - 0
Fortune's Algorithm
#22 opened by make-github-pseudonymous-again - 0
compute convex hull using Quick Hull O(n log n) expected, O(nh) worst case
#36 opened by make-github-pseudonymous-again - 0
- 0
- 0
- 0
compute convex hull using Monotonic Graham Scan O(n log n)
#28 opened by make-github-pseudonymous-again - 0
- 0
- 1
convex hull
#5 opened by make-github-pseudonymous-again - 0
- 0
k-d trees
#21 opened by make-github-pseudonymous-again - 0
compute two tangents to convex polygon P through point q outside P
#19 opened by make-github-pseudonymous-again - 0
- 0
compute centroid
#17 opened by make-github-pseudonymous-again - 0
ray casting algorithm
#16 opened by make-github-pseudonymous-again - 0
inconvexpolygon( .. )
#15 opened by make-github-pseudonymous-again - 0
change all methods so that they are number-system-injectable
#7 opened by make-github-pseudonymous-again - 0
tangents to a polygon
#14 opened by make-github-pseudonymous-again - 0
- 0
basic linesweep algorithms
#12 opened by make-github-pseudonymous-again - 0
Implement the algorithm for finding ≤n/3 guards for a given polygon
#11 opened by make-github-pseudonymous-again - 0
- 0
point location in R^2
#8 opened by make-github-pseudonymous-again - 0
ham sandwich cuts
#6 opened by make-github-pseudonymous-again - 0
polygon triangulation
#4 opened by make-github-pseudonymous-again - 0
- 0
delaunay triangulation
#2 opened by make-github-pseudonymous-again - 0
import code from http://aureooms.wolkom.net/infof420/ham-sandwich/
#1 opened by make-github-pseudonymous-again