[Haskell-beginners] For most geometric algorithms (e.g. Graham Scan) sorting the points & not using trig functions is usually better.

KC kc1956 at gmail.com
Mon Jan 9 22:28:58 CET 2012

Often you sort the points to find a boundary point (extremal point).

Using trig functions burns a lot of CPU cycles so if one can use the
inner product, etc. so much the better.


More information about the Beginners mailing list