Frank Staals

> > > There is also a fairly simple O(n log n) time sweepline algorithm that even works in polygons with holes (rotate a half-line around the query point ;...

I've opened up a separate issue (#71) to discuss things related to visual unit tests and debugging. In terms of features I think there are also some low hanging fruits...

By the way; for visibilityPolygon from edge: me and some collegues are working on a very simple O(n) time algorithm in triangulated polygons. One of our students implemented it in...

> > In terms of features I think there are also some low hanging fruits like: > > ``` > > * [ ] add a concrete implementation of a...

Do you just want to test if, say two polygons, intersect? Or do you want something along the lines of "given two polygons and two movement vectors, find the time...

It is unnecessary to split the polygons into triangles. Using the algorithms currently in the package it should be fairly easy to test if two arbitrary polygons intersect in O(n...

I don't think we really have such documentation at this point right? Or do you have a particular "part" of hgeometry in mind that specifically needs this kind of documentation?...

Does this strategy of sampling triangles really produce a uniform sampling? Intuitively it seems similar to sampling in a disk by taking an uniform sample of polar coordinates. However that...

I'm not David, but I think you're good to start implementing stuff now ;). You may want to give this pull request a useful name to that end :).

In the master branch here on github (yet unreleased on hackage) the modules were renamed; as you observed the modules which were named Data.Geometry.XYZ are now simply called Geometry.XYZ. So...