Locally Sensitive Data Mule Scheduling Problem (W.I.P.)
-
Updated
Oct 27, 2019 - C++
Locally Sensitive Data Mule Scheduling Problem (W.I.P.)
Projeto e implementação de uma classe e funções para resolução de problemas clássicos de geometria computacional. Trabalho realizado no 6º período de Ciência da Computação do Instituto Federal de Minas Gerais(IFMG) - Campus Formiga para a Disciplina Projeto e Análise de Algoritmos
Assist dentist in efficient work based on AI.
A Rust 2D computational geometry library
Computational Design Workflows inside Rhinoceros3D-Grasshopper3D using C#,.Net,RhinoCommonAPI and .Net Dependencies
Geometry algorithms implementations in Python
Crazy project for drawing figures in console
GAS project: C++ trapezoidal map implementation
Convex hull algorithms study
form factor integral between two general polygons
Linear Transformation Simulation on 2D and 3D plane using python OpenGL
A JAVA/Processing sketch that implements a geometric solution to the generation of optimum Mitchell trusses. Structural design and optimization of frames (trusses). Massachusetts Institute of Technology (MIT). 2015/2017.
Simple Features iOS Library
Signed Distance Function (SDF) based Python package for procedural construction of geometry.
C++ Coordinate Distance Modeling
Most of the problems I solved and algorithms I grinded while prepairing for the Russian Olympiad in Informatics.
A Small 3D Geometry Library
Javascript library for build 3D map with three.js
Implements the Balaban algorithm for finding intersecting segment pairs from a set of line segments.
📐 Computational geometry labs
Add a description, image, and links to the geometry-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the geometry-algorithms topic, visit your repo's landing page and select "manage topics."