Skip to content
#

quickhull

Here are 22 public repositories matching this topic...

Computational-geometry

Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh simplification, etc

  • Updated Jun 18, 2024
  • C#

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)

  • Updated Jul 24, 2023
  • Python

Improve this page

Add a description, image, and links to the quickhull 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 quickhull topic, visit your repo's landing page and select "manage topics."

Learn more