Frank Staals
Frank Staals
Any plans on releasing webviewhs on hackage? That would simplify the installation of downstream packages as well.
e.g. - [x] Arrangement - [x] #205 - [x] Box - [x] PlaneGraph - [x] PlanarSubdivision - [ ] RangeTree - [ ] SegmentTree
- [x] Further SoS testing - [x] SoS Cleanup - [x] use SoS in 2d convex hull as proof of concept - [ ] use SoS in 3D convex hull
so that we can filter edges in planar subdivisions
i..e. implement some numeric type that maintains two doubles and uses those to resolve comparisons first.
After fixing a bug in the inTriangleRelaxed implementation, the hashed methods for the ear-clipping triangulation seem to loop. I'm guessing in some shrinking step. I've disabled the tests for now;...
See if we can use more robust floating point predicates based on Jonathan Shewchuk's implementations. See https://www.cs.cmu.edu/~quake/robust.html https://github.com/mourner/robust-predicates for details.
See if switching to the sorting algorithms from vector-algorithms (over the merge-sort based List.sort) improves results on say convex hull, polygon triangulation etc.