Small-Dimensional Quadratic Programming in Linear Time
-
Updated
Aug 4, 2022 - C++
Small-Dimensional Quadratic Programming in Linear Time
🔺 Fast polygon triangulation library based on Seidel's algorithm.
Introduction to Numerical methods
O(d!n) linear programming solver, based on Seidel (1991) algorithm
Implementação em C do método de Gauss-Seidel usando estutura de dados.
Algorithm to compare numerical methods (Gauss Jacobi and Gauss Seidel), using implementation sequential and parallel ( C++ and OpenMP ).
Numerical Methods to find out roots and other such variables from equations.
SIstema de Ecuaciones Lineales - Calculador de soluciones para ecuaciones lineales de cualquier grado
Implementation of the Jacobi and Gauss-Seidel iterative methods
This Python project implements an optimized polygon triangulation algorithm based on Seidel's trapezoidation method, capable of handling polygons with holes and complex configurations.
This application visualizes Seidel's polygon triangulation algorithm. It's a part of the final project for Bologna Process equivalency of my applied studies diploma.
Add a description, image, and links to the seidel topic page so that developers can more easily learn about it.
To associate your repository with the seidel topic, visit your repo's landing page and select "manage topics."