Thursday, February 25, 2010

Delaunay's TIN - Triangulated Irregular Network

I'm running into some problems with the mapping visualization software. I think we need to use a TIN algorithm. This page looks to be useful.


EDIT: The algorithm used on this page is O(N*N) and thus, for any reasonable amount of points (I'm trying to get 400 to work right now) the program takes a large amount of time to run.

UPDATE: I was generating my test data set with Z values randomly generated between 0-2^64 which is why it took so long. I reduced the Z range from 0-50 and the program generated a 3-D map of 400 points in under 5 seconds.



The code that I used.

No comments:

Post a Comment