Skip to content

Visually modelling an algorithm to create triangles for Thiessen polygons

Notifications You must be signed in to change notification settings

martin-martin/estimating_triangles

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

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

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages