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

Trabalhos de Computação Gráfica - OpenGL

Track the upcoming gift wrappings on the Epic Games store (EGS).

Calculate the amount of paper you need to wrap your gifts

Various mathematics / physics / computer science related topics in more intuitive and fun way.

A Java fast convex hull library for 2 and 3 dimensions

Gift Wrap and Incremental Algorithm for the calculation of convex hull. Also, algorithm that finds the lattice points of a circle.

The Gift Wrapping Algorithm, Also Known as Jarvis March, is a Classic Algorithm in Computational Geometry used to Compute the Convex Hull of a Finite Set of Points in a Two-Dimensional Plane

Convex Hull Algorithms for COMP0005 (UCL 1st Year Course)

Implementing Gift wrapping algorithm in 3D space, Project of Computational Geometry course

Computational Geometry

A project for the Introduction to Computational Geometry course at the Faculty of Science, University of Sarajevo.

Per-item gift wrapping for Shopify — Theme App Extension that auto-syncs wrap colours from your product variants, removes orphaned wraps on cart changes, and supports personalised gift messages. Works on all plans.

Introduction to Computational Geometry, Faculty of Science, University of Sarajevo

Comparison of three different python convex hull algorithms