This repository contains my own computational geometry Python package: geometric
. It covers
fundamental
algorithms and data structures, with a focus on practical applications. Topics covered include:
- 2D and 3D Points
- Convex Hull
- Line Segment Intersection
- Polygon Intersection
The matplotlib package is used to easily see the outputs of the different geometries.
- Python 3.10
- pip (package installer for Python)
-
Clone the repository:
git clone https://github.com/angelmtzr/computational-geometry.git
-
Install the required packages:
pip install -r requirements.txt
The geometric
package contains several subpackages and modules, including:
convex
: contains modules with different algorithms for computing the convex hull of a set of points, as well as a class that facilitates handling and displaying the convex hull.
To use any of these modules, simply import them in your Python code:
from geometric import Point2D
from geometric import ConvexHull
Contributions are welcome! If you find any bugs or want to suggest new features, please open an issue or submit a pull request.