Random ConvexPolygon in O(n log n)

[lemmih]

This PR includes:

• Point orientation functions that operate without Data.Ext. Style matches ccw/ccw': sortAround/sortAround', 'ccwCmpAround/ccwCmpAround'`, etc.
• Applicative and Additive instances for Point. Is there a reason not to have these?
• A random generator for ConvexPolygon in O(n log n).

[lemmih]

Possible QC properties:

• All randomly generated ConvexPolygons should be convex.
• extremes should give similar results to extremesLinear.
• The minkowshiSum of two ConvexPolygons is itself convex.
• What more can be tested?

[noinia]

This PR includes:

* Point orientation functions that operate without Data.Ext. Style matches `ccw/ccw'`: `sortAround/sortAround'`, 'ccwCmpAround/ccwCmpAround'`, etc.

In terms of the SoS work I was actually wondering whether I should remove the pure 'ccw without Ext' versions. In most cases I where I used ccw I had some extra data lying around anyway, and I ended up using the ccw' version. It is kind of silly if that ends up being the more used version than the "pure" one.

* `Applicative` and `Additive` instances for `Point`. Is there a reason not to have these?

An Applicative instance seems fine. I don't want to have an Additive instance for points though: I don't think it makes sense to think about "adding points"; that is a nonsensical operation. What one can do is add vectors! I.e. this is one of the main reasons for having Point and Vector be distinct types.

* A random generator for ConvexPolygon in `O(n log n)`.

Cool! I'll have a more detailed look at how you are doing that, sicnce that seems interesting :).