Open jeffwack111 opened 3 weeks ago
Douglas–Peucker algorithm as well.
How can we ensure that the coarsening will not cause intersections? We want this check to be within the coarsening loop, implemented as Hubbard describes.
Just the rope type and the intersection methods are good enough to justify using this package even if we need to write our own coarsening procedure for legs
lines and intersection testing implemented