# TIN with breaklines

## TIN

Triangular irregular networks (TIN) are widely spread in GIS community (in ESRI software, other commercial GIS and CAD) to represent surface morphology. They have traditionally not been present in GRASS due to GRASS's strong raster support and more advanced interpolation techniques.

See the TIN and Contour lines to DEM wiki pages for further discussion.

The most common way of TIN construction is Delaunay triangulation. GRASS has the v.delaunay module to do this task, but it doesn't work with "breaklines", i.e. with constrained Delaunay triangulation.

## <v.triangle> module

Add-on module v.triangle was written as attempt to close this gap. It's simply a "front-end" to the famous utility Triangle of J.R. Shewchuk, which makes exact Delaunay triangulations, constrained Delaunay triangulations, conforming Delaunay triangulations and high-quality triangular meshes. On GIS terminology, it produces 2D TIN, optionally with "breaklines".

*Legal Note:***Triangle**is not free for commercial use and therefore must not be distributed with GRASS.

The module is a shell script that implements the main <Triangle> options and use it as "filter" to produce 2D TIN from the vector points/lines data. To use script you must to compile <Triangle> first and add it to system $PATH.

**Usage:**

**v.triangle** [-cdqalysif] *points*=name [*lines*=name] *tin*=name

[*max_area*=name] [*min_angle*=name] [*steiner_points*=name] [*save*=name]

**Flags:**

**-c** Conforming constrained Delaunay triangulation without angle or area constraints

**-d** Conforming Delaunay triangulation

**-q** Quality mesh generation (all angles are between 20 and 140 degrees)

**-a** Imposes a maximum triangle area constraint

**-l** Uses only vertical cuts in the divide-and-conquer algorithm

**-y** Prohibits the insertion of Steiner points on the mesh boundary

**-s ** Specifies the maximum number of added Steiner points

**-i ** Uses the incremental algorithm for Delaunay triangulation, rather than the divide-and-conquer algorithm

**-f** Uses Steven Fortune's sweepline algorithm for Delaunay triangulation, rather than the divide-and-conquer algorithm

**--o** Allow output files to overwrite existing files

**--v** Verbose module output

**--q ** Quiet module output

**Parameters:**

* points* Input vector map containing points

*Input vector map containing breaklines*

**lines***Name of output vector map (TIN)*

**tin***Maximum triangle area (use with "-a" flag)*

**max_area***Minimum mesh angle (use with "-q" flag)*

**min_angle***Specifies the maximum number of Steiner points that may be inserted into the mesh (use with "-s" flag)*

**steiner_points***Path to save <Triangle> working files (*.node,*.poly,*.edge,*.ele,*.off). By default uses current location directory*

**save**## Example

The following example was produced using ESRI sample data (masspoints and breaklines) to compare TIN's made in using ArcView 3D Analyst and Triangle.

The command used:

v.triangle -c points=pts lines=lines tin=tin