rectangle-segment intersection method uses 1 segment intersection instead of 4
point inside nonconvex polygon algo
add tests point inside nonconvex contour
use CG_COLLINEAR & CG_LEFT instead of ints
use orientation_t type instead of int
added quick hull algorithm
added tests for quick_hull algorithm
added quick_hull in visualization
now some parameters are passed by reference, not by value
Added naive implementation of dynamic convex hull with viz and tests
fixed bug in quick hull
added test for quick hull algorithm
changed std::iterator_traits<RanIter>::value_type to point_2 - our algorithm works with this type(Graham and Andrew work only with point_2 too). Some other small changes
Segment intersection bug fix
More tests
Contour contains point visualization
Removed unnecessary comparation
Merge pull request #18 from BorisMinaev/rectangle-segment-intersect-update

rectangle-segment intersection method uses 1 segment intersection instead of 4
Merge pull request #19 from BorisMinaev/point-inside-polygon

Point inside nonconvex contour algorithm and tests
Merge pull request #23 from BlackHawk74/segment_intersection_fix

Segment intersection fix