make-github-pseudonymous-again/js-cg

Issues

• Planar point location data structure.

  #47 opened 5 years ago by make-github-pseudonymous-again
  0

• Vertical ray shooting data structure for non intersecting segments in two dimensions.

  #46 opened 5 years ago by make-github-pseudonymous-again
  0

• max separating rectangle

  #41 opened 9 years ago by make-github-pseudonymous-again
  0

• convex-hull-2d

  #38 opened 10 years ago by make-github-pseudonymous-again
  0

• Chan's Algorithm

  #9 opened 10 years ago by make-github-pseudonymous-again
  1

• compute convex hull using Chan's algorithm O(n log h)

  #35 opened 10 years ago by make-github-pseudonymous-again
  1

• compute convex hull using the Kirkpatrick-Seidel algorithm O(n log h)

  #34 opened 10 years ago by make-github-pseudonymous-again
  1

• compute convex hull using the online algorithm O(log n) per additional vertex

  #32 opened 10 years ago by make-github-pseudonymous-again
  1

• compute convex hull using the incremental algorithm O(n log n)

  #33 opened 10 years ago by make-github-pseudonymous-again
  1

• compute convex hull using the dynamic algorithm O(log² n) per added or removed vertex

  #31 opened 10 years ago by make-github-pseudonymous-again
  1

• implement Akl-Toussaint heuristic for convex hulls

  #30 opened 10 years ago by make-github-pseudonymous-again
  1

• shoelace formula

  #23 opened 10 years ago by make-github-pseudonymous-again
  0

• rayshoot

  #37 opened 10 years ago by make-github-pseudonymous-again
  0

• Fortune's Algorithm

  #22 opened 11 years ago by make-github-pseudonymous-again
  0

• compute convex hull using Quick Hull O(n log n) expected, O(nh) worst case

  #36 opened 11 years ago by make-github-pseudonymous-again
  0

• compute convex hull in O(n^4)

  #24 opened 11 years ago by make-github-pseudonymous-again
  0

• compute convex hull in O(n^3)

  #25 opened 11 years ago by make-github-pseudonymous-again
  0

• compute convex hull in O(n^2)

  #26 opened 11 years ago by make-github-pseudonymous-again
  0

• compute convex hull using Monotonic Graham Scan O(n log n)

  #28 opened 11 years ago by make-github-pseudonymous-again
  0

• compute convex hull using Graham Scan O(n log n)

  #27 opened 11 years ago by make-github-pseudonymous-again
  0

• compute convex hull using Jarvis March O(nh)

  #29 opened 11 years ago by make-github-pseudonymous-again
  0

• convex hull

  #5 opened 11 years ago by make-github-pseudonymous-again
  1

• implement one algorithm using a DCEL

  #20 opened 11 years ago by make-github-pseudonymous-again
  0

• k-d trees

  #21 opened 11 years ago by make-github-pseudonymous-again
  0

• compute two tangents to convex polygon P through point q outside P

  #19 opened 11 years ago by make-github-pseudonymous-again
  0

• compute the intersection of n half-planes

  #18 opened 11 years ago by make-github-pseudonymous-again
  0

• compute centroid

  #17 opened 11 years ago by make-github-pseudonymous-again
  0

• ray casting algorithm

  #16 opened 11 years ago by make-github-pseudonymous-again
  0

• inconvexpolygon( .. )

  #15 opened 11 years ago by make-github-pseudonymous-again
  0

• change all methods so that they are number-system-injectable

  #7 opened 11 years ago by make-github-pseudonymous-again
  0

• tangents to a polygon

  #14 opened 11 years ago by make-github-pseudonymous-again
  0

• polygon triangulation by cutting ears

  #13 opened 11 years ago by make-github-pseudonymous-again
  0

• basic linesweep algorithms

  #12 opened 11 years ago by make-github-pseudonymous-again
  0

• Implement the algorithm for finding ≤n/3 guards for a given polygon

  #11 opened 11 years ago by make-github-pseudonymous-again
  0

• Convex hull linear time algorithms for simple polygons

  #10 opened 11 years ago by make-github-pseudonymous-again
  0

• point location in R^2

  #8 opened 11 years ago by make-github-pseudonymous-again
  0

• ham sandwich cuts

  #6 opened 11 years ago by make-github-pseudonymous-again
  0

• polygon triangulation

  #4 opened 11 years ago by make-github-pseudonymous-again
  0

• point-line duality tools

  #3 opened 11 years ago by make-github-pseudonymous-again
  0

• delaunay triangulation

  #2 opened 11 years ago by make-github-pseudonymous-again
  0

• import code from http://aureooms.wolkom.net/infof420/ham-sandwich/

  #1 opened 11 years ago by make-github-pseudonymous-again
  0