Optimization Course Project
-
Updated
Jan 27, 2016 - JavaScript
Optimization Course Project
Interactive notes for Computational Geometry: Algorithms and Applications
Processing neuron reconstructions using webGL, gpgpu, and node
Self-Organizing maps layout
Implementation of Timothy Chan's convex hull algorithm, in JS.
Decomposing polygonal regions into convex quadrilaterals!
Fast geometry simplification using the Visvalingam effective triangle area method.
A visualization of the Mergesort algorithm for computing convex hulls.
Determine if a point is inside of an ellipse
An algorithm to check if a point is inside a polygon using areas
Solutions for Computational Geometry problems
Program that for given set of points in the plane and a number R, computes where a disc with radius R should be placed in order to maximize the number of input points covered by the disc.
A basic triangulation implementation based on work by Wijeweera & Kodituwakku
A small module to generate a point in a polygon in O(n) time.
An implementation for the Shortest Path Among Obstacles for a point robot problem, using the Visibility Graph.
computes the convex Hull of n Points in O(n log(n))
Visibility polygon generator for Computational Geometry course
Project for the 2013 Computational Geometry course at the ULB
A small library for linear algebra oprations.
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."