Skip to content
#

gift-wrapping-algorithm

Star

Here are 5 public repositories matching this topic...

Language: All
Filter by language
All 5 Python 2 Jupyter Notebook 1 Rust 1 ShaderLab 1

alexvek96 / convex_hull_algorithms

Star 1

1st/2 Assignment of the "Computational Geometry" course (Spring Semester 2023 - NKUA). Python implementations of the following algorithms to compute the convex hull of N-points: Incremental (Graham's Scan) (2D and 3D), Quickhull (2D and 3D), Divide and Conquer (2D), Gift Wrapping (2D)

python quickhull computational-geometry convex-hull divide-and-conquer graham-scan-algorithm incremental-algorithm gift-wrapping-algorithm
  • Updated Jul 24, 2023
  • Python

Nikos25K / Computational-Geometry

Star 0

📐 This project implements various computational geometry algorithms, focusing on convex hulls, linear programming, Delaunay triangulation, and geometric search. The code is organized into multiple modules, each solving specific geometry-related problems and demonstrating core computational methods.

kd-tree linear-programming quickhull computational-geometry scipy convex-hull matplotlib voronoi-diagram delaunay-triangulation range-search divide-and-conquer graham-scan gift-wrapping-algorithm
  • Updated Nov 10, 2024
  • Python

Improve this page

Add a description, image, and links to the gift-wrapping-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the gift-wrapping-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more