| skjolber/3d-bin-container-packing |
369 |
|
0 |
1 |
about 2 years ago |
37 |
September 09, 2023 |
34 |
apache-2.0 |
Java |
| A variant of the Largest Area Fit First (LAFF) algorithm + brute force algorithm |
| anvaka/isect |
261 |
|
0 |
0 |
over 2 years ago |
0 |
|
8 |
mit |
JavaScript |
| Segments intersection detection library |
| SunnieShine/Sudoku |
89 |
|
0 |
0 |
about 2 years ago |
0 |
|
1 |
mit |
C# |
| A sudoku solver using brute forces and logical techniques. |
| thecodingwizard/competitive-programming |
64 |
|
0 |
0 |
almost 4 years ago |
0 |
|
0 |
|
C++ |
| Solutions to various competitive programming problems I've solved. Check out the USACO Guide to improve at competitive programming! |
| mikolalysenko/box-intersect-benchmark |
63 |
|
0 |
0 |
about 11 years ago |
0 |
|
1 |
mit |
JavaScript |
| Box intersection benchmark |
| ilyakava/sumproduct |
54 |
|
0 |
0 |
almost 8 years ago |
7 |
July 17, 2017 |
0 |
mit |
Python |
| Sum product algorithm - Belief propagation (message passing) for factor graphs |
| volfegan/GeometricAlgorithms |
47 |
|
0 |
0 |
almost 4 years ago |
0 |
|
0 |
mit |
Processing |
| Geometric Algorithms implemented for Java Processing v3 |
| tdebatty/java-graphs |
33 |
|
4 |
3 |
about 7 years ago |
39 |
November 23, 2017 |
2 |
other |
Java |
| Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,... |
| YuriSpiridonov/LeetCode |
24 |
|
0 |
0 |
almost 5 years ago |
0 |
|
1 |
mit |
Python |
| Python Solutions of LeetCode Problems. Daily Update. If you like this, please leave me a star. ★ :octocat: |
| Hritish42/TSHA |
10 |
|
0 |
0 |
over 5 years ago |
0 |
|
0 |
|
Python |
| I've Proposed a method to verify fake documents using cryptography techniques, designed and modified original SHA-1 algorithm to make it collision free and harder to Brute Force.🐍 |
