Currently consists of algorithms implemented in python, will begin to see socket programming and networking added soon

Solutions for Computational Geometry problems

mirror for dr-plan-solver

Python Infrastructures mainly for Image Processing, Computer Vision and Graphics

Creating a program that calculates the Delaunay triangulation of a given set of points

Visualization of MST and convex hull

Closest pair problem adalah masalah dalam geometri komputasi yang mencari pasangan titik terdekat dari sekumpulan titik di suatu ruang. Ada beberapa algoritma yang dikembangkan untuk menyelesaikan masalah ini dengan lebih efisien, seperti algoritma divide-and-conquer.

Simple horizon calculation from elevation data

Delaunay tessellation in arbitrary dimension.

A NaiveCGL binding for Naivis.

Computational geometry course homework at SPbAU 7th term

Computational Geometry Library built as a part of the corresponding course

Monotone Polygon and Vertex Guard Approximation Generator

Learning about boost::geometry, CGAL, and other computational geometry libraries & frameworks

A small library for linear algebra oprations.

Diploma Thesis on Graph Drawing Algorithms with Python

Embrulho de presente e algoritmo de Graham

monotone polygon triangulation - online interactive demo