hgeometry
hgeometry copied to clipboard
noinia
HGeometry is a library for computing with geometric objects in Haskell. It defines basic geometric types and primitives, and it implements some geometric data structures and algorithms. The main two f...
I tried `delaunayTriangulation` with four points where three are collinear. It fails (i.e. loops) without error message. The input is qsColl = [(Point2 0 0) :+ 'a' , Point2 1...
I tried to use this package as it seems to have a nice collection of geometric algorithms - but without documentation seems impossible. I tried working with the examples -...
e.g. - [x] Arrangement - [x] #205 - [x] Box - [x] PlaneGraph - [x] PlanarSubdivision - [ ] RangeTree - [ ] SegmentTree
Algorithms: - [ ] Pick random point in triangulated polygon. `O(n)`. - [ ] Build a mass-balanced triangle tree such that a random polygon point can be sampled in `O(log...
- [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;...