Competitive programming related stuffs (Olympiads, Codeforces, USACO)
-
Updated
Jun 4, 2024 - Modula-3
Competitive programming related stuffs (Olympiads, Codeforces, USACO)
Identify commercial centers using Points of Interest (POI) data by clustering these points into commercial centers/markets
Scalable symbolic-numeric set computations in Julia
All of my projects. Excuse the dodgy commits; I often work on numerous projects at the same time, meaning when I commit changes, they all get bundled together.
This is a short astro-physical program showing how to compute the adhesion model, describing the large-scale structure of the Universe, using regular triangulations in CGAL (www.cgal.org), as well as using the Convex Hull algorithm present in Python's Scipy.
An evaluation framework for machine learning models simulating high-throughput materials discovery.
Polyhedral Computation Interface
A set of Computational Geometry algorithms in Lua
Voronoi / Delaunay tessellations on the sphere
Surtr is a project that simulates dynamic object fracturing in real time with volumetric convex decomposition. Rendered with DX12.
Implementation of computational geometry algorithms for use in R
Processing Geometry Suite
Visualization for algorithms to find a convex hull
Halfspace Intersection - Calculate and draw convex polytopes from half-space equations
Geospatial primitives and algorithms for Crystal
Algorithms and Data Structures
2D computational geometry
Fast C++ multi-threaded algorithm for computing convex hulls
Add a description, image, and links to the convex-hull topic page so that developers can more easily learn about it.
To associate your repository with the convex-hull topic, visit your repo's landing page and select "manage topics."