Scribd Logo
Carica

Benvenuto in Scribd!

  • TIN & Surface Interpolation

    Caricato da

    Helmi Mukti Wijaya
    24 visualizzazioni10 pagine
    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.

    Descrizione originale:

    fotogrametri digital

    Titolo originale

    Week06

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Formati disponibili

    PDF, TXT o leggi online da Scribd

    Hai trovato utile questo documento?

    Questo contenuto è inappropriato?

    Segnala questo documento
    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.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Scarica in formato PDF, TXT o leggi online su Scribd
    Segnala contenuti inappropriati
    24 visualizzazioni10 pagine

    TIN & Surface Interpolation

    Caricato da

    Helmi Mukti Wijaya
    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.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Scarica in formato PDF, TXT o leggi online su Scribd
    Segnala contenuti inappropriati
    di 10

    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

    Staticvs.DynamicTriangulation
    Static:alldataareusedinasingle passprocess Dynamic:dataareusedinamultiple passprocess(i.e.,subsequentediting ofaTIN)

    WaysofFormingTriangles

    Basicrequirements: 1.Uniqueformation 2.Equilateraltriangles 3.Minimaledgelength

    TINFormation
    Delaunaycriterion(emptycircumcircle principle):thecircumscribingcircleof anytrianglecontainsnootherpointsof dataexceptthethreedefiningit. Localequiangularity(maxminangle principle):minimizingtherangeof interioranglesinthetwotrianglesthat formaconvexquadrilateral(through LawsonsLocalOpt.Procedure). 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 Globalvs.local Exactvs.bestfit 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

    Potrebbero piacerti anche