neetaaeapen Goto Github PK

codekata

computational_geometry

A Python project to visualize some fundamental graphs from computational geometry, such as polygon triangulations, convex hulls, etc.

convex-polygon

delaunay

Delaunay triangulation for convex polygon

geo

Computational geometry algorithms for polygons. Repairing self-intersecting polygons using constrained triangulation, computing convex hull(regular and minimal/maximum rectilinear), etc.

geospatial-operations-using-apache-spark

The project implements geospatial operations using Apache Spark. The operations include polygon union,convex hull,farthest and closest pair of points, spatial range and join queries

jgrapht

Master repository for the JGraphT project

k-shortest-paths-java-version

An implementation of the k shortest paths algorithm in Java

kubernetes

Container Cluster Manager from Google

poly-decomp.js

Decompose 2D polygons into convex pieces.

polygons

This project calculates the shortest path through a maze of convex polygons.

ride-sharing-algorithm

ridesharing

ridesharing_java

Ridesharing_Java

split-polygon

Splits a convex polygon by a plane

triangulate

Comparison of algorithmic methods (backtrack, dynamic, greedy) for triangulation of convex polygons

tsharesim