Implementation of voronoi diagram with incremental algorithm
-
Updated
Jun 10, 2020 - Jupyter Notebook
Implementation of voronoi diagram with incremental algorithm
Hammerslide is an algorithm for sliding window aggregation that uses SIMD instructions.
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)
Standard form discrete PID controller implementation using the incremental (velocity) algorithm for embedded systems in C
A) Convex Hull 2D-3D Algorithms B) KD-Trees, Orthogonal Search, Voronoi Diagrams, Delaunay Triangulation
📐Implementation of various convex hull algorithms as well as Voronoi diagrams, Delaunay triangulation and geometric search.
🧩 Presentation on Incremental DFS Algorithms
An incremental residue‑class algorithm for generating prime numbers in C++. Provides a minimal‑state prime generator based on a novel residue‑class method operating without division, multiplication, or explicit modulo computations. Suitable for number‑theory applications, embedded environments, and streaming scenarios.
Add a description, image, and links to the incremental-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the incremental-algorithm topic, visit your repo's landing page and select "manage topics."