Geometric Analyzer provides implementations of four different algorithms for finding the convex hull of a set of points in a 2D plane. The convex hull is the smallest convex polygon that encloses all the given points. The implemented algorithms include Jarvis March, Graham Scan, Quick Hull, and Brute Force approach.
-
Jarvis March Algorithm: Finds the convex hull by iteratively selecting the point with the smallest polar angle relative to the current point.
-
Graham Scan Algorithm: Sorts the points by polar angle and then constructs the convex hull by considering points in order.
-
Quick Hull Algorithm: Divides the set of points into two subsets, constructs the convex hull for each subset, and then merges the results.
-
Brute Force Approach: Evaluates all possible combinations of points to find the convex hull.
-
User Interface with Streamlit: Utilizes Streamlit to create an interactive and user-friendly interface for inputting points and visualizing the convex hull.
-
Graphing Libraries for Visualization: Incorporates graphing libraries to provide clear visual representations of the input points and the convex hulls generated by each algorithm.
-
Clone the repository:
git clone https://github.com/yourusername/GeometricAnalyzer.git
-
Navigate to the project directory:
cd GeometricAnalyzer -
Install the required dependencies:
pip install -r requirements.txt
Run the Streamlit app:
streamlit run main.pyThis will open a new tab in your default web browser with the GeometricAnalyzer interface.
Follow the on-screen instructions to input points and choose an algorithm. The visual representation of the convex hull will be displayed dynamically.
- Python 3.x
- Streamlit
- Graphing libraries (e.g., Matplotlib, Plotly, etc.)
This project is licensed under the MIT License - see the LICENSE file for details.