Ovidiu Parvu 4fce8e6b0e Changed the semantics of the minEnclosingTriangle function such that:
1. The function receives a set of points as input instead of a convex polygon with more than three vertices
2. The convex hull P is computed inside the function
3.1. If the number of vertices of P is greater than three then the algorithm which was implemented before executes
3.2. Otherwise the vertices of the triangle are picked from the vertices of the given polygon and the area computed
2013-09-12 13:29:10 +01:00
..
2013-09-05 18:26:44 +04:00
2013-09-05 19:02:58 +04:00
2013-09-05 19:02:58 +04:00
2013-09-05 19:02:58 +04:00
2013-09-05 19:02:58 +04:00
2013-09-05 19:02:58 +04:00
2013-09-05 19:02:59 +04:00
2013-09-05 19:02:59 +04:00
2013-09-05 19:02:59 +04:00
2013-09-05 18:26:43 +04:00
2013-09-05 19:02:59 +04:00
2013-09-05 19:02:58 +04:00
2013-09-05 19:02:58 +04:00
2013-09-05 19:02:58 +04:00
2013-08-27 13:26:44 +04:00
2013-09-05 19:02:58 +04:00
2013-09-05 19:02:58 +04:00
2013-08-21 18:59:24 +04:00