Gift Wrap and Incremental Algorithm for the calculation of convex hull. Also, algorithm that finds the lattice points of a circle.
-
Updated
Mar 30, 2020 - Python
Gift Wrap and Incremental Algorithm for the calculation of convex hull. Also, algorithm that finds the lattice points of a circle.
A web-based animation tool to visualize different Convexe Hull Algorithms.
Convex Hull Algorithms for COMP0005 (UCL 1st Year Course)
A Java fast convex hull library for 2 and 3 dimensions
Trabalhos de Computação Gráfica - OpenGL
Computational Geometry
Implementing Gift wrapping algorithm in 3D space, Project of Computational Geometry course
Track the upcoming gift wrappings on the Epic Games store (EGS).
Calculate the amount of paper you need to wrap your gifts
Comparison of three different python convex hull algorithms
Various mathematics / physics / computer science related topics in more intuitive and fun way.
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
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
Add a description, image, and links to the gift-wrapping topic page so that developers can more easily learn about it.
To associate your repository with the gift-wrapping topic, visit your repo's landing page and select "manage topics."