A set of algorithms developed for the Computational Geometry course at PUC. Includes triangulation, convex hull and point location. Refactoring may be necessary.
-
Updated
Nov 29, 2013 - Java
A set of algorithms developed for the Computational Geometry course at PUC. Includes triangulation, convex hull and point location. Refactoring may be necessary.
3D zero-gravity pool using Java3D.
A 2D k-dimensional tree implementation with Java
This is a repository for my computational geometry project involving sketching convex hull and triangulating it
Monotone Polygon and Vertex Guard Approximation Generator
🎨Coding Project 2 for Computational Geometry Course (CSN-523)
TDA starting from Summer 2018
Lab at the Computation Geometry Group in summer term 2017 for University of Bonn
Java implementation of an approximate nearest-neighbor search via space-filling curves
A Java fast convex hull library for 2 and 3 dimensions
A JavaFX application to construct a simple polygon from a set of points
Sorbonne Université MU4IN500
CartAGen's core library as a standalone Maven project, available as an artifact via Jitpack.
☕ Java Algorithms Implementation
The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
Implementation or introduction of some computational geometry algorithms and graph algorithms
A software to turn crease patterns into instructions
Add a description, image, and links to the computational-geometry topic page so that developers can more easily learn about it.
To associate your repository with the computational-geometry topic, visit your repo's landing page and select "manage topics."