An application for visualizing the working of two convex hull algorithms - Jarvis March and Kirkpatrick-Seidel in two dimensions.
This project aims to visually demonstrate the workings of two convex hull algorithms: Jarvis March and Kirkpatrick-Seidel, originally as a part of Assignment-I for CS F364: Design and Analysis of Algorithms.
Convex hull algorithms are used to find the convex hull of a set of points, which is the smallest convex set that encloses all the points and forms a convex polygon.
To set up the project locally, follow the instructions below.
Before running the project, ensure you have the following installed:
- Unity Hub
- Unity Editor preferably v2022.3 or above with build support for platform(s) of your choice
- Clone the repository:
git clone https://github.com/soppydart/Convex-Hull-Algorithms.git
- Launch Unity Hub.
- Go to Projects > Add, locate the cloned directory using the file explorer and click on Open.
- Follow these steps to build the application for your preferred platform.
- Click on the 2D plane to manually plot points.
- Click on Start to begin. You must have at least 2 points to start.
- Click on Next to proceed to the next step.
- Click on Skip to skip the remaining steps and directly show the convex hull.
The following screenshots were taken from here.
Contributions to enhance the project are welcome! If you'd like to contribute, please follow these steps:
- Fork the project.
- Create your feature branch.
git checkout -b feature/AmazingFeature - Commit your changes.
git commit -m 'Add some AmazingFeature' - Push to the branch.
git push origin feature/AmazingFeature - Open a pull request.
This project is licensed under the GNU General Public License v3.0. You can find the full text of the license in the LICENSE file.
- Hand Cursor icon for button hover.
- Fira Code font for text.