Scribd
Upload
13 views10 pages

TIN and Surface Interpolation Techniques

1. A Triangulated Irregular Network (TIN) is a data structure used in GIS applications to model terrain or surfaces. It consists of nodes, edges, and triangles where the nodes define the x, y, z coordinates of the surface. 2. There are different methods for converting between surface models like point, triangle, and grid data structures. Spatial interpolation techniques can be used to generate a TIN from point data or extract point data from existing surface models. 3. When forming triangles in a TIN, common criteria include ensuring unique formation, equilateral triangles, and minimal edge lengths. The Delaunay triangulation method forms triangles according to the empty circumcircle principle.

Uploaded by

Helmi Mukti Wijaya
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views10 pages

TIN and Surface Interpolation Techniques

1. A Triangulated Irregular Network (TIN) is a data structure used in GIS applications to model terrain or surfaces. It consists of nodes, edges, and triangles where the nodes define the x, y, z coordinates of the surface. 2. There are different methods for converting between surface models like point, triangle, and grid data structures. Spatial interpolation techniques can be used to generate a TIN from point data or extract point data from existing surface models. 3. When forming triangles in a TIN, common criteria include ensuring unique formation, equilateral triangles, and minimal edge lengths. The Delaunay triangulation method forms triangles according to the empty circumcircle principle.

Uploaded by

Helmi Mukti Wijaya
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

TIN&SurfaceInterpolation

TRN

TriangulatedIrregularNetwork(TIN)
Node(x,y,z) Edge Triangles Topology
Thetrianglenumber Thenumbersofeachadjacent triangle Thethreenodesdefiningthe triangle Thex,ycoordinatesofeachnode Thesurfacezvalueofeachnode Theedgetypeofeachtriangle edge(hardorsoft)

ConversionsbetweenSurfaceModels
To From Point Triangle Grid
Spatial interpolation Edgepoints TINgeneration Spatialinterpolation, indirectinterpolation EditTIN Linear/curved surfaceinterpolation

Point

Triangle

Grid

Nearestneighbor, linear/cubic interpolation

TINgeneration Nearestneighbor, linear/cubic interpolation

[Link]
Static:alldataareusedinasingle passprocess Dynamic:dataareusedinamultiple passprocess(i.e.,subsequentediting ofaTIN)

WaysofFormingTriangles

Basicrequirements: [Link] [Link] [Link]

TINFormation
Delaunaycriterion(emptycircumcircle principle):thecircumscribingcircleof anytrianglecontainsnootherpointsof dataexceptthethreedefiningit. Localequiangularity(maxminangle principle):minimizingtherangeof interioranglesinthetwotrianglesthat formaconvexquadrilateral(through [Link]). Minimumsumdistanceprinciple: Minimumcircumscribingcircleradius:

StaticTriangulationofPoints
Algorithm: 1. Selectaninitialpoint 2. Searchforthefirstedge 3. Formthefirsttriangle(nearest pointtotheedge) 4. Searchforasubsequentedge 5. Formasubsequenttriangle 6. Repeat4,5untilallpointsbecome nodesoftriangles

SearchingforaNodePoint

SearchingforaSubsequentEdge

Convexhullalgorithm

Imaginarybndalgorithm

DynamicTriangulationofPoints
BowyerWatsonalgorithm

ConstrainedTriangulation
Randompointsandfeature specificpointsofaDTM Approaches: Pointdensificationof features ConstrainedDelaunay Triangulation

TriangulationfromContours
Pointdensificationofcontours Contoursassoftbreaklines

TriangulationfromDEM
SelectionofsignificantpointsfromDEM VeryImportantPoints(VIP) Maximumztolerance(d) TriangulationfromVIP
s P h d P e

SpatialInterpolation
Methodstoconstructthesurface model [Link] [Link] Informationlostatthesamplingstage canneverbereconstructed(?)

LocalMethod
Neighbors Distributionofcontrolpoints Extentofspatialautocorrelation

(a)

(b)

(c)

(a)findtheclosestpointstothepointtobeestimated,(b)find pointswithinaradius,and(c)findpointswithineachofthefour quadrants.

DistanceWeightedInterpolation
Neighborpointswithobservations Weightingfunctions

1 k d 1 i z= s 1 k 1 d i

zi

TypesofLocalSpatialInterpolation

Kriging

Semivariance

Sill

EmpiricalSemivariance ModeledSemivariance Nugget Distance Range

DEM Resampling
Downscale(Finetocoarse) Treatoutputgridaspolygons Dataaggregation Upscale(Coarsetofine) TreatDEMaspointdata Interpolation

10

You might also like