Convex poly

[LdDl]

Start working on #16
Current PR targeted for convex polygon

[LdDl]

Inital job is done:

1. Constructor for polygon
2. Scaling function
3. Determine if point is inside of polygon of CONVEX type

Next:

• Choose best place in JSON configuration for user defined polygons
• Euclidean <-> WGS84 conversion (for speed estimation, but I'm not sure if we need it now)
• Determine if point has entered polygon
• Determine if point has left polygon
• Pick a way to store information about polygons and detected objects relations (which detected objects are inside of certain polygons)
• Time estimation

[LdDl]

20.08.2021 14:35:00+00:00 UTC
Done:

• Determine if point (detected object) has entered polygon
• Determine if point (detected object) has left polygon

Next:

• Choose best place in JSON configuration for user defined polygons
• Euclidean <-> WGS84 conversion (for speed estimation, but I'm not sure if we need it now)
• Pick a way to store information about polygons and detected objects relations (which detected objects are inside of certain polygons)
• Time estimation

[LdDl]

Added some test for convex polygons

[LdDl]

30.08.2021 17:32:00+00:00 UTC
Done:

• Choose best place in JSON configuration for user defined polygons
• Pick a way to store information about polygons and detected objects relations (which detected objects are inside of certain polygons)
• Drawing polygons (as connected polylines)

Next:

• Euclidean <-> WGS84 conversion (for speed estimation, but I'm not sure if we need it now)
• Time estimation
• Store information about visited polygons in detected object

[LdDl]

I think we will make below features not in this pull request but in future ones:

• Euclidean <-> WGS84 conversion (for speed estimation, but I'm not sure if we need it now)
• Time estimation
• Store information about visited polygons in detected object

Also we think it's time to go further and implement event system for both virutal line and virtual polygon.
On top of that it will be good to have Pub/Sub system also.