addinnabilal/convex-hull

Convex Hull Algorithm

Tugas Kecil 2 Strategi Algoritma 2021/2022

Table of Contents

• General Info
• Screenshots
• Requirements
• Usage
• Project Status
• Contact

General Information

Convex Hull Using Divide and Conquer Algorithm

A convex hull is a polygon composed of a subset of points such that for any two points on the plane (eg p and q), all line segments ending in p and q are in that set. The convex hull problem is a computational geometry problem and can be developed for computer animation, optimization, and statistics problems. To solve convex hull problem, this program use divide and conquer algorithm and recursion. This program is a python library that will return the convex hull of each label in the form of a list of data/points forming convex hull, then display it with a different color.

Screenshots

Requirements

Python library:

• numpy
• pandas
• matplotlip.pyplot
• math
• sklearn (to load datasets)

Usage

(LOCAL)

1. Install the required python libraries in your python environment (you can youse conda)
2. (First use only): Clone this repository
3. To run the library, open the "main.ipynb" file in src folder
4. Activate the environment that has the required python libraries
5. Run the first cell to import all of the required library
6. Load dataset and create dataframe by running the first cell of each dataset
7. Run other cells to visualize the convex hull

Project Status

Project is: complete .

Contact

Created by Addin Nabilal Huda (13520045) Linkedin - feel free to contact me!