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...
If I load this file [here](https://github.com/aavogt/delaunay-bug/blob/master/main.hs) with cabal repl, `bd` and `br` get stuck after printing out `_neighbours =`. DelaunayTriangulation.Naive works, but it is too slow to help me find...
The comment for buildKDTree says: Expects the input to be a set, i.e. no duplicates. The error message could say something about buildKDTree. Currently the error looks like the following:...
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.
Hi. Im trying to do some intersections. 45> circle = Ball.Circle (ext $ Point2 0 0) (1::Double) 46> segment r x = LineSegment (Closed . ext $ (Point2 0 0))...
I'd like to implement uniform polygon sampling. I've added uniform triangle sampling, but am still working on the other methods. Any and all feedback, criticism, or best practices information would...
# 1. ~~Random, monotone polygons.~~ Done! PR: #95. Thank you @1ndy! # 2. Ray-casting visibility polygon. ### What? Imagine that the edges of a polygon represents the walls of a...
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.
For working with Boxes / Rectangles, it might make sense to have concepts splitting a rectangle into 2, 4, or 9 subrectangles, and having concepts such as West/East, North/South, NorthWest,...
Can you add some collision detection algorithms (something like https://github.com/vrld/HC)?
