Skip to content

lukatavcer/delaunay-triangulation

Repository files navigation

Delaunay triangulation (using incremental algorithm)

NRG - Homework 1

Python 3.6

This implementation is based on Delaunay Triangulation Algorithm and Application to Terrain Generation

It takes approximately 30 seconds to process 100.000 points on Intel Core i7-4710HQ CPU @ 2.50GHz & 16GB RAM.

Triangulation process

Step by step triangulation on test.txt data.

Useful resources

TODO

  • check for overflows & exceptions
  • check colinear points
  • improve data structure

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages