khuyentran1401/Voronoi-diagram

Implementation of voronoi diagram with incremental algorithm

Language: Jupyter Notebook - Size: 5.71 MB - Last synced at: about 1 month ago - Pushed at: almost 5 years ago - Stars: 13 - Forks: 0

grtheod/Hammerslide

Hammerslide is an algorithm for sliding window aggregation that uses SIMD instructions.

Language: C++ - Size: 136 KB - Last synced at: almost 2 years ago - Pushed at: about 3 years ago - Stars: 7 - Forks: 1

tuzijun111/Schema-Matching

Language: Java - Size: 13.7 KB - Last synced at: about 2 years ago - Pushed at: over 5 years ago - Stars: 1 - Forks: 0

JennyKozi/Computational_Geometry

A) Convex Hull 2D-3D Algorithms B) KD-Trees, Orthogonal Search, Voronoi Diagrams, Delaunay Triangulation

Language: Jupyter Notebook - Size: 897 KB - Last synced at: 11 months ago - Pushed at: 11 months ago - Stars: 0 - Forks: 0

Irrelev4nt13/Computational-Geometry

📐Implementation of various convex hull algorithms as well as Voronoi diagrams, Delaunay triangulation and geometric search.

Language: Jupyter Notebook - Size: 1.34 MB - Last synced at: about 1 year ago - Pushed at: about 1 year ago - Stars: 0 - Forks: 0

mehanix/Incremental-DFS-Algorithms

🧩 Presentation on Incremental DFS Algorithms

Size: 692 KB - Last synced at: 2 months ago - Pushed at: over 1 year ago - Stars: 0 - Forks: 0

alexvek96/convex_hull_algorithms

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)

Language: Python - Size: 509 KB - Last synced at: almost 2 years ago - Pushed at: almost 2 years ago - Stars: 0 - Forks: 0