2D convex hull algorithm with C++ and Qt

The project is about Implementing the 2D convex hull of a set of points. The algorithm must be implemented in C++. We give a Base Project in which you can find some basic features that are useful to successfully develop your project. 1. BASE PROJECT The Base Project is composed by some files (in the main folder) and some modules of the cg3lib: the “core module” and the “viewer module”. The first module contains basic data structures and utilities that are useful for our purposes and the latter contains utilities for building the user interface and draw geometric primitives. Each module is organized with a .pri file which is included by the main .pro file of the project. You must not modify the folders or the files in the folders that are associated to the cg3lib library. All your files and folders must be organized in the main folder of the project. 2. S PECIFICATIONS The project consists in implementing the 2D convex hull algorithm to be applied to a given set of points. It is also asked to draw the given input points and the convex hull (points and edges of the polygon) in the canvas. To finish the prject you need to implement on your own: • the algorithm itself. • the polygon data structure (we remind that the convex hull is itself a polygon). • the binary search tree data structure (better if it is auto-balancing). Note that you can NOT use std::set for this purpose. You should avoid using an external library or tool for these data structures. You can obviously use all the data structures/algorithms in the standard library (but not use the std::set as the binary search tree of the algorithm). Keep in mind that these data structures and algorithms should be independent from each other (make them as general as possible). In the ConvexHullManager, you have some (already implemented) slot member functions associated with buttons. They call some methods that you have to fill with your code: • computeConvexHull: here you have to execute your algorithm for the input vector of points (argument “inputPoints”). • clearConvexHull: here you have to clear your current convex hull data structure. • drawConvexHull: the goal of this method is to draw/show the drawable object in the canvas. • hideConvexHull: the goal of this method is to erase/hide the drawable object from the canvas. Data structures and algorithms can be used by the manager, but they must be implemented outside of it and organized in proper folders. Use the Object Oriented Paradigm and try to keep data structures and algorithms as general as possible. The library is given to draw the convex hull. The reward is 40$ (50 if the project is finished quickly).