Skip to content
master
Switch branches/tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
 
 

estimating_triangles

Visually modelling an algorithm to create triangles for Thiessen polygons

This is how a Thiessen Polygon Network looks like:

thiessen polygon network

Here is the task that this program is aimed to solve:

Imagine that you have a number of points (e.g. explaining elevation) distributed in a regular pattern (like centre points in an ordinary raster, see below). How would you divide them into triangles in order to create a “triangular regular network”?

+ + + + +
+ + + + +
+ + + + +

My idea is to have the algorithm figure out how many smallest triangles can fit depending on the width and height, and from there fill the surface with the smallest possible triangles.

filled with triangles

About

Visually modelling an algorithm to create triangles for Thiessen polygons

Resources

Releases

No releases published

Packages

No packages published

Languages