G# is perfectly suitable for Digital Terrain Modelling (DTM):

its fast O(n·log(n)) randomized incremental algorithm enables the extremely fast triangulation of very large point sets. At the same time, G# is very robust due to the implementation of exact arithmetic. Click here to see an example.

G# can also triangulate edge constraints (breaklines), holes, islands and arbitrary shaped bounds by both inserting ("conforming Delaunay") and not inserting ("constraint Delaunay") additional triangulation points. Click here to see an example.

Digital Terrain Modelling requires editing triangulated surfaces: G# provides methods to compute contour and profile lines, to project points and lines onto and to to slice such surfaces, to import and export them and lots of other DTM features.

Click here for more details on the implemented triangulation algorithm, valid input data and restrictions.