Drainage basin delineation from vector drainage networks
|
|
- Victoria Charles
- 6 years ago
- Views:
Transcription
1 ISPRS SIPT IGU UCI CIG ACSG Table of contents Table des matières Authors index Index des auteurs Search Recherches Exit Sortir Drainage basin delineation from vector drainage networks Craig Dillabaugh Canada Centre for Remote Sensing 588 Booth Street Ottawa, Ontario, Canada ABSTRACT An automated process for the delineation of drainage basins, using as input only the vector based drainage network, is described which provides an alternative to DEM based methods. The procedure involves an approximation of the line Voronoi diagram for the network using a constrained Delaunay triangulation of the network's Planar Straight Line Graph. The constrained triangulation, which includes all network channels as edges in its resulting triangles, is further sub-divided into a set of facets. A two-stage algorithm is then applied to these facets to assign each facet the identifier of a channel in the input network. The drainage area of each channel is delineated by merging all facets assigned to that channel to form a single polygon. The drainage basin for any point in the network can be determined by tracing the channels upstream from that point and merging the associated drainage polygons. Several examples of the procedure's application are provided on drainage networks of varying size and complexity. While the procedure cannot ultimately match the accuracy of a DEM based basin delineation, it can be used in cases where DEM data is either unavailable or of poor quality. Keywords: Delaunay triangulation, basin extraction, drainage basins 1. Introduction The extraction of drainage networks and their associated drainage basins (or catchment areas) is normally accomplished through the use of digital elevation models (DEMs). Whether the DEM is represented as a set of points in a Triangular Irregular Network (TIN), or as a raster surface, numerous techniques exist which allow the extraction of stream networks and their associated basins. Examples of such techniques can be found in Mower (1994) for raster data, and in Jones et al (1990), and Nelson et al (1994) for TIN based DEMs. However, if the vector representation of the stream network is available but the DEM is either unavailable or of inadequate quality then it may be desirable to estimate drainage basin boundaries based on the network vectors. Techniques for this procedure are not widely available. The purpose of this paper is to present a simple technique which allows drainage basin boundaries to be estimated from stream vectors. In the absence of a DEM or any specialized models which might estimate basin shape based on network configuration, the most logical way to delineate the basins would be to assign to each stream segment the area which is closer to that segment than to any other. In other words, the distance between a point within the basin of a stream segment and that stream segment should be shorter than the distance between the point and any other stream segment. The technique presented here uses a partitioned Triangular Irregular Network (TIN) model, created from the input drainage network vectors rather than DEM data, to produce a set of polygons representative of the drainage area attributable to each stream segment in the network. Conceptually it is similar to producing a line voronoi of the stream network, though the actual polygons are not true line voronoi's but rather an approximation. A discussion of the production of true line voronoi diagrams can be found in Held (2001). 2. Conceptual Framework 2.1 Network Topology The drainage network, which may include channels and lakes and perhaps islands (thought this was not tested) is initially stored in a representation which will be referred to here as an arc-node network. A small portion of such a network is shown in figure 1, along with its tabular representation. The individual stream channels (or lake shorelines) are represented as arcs (labelled A, B, C...) which themselves are represented by a listing of vertices which mark the end points of a series of straight line segments which compose the arc. The vertices themselves are simply represented by their x and y coordinates. For the purposes of the discussion here, each vertex can also be considered to have a unique identifier Symposium on Geospatial Theory, Processing and Applications, Symposium sur la théorie, les traitements et les applications des données Géospatiales, Ottawa 2002
2 (labelled 0 through 13 in figure 1). The start and end vertices of any arc are referred to as nodes and may be shared among multiple arcs (i.e. vertex 3 in figure 1). Figure 1: Arc-node representation of network channels. Note that the network extends beyond the extent shown here, and individual arc segments extending beyond the display extent are indicated as dashed lines. The procedure outlined here provides a means of drainage basin delineation by assigning drainage areas to each arc in the input arc-node network. The drainage area is a polygon which will represents the extent of the area in the physical landscape which drains to its associated channel. Actual drainage basins can be determined for the nodes in the network by searching up stream from that point to identify all channels that drain to it. The combined drainage areas for all those channels comprise the drainage basin for the selected point. The procedure of determining the drainage areas for individual channels is implemented by applying a constrained Delaunay triangulation to the input drainage network. This triangulation results in a set of triangles which are further subdivided into six facets. The drainage area for the channels was determined by assigning each facet to a channel, and then merging all facets given the same channel assignment into a single polygon. A Delaunay triangulation is a triangulation whose vertices are the set of input points and where no input point falls into the interior circumcircle of any other triangle in the triangulation. A constrained Delaunay triangulation is similar, but with the requirement that each segment in the input Planar Straight Line Graph (PSLG) serves as an edge in the triangulation. As such, a constrained triangulation is not a true Delaunay triangulation as the circumcircle requirement cannot be enforced (Shewchuk, 1996). Each arc in the arc-node network can be broken down into a set of arc 'segments' which are straight lines connecting each adjacent pair of vertices in the arc. This collection of segments forms the PSLG for the arc-node network and serves as input to the triangulation procedure. The PSLG is represented by two lists, the first of these being a listing of all vertices in the network which consists of a unique vertex identifier and the x and y coordinates of each vertex. The second list forming the PSLG is a list of segments, where each segment is represented by the identifiers of two vertices that define its endpoints. Applying a constrained Delaunay triangulation to the PSLG creates a third list, which for each triangle simply records the identifiers of the three vertices of which it is composed. The vertex list for the input PSLG and the resulting triangulation are identical. This property of the constrained Delaunay triangulation, along with a second property, that being that each input segment in the PSLG forms an edge in the resulting triangulation, are essential for the proper functioning of the facet assignment procedure described below. In terms of the original arc-node network, these properties of the constrained Delaunay triangulation mean that each segment in the original arc network forms the edge of one or two triangles and that no triangle edges intersect any network arc. The constrained Delaunay triangulation of the network from figure 1, along with a partial listing of vertex identifiers for the triangles is shown in figure 2.
3 Figure 2: Constrained Delaunay triangulation for channel network along with its tabular representation. Segments from the original network are heavy lines, while the segments generated as part of the triangulation are light. Vertex identifiers correspond to those in figure 1. One other feature of the triangulation is that it includes no information regarding the positioning of the vertices from within the original stream network. The PSLG records only the vertex positions and which vertices are paired to form line segments. The triangulation in turn only records which vertices compose each triangle. In order to enable the facet assignment procedure it is essential that information be recorded regarding the position of the network vertices in the original arc-node network. This information can be obtained at the time the PSLG is generated and is stored in what will be referred to as the incident arc list. The incident arc list records for each vertex in the vertex lists which arcs in the arc-node network that vertex belonged to. The incident arc list for the network in figures 1 and 2 is provided in table 1. The procedure for generating the incident arc works as follows; as each vertex is output the arc to which it belongs is recorded in the incident arc list for that vertex. A special node table is kept which records those vertices that are also nodes. When a node vertex is to be output, this table is checked to determine if that node has already been written to the vertex list (as the node of another arc). If the nodes has already been written then the current arc's identifier is added to that vertex's set of incident arcs without reinserting the vertex. VERTEX INCIDENT ARCS 0 A 1 A 2 A 3 A,B,C 4 B 5 B 6 B 7 C 8 C, G, F 9 G Table 1: Incident Arc List for Network shown in figures 1 and Basin Extraction Procedure Following the triangulation step basin extraction was performed by further sub-dividing each triangle into six facets and assigning the individual facets to the arcs representing the stream segments or lake shorelines. The required inputs at this stage include the listing of vertex positions, the triangle file indicating the three vertices belonging to each triangle, and finally the listing of incident arcs. The facets are formed by simply identifying the triangle centre and dividing the triangle into six sub-triangles (or facets) by connecting lines from this centre point to the three vertices and between the mid-points on the three triangle edges as shown in figure 3a. The method of determining the centre point of the triangle is described hereafter.
4 In order to simply the description of facet assignment it is helpful to define a number of terms with respect to facets and their associations with each other. In figure 3a. facets a and f are considered to be 'adjacent' to the vertex v0, while b and c are adjacent to v1, and d and e are adjacent to v2. Furthermore facet a and b are considered to be adjacent to the line segment L v0,v1 while c and d are adjacent to L v1,v2 and e and f are adjacent to L v2,v0. Within the triangle each facet has two neighbouring facets, its adjacent neighbour being the facet adjacent to the same vertex, and its opposite neighbour being the facet adjacent to the same line. Thus in Figure 3a facet b is the opposite neighbour of facet a while facet f is facet a's adjacent neighbour. Finally the triangle produced during the triangulation within which a facet occurs is referred to as that facet's parent triangle. The edges of each parent triangle can be shared with other parent triangles, in which case the two facets sharing both the edge and a vertex are termed exterior neighbours. This is demonstrated in Figure 3b where the two facets marked by the * are exterior neighbours. (a) Single triangle with facet labels. Figure 3: Facet labelling. (b) Triangulation sub-divided into facets the stars indicate exterior neighbour facets. Facet assignment is a two-stage procedure, with an initial assignment stage which is followed by a clean-up stage which iteratively assigns the remaining facets until all have been assigned. The value assigned to each facet is the identifier of an arc in the original arc-node network. Often features will occur in a network to which drainage should not be assigned, for example a coverage neatline, or small islands within a lake or river. Such features should be identified prior to processing and marked as invalid for assignment. 3.1 First Stage Each facet is considered in turn, and is assigned to a particular arc (stream segment) according the following rules: a. If the vertex adjacent to the facet has only a single incident arc (which is not invalid for assignment), then the facet is assigned to that arc. b. If the vertex adjacent to the facet is incident only to a invalid arc then the facet assignment is set to 'reserved'. c. If the adjacent vertex has multiple incident arcs then look at the line segment to which the facet is adjacent and; i. If that line segment is an arc in stream network then assign the facet to that arc number. ii. If the line is not part of the stream network, then the facet assignment is set to reserved. Whether (a) or (b) applies can be easily determined from the incident arc list of the triangle vertices. For (a) there will be only a single valid incident arc number, and for (b) there will be no valid incident arcs. For (c) determining whether to apply (i) or (ii) requires the determination of which triangle edges (lines) belong to a particular arc in the stream network. Fortunately this information can be obtained from the incident arc list as a triangle edge represents part of the stream network when both vertices contain the same incident arc within their incident arcs list. Assuming clean topology of the original arc-node network no two vertices will ever share more than one common incident arc.
5 3.2 Second Stage To complete the basin delineation all of the facets marked as reserved in the previous stage must still be assigned. The assignment of these facets is achieved by applying the following set of rules: a. If no facets at all have been assigned in the current parent triangle then examine each facet's exterior neighbour in the adjacent parent triangles to determine if they have been assigned. If so give the current facet its exterior neighbour's assignment. b. If there are assigned facets in the parent triangle then; i. If the current facet is adjacent to a vertex with no valid values in its incident arc list then examine first the adjacent neighbour and then the opposite neighbour and when one of those neighbouring facets is found to have an assigned value, assign that to the current facet. ii. If the current facet is adjacent to a vertex with valid incident arcs, then examine first the adjacent neighbour and then the exterior neighbour and if one of these is found to have an assigned value, assign that to the current facet. Stage 2 is repeated until all facets have been assigned an arc number. While the logic behind most of the rules outlined in stage one and two are straightforward some of the rules in particular stage 1 c.ii and stage 2 b.i and b.ii. can benefit by some further explanation. Figure 4 below is provided to demonstrate instances where these rules would be applied. In this diagram the facets labelled 1 through 4 are all adjacent to the vertex with an incident arc list which includes arcs A, B, and C. During stage one facets 1 and 4 are assigned to channels B and C respectively according to rule c.i, however, facets 2 and 3 cannot be assigned since the triangle edge they border on is part of the triangulation but not part of the network. Facets 2 and 3 are assigned during stage 2 according to rule b.ii. Facets 5 and 6 are adjacent to the junction of arcs A, B, and C, and will be assigned to arcs B and A respectively on the second iteration of stage 2, once again in accordance with rule b.ii. However, unlike facets 2 and 3 these facets will be assigned based on their exterior neighbours because the triangle to which they belong does not border on either of the arcs directly. Figure 4: Solid lines represent original stream network, dashed lines represent triangle edges, and dotted lines represent facet edges. Channel (Arc) ID's are signified by uppercase letters while numbers identify the facets.
6 3.3 Determining the Triangle Centre-Point Division of the parent triangle into facets involves creating six line segments linking the parent triangle's centre point to its three corner vertices and the midpoints of the its edges. The first method for determining the triangle centre, which will be called the centroid method, is calculated by taking the arithmetic mean of the x and y coordinates of the three triangle vertices. A second technique for determining the triangle centre called the bisection method was also employed. The bisection method works by selecting two of the three triangle sides and making the triangle centre the midpoint of a line connecting the midpoints of these two sides. In general the method will work by simply selecting the two longest sides, however it is possible to use any two sides to determine a centre. (a) Centroid method for triangle centre determination. (b) Bisection method for triangle centre determination. Figure 5: Centroid and Bisection methods of determining triangle centres for facet generation. For the most part the bisection method produces superior results, particularly in cases where stream segments run nearly parallel to each other. The reason for this is that when segments run parallel the triangulation produces numerous long thin triangles that alternate between having one and then two vertices on either of the stream segments. Because the centroid method takes the arithmetic mean of the vertices the centre is placed closer to the stream segment having two of the current triangle's vertices. Following facet assignment this produces the jagged division of triangles shown in figure 6a. Using the bisection method however produces a much smoother line (see figure 6b.). (a) Centroid Method (b) Bisection Method Figure 6: Division of facets between two stream segments using the centroid and bisection method. Solid black lines represent the original streams, grey lines represent triangle and facet boundaries, while the dashed black line represents the division between facets assigned to the lower and upper stream segments. One area in which the centroid method tends to produce a better result is at stream junctions. This can be seen in Figure 6 where the centroid method actually produces a better division for the triangle occurring in the junction, while bisection does a better job for the remaining triangles. Thus rather than just selecting one method and using it on all triangles it is better to choose the centre selection method dynamically depending on the current triangles positioning relative to the stream network. The rules for determining which technique to used can be summarized as follows:
7 If the triangle has two vertices on one stream segment and the third on another (as with the long narrow triangles in Figure 6), then bisection should be employed using the two lines originating from the lone vertex on the second stream segment. If all facets are the same then they will eventually be merged into a single drainage area so centre selection is irrelevant, however, the centroid computation is slightly simpler so use it. If the triangle has one vertex on one stream segment, one of the other, and the third vertex is shared, then this is a junction vertex so use the centroid technique. 3.4 Drainage Area Delineation Once the facet assignment is complete then basin's are delineated by merging all facets given the same assignment into a single polygon. This merging can be accomplished using a vector based geographical information system. However, in order to speed the process of merging polygons, rather than output every single facet as a polygon, only the facet segments (edges) which were shared between facets having differing assignments were output. It is then left to the GIS to build polygon topology from the output facet segments. This technique further requires that for each possible assignment value a single label point be output which records the assignment value. A major assumption being made here is that ALL of the facets assigned to any one arc are contiguous, this of course will be the case so long as the drainage network is properly constructed such that no two different arcs have the same identifier. 4. Results and Discussion For testing purposes five network coverages were selected ranging in both scale and database size. The smallest coverage in terms of area and size (number of arc segments) was the MACKENZIE coverage, which covered a small area along the Mackenzie Mountains which form the drainage divided between the Yukon and Mackenzie rivers. This network includes areas in both the Yukon Territory and the Northwest Territories in northern Canada. The next largest coverage was the BANKS coverage, which included the whole of Banks Island in the Northwest Territories. The largest coverage in terms of aerial extent was the North American drainage network NORTH_AM, which provided a small scale generalized drainage network for the entire continent. The final two coverages, and the largest in terms of database size, were the ALBANY and NELSON coverages, which included the drainage basins for the rivers emptying into Hudson Bay, Canada. Each coverage is named after its major river, but both include a number of small rivers which also drain into Hudson Bay. Figure 7 below shows two of these networks BANKS and NELSON. (a) BANKS drainage network. (b) NELSON drainage network. Figure 7: Drainage networks for BANKS and NELSON coverages. The drainage network and the resulting basin polygon coverages we handled using the Arc/Info GIS. Arc/Info was used to ensure the quality of the input networks and to handle the polygon creation from the output facet boundaries and labels. Arc/Info also supports performing constrained Delaunay triangulation, however, the program TRIANGLE (Shewchuk, 1996) was used instead. The main advantage of TRIANGLE, which is freely available over the world wide web, is that the storage formats for its inputs and outputs are open and clearly documented and thus could be relatively easily integrated into the basin extraction procedure. TRIANGLE requires as inputs a simple PSLG and outputs a listing of triangle vertices. The facet assignment procedure was implemented in an external program written in the C++ programming language. All analysis was performed on a Sun Ultra 10 workstation, running the Solaris OS.
8 The processing involved first ensuring correct network topology for the drainage network and proper directionality of arc (stream) segments. Where proper directionality exists in the network it is possible to extract the complete drainage basin for any point in the network using the basin extraction procedure outlined hear. Following this stage the network was exported from Arc/Info and processed to generate the listing of incident arcs (stream segments) along with the PSLG for input into TRIANGLE. A small external, program, called ARCTRI, was written to achieve this. TRIANGLE was then run on the PSLG to generate a the constrained Delaunay triangulation, which along with the incident arcs file served as input to the facet assignment program. Results from the facet assignment were then imported to Arc/Info where polygon topology was constructed from facet outputs. The resulting polygons represented the drainage areas for each stream segment in the initial network coverage. The drainage basin for any point in the network could then be determined simply by tracing back through all arcs upstream of that point and selecting the associated drainage areas for the selected arcs. The processing times for triangulation and facet generation/assignment are shown for the five coverages in Table 2. Network Size (# Stream/Arc Approximate Running Times Segments) Triangulation Facet Generation/Assignment MACKENZIE second less than 1 second BANKS 1,978 1 second less than 1 second NORTH_AM 6,426 9 seconds 3 seconds ALBANY 45, seconds 3 seconds NELSON 76, seconds 9 seconds Table 2: Network Coverage Processing Times Figures 8 thru 10 present the results of the extraction procedure for sub-basins in three of the network coverages. Figure 8 presents results for a delineated drainage basin from the ALBANY network. Just to the north (above) of this highlighted area the Attawapiskat River can be seen. One feature of interest in this case is the small area draining to a lake in the southwest end of the basin that is not marked as part of the basin. Since the lake is not connected directly to the drainage network its associated basin is not assigned to the basin as it likely should be in this case. A reasonable solution to this problem would that any when a drainage basin is delineated any drainage area polygons that are completely enclosed should automatically be assigned to that basin, however, this was not implemented here. Figure 8: ALBANY network extracted drainage basin. The highlighted area flows to towards Hudson Bay to the east (right) side of the scene. In Figure 9a a basin extracted from the MACKENZIE network is shown along with one of its sub-basins. For any basin it is possible to extract sub-basins down to the level of the drainage areas for individual arc segments (shown in Figure 9b). The western edge of this basin forms part of the drainage divided between the larger Mackenzie (to east) and Yukon (to west) river basins. In this scene along the northern edge of the basin a few artefacts of the triangulation and facet
9 generation can be seen as small divots along the basin boundary. Generally, when the network is dense such artefacts are less prominent and a smoother basin boundary is obtained. (a) Drainage basin with sub-basin (b) Drainage areas assigned to individual stream segments. Figure 9: Basin from the Mackenzie network (a) shaded light grey, along with one of its sub-basins, shown in a slightly darker shaded of gray. Drainage areas for individual arcs or stream segments (b). Finally, Figure 10 shows the extracted coverage for the Mississippi River drainage basin from the NORTH_AM network for North America. Within this basin the drainage areas to individual stream (river) segments are outlined, while white lines represent the actual drainage network. Figure 10: NORTH_AM network, Mississippi River Basin.
10 5. Discussion and Conclusions The procedure presented here provides an effective means of drainage basin delineation where drainage network vectors are available and in the absence of an adequately precise DEM. Also for approximation purposes this technique can be favourably compared to DEM based techniques due to its lower computational requirements. Raster based DEMs will often require a significant amount of pre-processing in order to ensure removal of sinks that would interfere with basin delineation procedures. Comparatively editing a vector stream network to ensure proper directionality is quite straightforward and less time consuming. Finally, for large areas with dense drainage networks, which would require a fine spatial resolution, the size of the raster DEMs required to delineate drainage basins would be prohibitively large. The primary drawback of this technique is the somewhat rough basin boundaries produced when the individual polygons representing drainage to a single arc segment are viewed. However, as the degree of complexity (i.e. larger number of stream segments) and size of the network being extracted increases this becomes relatively insignificant. The technique can handle very large detailed drainage basins and produce drainage area polygons quickly. The facet generation and assignment algorithm is efficient, and relatively easy to implement. While no attempts were made to extend the technique developed in this study to other problem domains, the basin approximation could be easily used to calculate area drainage for any single arc segment in a drainage network, which could in turn be used to estimate of stream order. Further, the bisection method produces a visually appealing division between parallel and nearly parallel lines and might be used for problems like the generation of lake or double line river skeletons in map generalization. 6. Acknowledgements Thanks to Rupert Brooks, Rhian Evans, and Dianne Richardson for their assistance in this research. 7. References Held M (2001) VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments. Computational Geometry 18(2): Jones NL Wright SG and Maidment DR (1990) Watershed delineation with triangle-based terrain models. Journal of Hydraulic Engineering 116(3): Mower JE (1994) Data-parallel procedures for drainage basin analysis. Computers and Geosciences 20(9): Nelson EJ Jones NL and Miller AW (1994) Algorithm for precise drainage-basin delineation. Journal of Hydraulic Engineering 120(3): Shewchuk JR (1996) Triangle: A two-dimensional quality mesh generator and Delaunay triangulator, Version 1.3. Available from:
SEGMENTATION OF TIN-STRUCTURED SURFACE MODELS
ISPRS SIPT IGU UCI CIG ACSG Table of contents Table des matières Authors index Index des auteurs Search Recherches Exit Sortir SEGMENTATION OF TIN-STRUCTURED SURFACE MODELS Ben Gorte Technical University
More informationWMS 9.1 Tutorial Hydraulics and Floodplain Modeling Floodplain Delineation Learn how to us the WMS floodplain delineation tools
v. 9.1 WMS 9.1 Tutorial Hydraulics and Floodplain Modeling Floodplain Delineation Learn how to us the WMS floodplain delineation tools Objectives Experiment with the various floodplain delineation options
More informationUnderstanding Geospatial Data Models
Understanding Geospatial Data Models 1 A geospatial data model is a formal means of representing spatially referenced information. It is a simplified view of physical entities and a conceptualization of
More informationSchematic Networks: An Algorithm and its Implementation 1
ISPRS SIPT IGU UCI CIG ACSG Table of contents Table des matières Authors index Index des auteurs Search Recherches Exit Sortir Schematic Networks: An Algorithm and its Implementation 1 Sergio Cabello and
More informationImport, view, edit, convert, and digitize triangulated irregular networks
v. 10.1 WMS 10.1 Tutorial Import, view, edit, convert, and digitize triangulated irregular networks Objectives Import survey data in an XYZ format. Digitize elevation points using contour imagery. Edit
More informationImproved Applications with SAMB Derived 3 meter DTMs
Improved Applications with SAMB Derived 3 meter DTMs Evan J Fedorko West Virginia GIS Technical Center 20 April 2005 This report sums up the processes used to create several products from the Lorado 7
More informationStudy on Delaunay Triangulation with the Islets Constraints
Intelligent Information Management, 2010, 2, 375-379 doi:10.4236/iim.2010.26045 Published Online June 2010 (http://www.scirp.org/journal/iim) Study on Delaunay Triangulation with the Islets Constraints
More informationVector Data Analysis Working with Topographic Data. Vector data analysis working with topographic data.
Vector Data Analysis Working with Topographic Data Vector data analysis working with topographic data. 1 Triangulated Irregular Network Triangulated Irregular Network 2 Triangulated Irregular Networks
More informationSMS v D Summary Table. SRH-2D Tutorial. Prerequisites. Requirements. Time. Objectives
SMS v. 12.3 SRH-2D Tutorial Objectives Learn the process of making a summary table to compare the 2D hydraulic model results with 1D hydraulic model results. This tutorial introduces a method of presenting
More informationWMS 9.0 Tutorial Hydraulics and Floodplain Modeling HEC-RAS Analysis Learn how to setup a basic HEC-RAS analysis using WMS
v. 9.0 WMS 9.0 Tutorial Hydraulics and Floodplain Modeling HEC-RAS Analysis Learn how to setup a basic HEC-RAS analysis using WMS Objectives Learn how to build cross sections, stream centerlines, and bank
More informationWMS 10.1 Tutorial Hydraulics and Floodplain Modeling HEC-RAS Analysis Learn how to setup a basic HEC-RAS analysis using WMS
v. 10.1 WMS 10.1 Tutorial Hydraulics and Floodplain Modeling HEC-RAS Analysis Learn how to setup a basic HEC-RAS analysis using WMS Objectives Learn how to build cross sections, stream centerlines, and
More informationMaps as Numbers: Data Models
Maps as Numbers: Data Models vertices E Reality S E S arcs S E Conceptual Models nodes E Logical Models S Start node E End node S Physical Models 1 The Task An accurate, registered, digital map that can
More informationENCODING AND DECODING OF PLANAR MAPS THROUGH CONFORMING DELAUNAY TRIANGULATIONS
ENCODING AND DECODING OF PLANAR MAPS THROUGH CONFORMING DELAUNAY TRIANGULATIONS Edward Verbree Delft University of Technology, Research Institute OTB, Section GIS technology, Jaffalaan 9, 2628 BX, Delft,
More informationApplied Cartography and Introduction to GIS GEOG 2017 EL. Lecture-7 Chapters 13 and 14
Applied Cartography and Introduction to GIS GEOG 2017 EL Lecture-7 Chapters 13 and 14 Data for Terrain Mapping and Analysis DEM (digital elevation model) and TIN (triangulated irregular network) are two
More informationWMS 10.1 Tutorial Hydraulics and Floodplain Modeling Simplified Dam Break Learn how to run a dam break simulation and delineate its floodplain
v. 10.1 WMS 10.1 Tutorial Hydraulics and Floodplain Modeling Simplified Dam Break Learn how to run a dam break simulation and delineate its floodplain Objectives Setup a conceptual model of stream centerlines
More informationWMS 8.4 Tutorial Hydraulics and Floodplain Modeling Simplified Dam Break Learn how to run a dam break simulation and delineate its floodplain
v. 8.4 WMS 8.4 Tutorial Hydraulics and Floodplain Modeling Simplified Dam Break Learn how to run a dam break simulation and delineate its floodplain Objectives Setup a conceptual model of stream centerlines
More informationObjectives This tutorial will introduce how to prepare and run a basic ADH model using the SMS interface.
v. 12.1 SMS 12.1 Tutorial Objectives This tutorial will introduce how to prepare and run a basic ADH model using the SMS interface. Prerequisites Overview Tutorial Requirements ADH Mesh Module Scatter
More informationv Introduction to WMS WMS 11.0 Tutorial Become familiar with the WMS interface Prerequisite Tutorials None Required Components Data Map
s v. 11.0 WMS 11.0 Tutorial Become familiar with the WMS interface Objectives Import files into WMS and change modules and display options to become familiar with the WMS interface. Prerequisite Tutorials
More informationv Introduction to WMS Become familiar with the WMS interface WMS Tutorials Time minutes Prerequisite Tutorials None
s v. 10.0 WMS 10.0 Tutorial Become familiar with the WMS interface Objectives Read files into WMS and change modules and display options to become familiar with the WMS interface. Prerequisite Tutorials
More informationIntroduction to GIS 2011
Introduction to GIS 2011 Digital Elevation Models CREATING A TIN SURFACE FROM CONTOUR LINES 1. Start ArcCatalog from either Desktop or Start Menu. 2. In ArcCatalog, create a new folder dem under your c:\introgis_2011
More informationReport: Comparison of Methods to Produce Digital Terrain Models
Report: Comparison of Methods to Produce Digital Terrain Models Evan J Fedorko West Virginia GIS Technical Center 27 April 2005 Introduction This report compares Digital Terrain Models (DTM) created through
More informationRepresenting Geography
Data models and axioms Chapters 3 and 7 Representing Geography Road map Representing the real world Conceptual models: objects vs fields Implementation models: vector vs raster Vector topological model
More informationDATA MODELS IN GIS. Prachi Misra Sahoo I.A.S.R.I., New Delhi
DATA MODELS IN GIS Prachi Misra Sahoo I.A.S.R.I., New Delhi -110012 1. Introduction GIS depicts the real world through models involving geometry, attributes, relations, and data quality. Here the realization
More informationCOMPARISON OF TWO METHODS FOR DERIVING SKELETON LINES OF TERRAIN
COMPARISON OF TWO METHODS FOR DERIVING SKELETON LINES OF TERRAIN T. Gökgöz, F. Gülgen Yildiz Technical University, Dept. of Geodesy and Photogrammetry Engineering, 34349 Besiktas Istanbul, Turkey (gokgoz,
More informationGMS 8.2 Tutorial Stratigraphy Modeling TIN Surfaces Introduction to the TIN (triangulated irregular network) surface object
v. 8.2 GMS 8.2 Tutorial Introduction to the TIN (triangulated irregular network) surface object Objectives Learn to create, read, alter and manage TIN data from within GMS. Prerequisite Tutorials None
More informationTopic 5: Raster and Vector Data Models
Geography 38/42:286 GIS 1 Topic 5: Raster and Vector Data Models Chapters 3 & 4: Chang (Chapter 4: DeMers) 1 The Nature of Geographic Data Most features or phenomena occur as either: discrete entities
More informationAlgorithms for GIS. Spatial data: Models and representation (part I) Laura Toma. Bowdoin College
Algorithms for GIS Spatial data: Models and representation (part I) Laura Toma Bowdoin College Outline Spatial data in GIS applications Point data Networks Terrains Planar maps and meshes Data structures
More informationWatershed Modeling Advanced DEM Delineation
v. 10.1 WMS 10.1 Tutorial Watershed Modeling Advanced DEM Delineation Techniques Model manmade and natural drainage features Objectives Learn to manipulate the default watershed boundaries by assigning
More informationUse of open-source GIS for the preprocessing of distributed hydrological. models
Use of open-source GIS for the preprocessing of distributed hydrological models F. Branger, I. Braud, S. Debionne, J. Dehotin, S. Jankowfsky, O. Vannier, P. Viallet Who are we? Cemagref Hydrology-Hydraulics
More informationContents of Lecture. Surface (Terrain) Data Models. Terrain Surface Representation. Sampling in Surface Model DEM
Lecture 13: Advanced Data Models: Terrain mapping and Analysis Contents of Lecture Surface Data Models DEM GRID Model TIN Model Visibility Analysis Geography 373 Spring, 2006 Changjoo Kim 11/29/2006 1
More informationGMS 10.0 Tutorial Stratigraphy Modeling TIN Surfaces Introduction to the TIN (Triangulated Irregular Network) surface object
v. 10.0 GMS 10.0 Tutorial Stratigraphy Modeling TIN Surfaces Introduction to the TIN (Triangulated Irregular Network) surface object Objectives Learn to create, read, alter, and manage TIN data from within
More informationWatershed Modeling With DEMs: The Rest of the Story
Watershed Modeling With DEMs: The Rest of the Story Lesson 7 7-1 DEM Delineation: The Rest of the Story DEM Fill for some cases when merging DEMs Delineate Basins Wizard Smoothing boundaries Representing
More informationv Scatter Data TINs SMS 12.3 Tutorial Requirements Scatter Module Map Module Time minutes Prerequisites None Objectives
v. 12.3 SMS 12.3 Tutorial Objectives This tutorial covers the basics of working with TINs (triangulated irregular networks) using the scatter module of SMS, including: importing TIN data, editing and filtering
More informationM. Andrea Rodríguez-Tastets. I Semester 2008
M. -Tastets Universidad de Concepción,Chile andrea@udec.cl I Semester 2008 Outline refers to data with a location on the Earth s surface. Examples Census data Administrative boundaries of a country, state
More informationARC HYDRO TOOLS CONFIGURATION DOCUMENT #3 GLOBAL DELINEATION WITH EDNA DATA
ARC HYDRO TOOLS CONFIGURATION DOCUMENT #3 GLOBAL DELINEATION WITH EDNA DATA Environmental Systems Research Institute, Inc. (Esri) 380 New York Street Redlands, California 92373-8100 Phone: (909) 793-2853
More informationClass #2. Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures
Class #2 Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures Role of a Data Model Levels of Data Model Abstraction GIS as Digital
More informationSurface Analysis. Data for Surface Analysis. What are Surfaces 4/22/2010
Surface Analysis Cornell University Data for Surface Analysis Vector Triangulated Irregular Networks (TIN) a surface layer where space is partitioned into a set of non-overlapping triangles Attribute and
More information(Refer Slide Time: 00:02:00)
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 18 Polyfill - Scan Conversion of a Polygon Today we will discuss the concepts
More informationWMS 9.1 Tutorial Watershed Modeling DEM Delineation Learn how to delineate a watershed using the hydrologic modeling wizard
v. 9.1 WMS 9.1 Tutorial Learn how to delineate a watershed using the hydrologic modeling wizard Objectives Read a digital elevation model, compute flow directions, and delineate a watershed and sub-basins
More informationAspect-Ratio Voronoi Diagram with Applications
Aspect-Ratio Voronoi Diagram with Applications Tetsuo Asano School of Information Science, JAIST (Japan Advanced Institute of Science and Technology), Japan 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan
More informationGIS LAB 8. Raster Data Applications Watershed Delineation
GIS LAB 8 Raster Data Applications Watershed Delineation This lab will require you to further your familiarity with raster data structures and the Spatial Analyst. The data for this lab are drawn from
More informationThe Global River Width Algorithm
GRW algorithm ver1.5 3 April, 2014 1 The Global River Width Algorithm 2 3 4 Dai Yamazaki School of Geographical Sciences, University of Bristol Dai.Yamazaki@bristol.ac.uk 5 6 7 8 9 Note: This document
More informationTransactions on Information and Communications Technologies vol 18, 1998 WIT Press, ISSN
Environmental mapping made simple Christopher Gold Geomatics Research Centre, Laval University, Quebec City, Quebec, Canada G1K 7P4. Christopher. Gold@scg. ulaval.ca Abstract In environmental applications
More informationv TUFLOW-2D Hydrodynamics SMS Tutorials Time minutes Prerequisites Overview Tutorial
v. 12.2 SMS 12.2 Tutorial TUFLOW-2D Hydrodynamics Objectives This tutorial describes the generation of a TUFLOW project using the SMS interface. This project utilizes only the two dimensional flow calculation
More informationv SMS 11.1 Tutorial Scatter Data - TINs Requirements Scatter Module Map Module Time minutes Prerequisites None Objectives
v. 11.1 SMS 11.1 Tutorial Scatter Data - TINs Objectives This workshop covers the basics of working with TINs (triangulated irregular networks) using the scatter module of SMS. We will cover importing
More informationTerrain Modeling with ArcView GIS from ArcUser magazine
Lesson 6: DEM-Based Terrain Modeling Lesson Goal: Lean how to output a grid theme that can be used to generate a thematic two-dimensional map, compute an attractive hillshaded map, and create a contour
More informationConvex Hulls in Three Dimensions. Polyhedra
Convex Hulls in Three Dimensions Polyhedra Polyhedron 1.A polyhedron is the generalization of a 2- D polygon to 3-D A finite number of flat polygonal faces The boundary or surface of a polyhedron - Zero-dimensional
More informationA CONSISTENCY MAINTENANCE OF SHARED BOUNDARY AFTER POLYGON GENERALIZATION
CO-182 A CONSISTENCY MAINTENANCE OF SHARED BOUNDARY AFTER POLYGON GENERALIZATION AI T.(1), ZHANG W.(2) (1) Wuhan University, WUHAN CITY, CHINA ; (2) Zhongnan University of Economics and Law, WUHAN CITY,
More informationMSc Geomatics thesis presentation. Validation and automatic repair of planar partitions using a constrained triangulation.
MSc Geomatics thesis presentation Validation and automatic repair of planar partitions using a constrained triangulation Ken Arroyo Ohori Friday, 27 August 2010 at 10:00 Grote Vergaderzaal OTB Research
More informationSurface Modeling With TINs
GMS TUTORIALS The TIN module in GMS is used for general-purpose surface modeling. TIN is an acronym for Triangulated Irregular Network. TINs are formed by connecting a set of xyz points with edges to form
More informationLearn how to delineate a watershed using the hydrologic modeling wizard
v. 10.1 WMS 10.1 Tutorial Learn how to delineate a watershed using the hydrologic modeling wizard Objectives Import a digital elevation model, compute flow directions, and delineate a watershed and sub-basins
More informationChapter 1. Introduction
Introduction 1 Chapter 1. Introduction We live in a three-dimensional world. Inevitably, any application that analyzes or visualizes this world relies on three-dimensional data. Inherent characteristics
More informationVoronoi Diagrams. A Voronoi diagram records everything one would ever want to know about proximity to a set of points
Voronoi Diagrams Voronoi Diagrams A Voronoi diagram records everything one would ever want to know about proximity to a set of points Who is closest to whom? Who is furthest? We will start with a series
More informationStatistical surfaces and interpolation. This is lecture ten
Statistical surfaces and interpolation This is lecture ten Data models for representation of surfaces So far have considered field and object data models (represented by raster and vector data structures).
More information13.472J/1.128J/2.158J/16.940J COMPUTATIONAL GEOMETRY
13.472J/1.128J/2.158J/16.940J COMPUTATIONAL GEOMETRY Lecture 23 Dr. W. Cho Prof. N. M. Patrikalakis Copyright c 2003 Massachusetts Institute of Technology Contents 23 F.E. and B.E. Meshing Algorithms 2
More informationA Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud
International Journal of Computer Systems (ISSN: 2394-1065), Volume 03 Issue 02, February, 2016 Available at http://www.ijcsonline.com/ A Constrained Delaunay Triangle Mesh Method for Three-Dimensional
More informationTUFLOW 1D/2D SURFACE WATER MODELING SYSTEM. 1 Introduction. 2 Background Data
SURFACE WATER MODELING SYSTEM TUFLOW 1D/2D 1 Introduction This tutorial describes the generation of a 1D TUFLOW project using the SMS interface. It is recommended that the TUFLOW 2D tutorial be done before
More informationAutoCAD 2009 Tutorial
AutoCAD 2009 Tutorial Second Level: 3D Modeling Randy H. Shih Oregon Institute of Technology SDC PUBLICATIONS Schroff Development Corporation www.schroff.com Better Textbooks. Lower Prices. AutoCAD 2009
More informationIntroduction :- Storage of GIS Database :- What is tiling?
Introduction :- GIS storage and editing subsystems provides a variety of tools for storing and maintaining the digital representation of a study area. It also provide tools for examining each theme for
More informationMinimising Positional Errors in Line Simplification Using Adaptive Tolerance Values
ISPRS SIPT IGU UCI CIG ACSG Table of contents Table des matières Authors index Index des auteurs Search Recherches Exit Sortir Minimising Positional Errors in Line Simplification Using Adaptive Tolerance
More informationlayers in a raster model
layers in a raster model Layer 1 Layer 2 layers in an vector-based model (1) Layer 2 Layer 1 layers in an vector-based model (2) raster versus vector data model Raster model Vector model Simple data structure
More informationConstrained Delaunay Triangulations (CDT)
Constrained Delaunay Triangulations (CDT) Recall: Definition 1 (Constrained triangulation). A triangulation with prespecified edges or breaklines between nodes. Motivation: Geological faults in oil recovery
More informationWatershed Modeling With Feature Objects
Watershed Modeling With Feature Objects Lesson 4 4-1 Objectives Apply the rules of feature object topology to create a drainage coverage 4-2 Work Flow This lesson covers the use of feature objects for
More informationGeographic Surfaces. David Tenenbaum EEOS 383 UMass Boston
Geographic Surfaces Up to this point, we have talked about spatial data models that operate in two dimensions How about the rd dimension? Surface the continuous variation in space of a third dimension
More informationDYNAMIC CARTOGRAPHY USING VORONOI/DELAUNAY METHODS
DYNAMIC CARTOGRAPHY USING VORONOI/DELAUNAY METHODS Chris Gold, Maciej Dakowicz Department of Computing and Mathematics, University of Glamorgan, Pontypridd, Wales, CF37 1DL, UK cmgold@glam.ac.uk; mdakowic@glam.ac.uk
More informationConvex Polygon Generation
Convex Polygon Generation critterai.org /projects/nmgen_study/polygen.html This page describes the forth stage in building a navigation mesh, the generation of convex polygons from the simple polygons
More informationDeveloping an Interactive GIS Tool for Stream Classification in Northeast Puerto Rico
Developing an Interactive GIS Tool for Stream Classification in Northeast Puerto Rico Lauren Stachowiak Advanced Topics in GIS Spring 2012 1 Table of Contents: Project Introduction-------------------------------------
More informationWMS 8.4 Tutorial Watershed Modeling MODRAT Interface (GISbased) Delineate a watershed and build a MODRAT model
v. 8.4 WMS 8.4 Tutorial Watershed Modeling MODRAT Interface (GISbased) Delineate a watershed and build a MODRAT model Objectives Delineate a watershed from a DEM and derive many of the MODRAT input parameters
More informationSubdivision Of Triangular Terrain Mesh Breckon, Chenney, Hobbs, Hoppe, Watts
Subdivision Of Triangular Terrain Mesh Breckon, Chenney, Hobbs, Hoppe, Watts MSc Computer Games and Entertainment Maths & Graphics II 2013 Lecturer(s): FFL (with Gareth Edwards) Fractal Terrain Based on
More informationCreating raster DEMs and DSMs from large lidar point collections. Summary. Coming up with a plan. Using the Point To Raster geoprocessing tool
Page 1 of 5 Creating raster DEMs and DSMs from large lidar point collections ArcGIS 10 Summary Raster, or gridded, elevation models are one of the most common GIS data types. They can be used in many ways
More informationField-Scale Watershed Analysis
Conservation Applications of LiDAR Field-Scale Watershed Analysis A Supplemental Exercise for the Hydrologic Applications Module Andy Jenks, University of Minnesota Department of Forest Resources 2013
More informationSurface Creation & Analysis with 3D Analyst
Esri International User Conference July 23 27 San Diego Convention Center Surface Creation & Analysis with 3D Analyst Khalid Duri Surface Basics Defining the surface Representation of any continuous measurement
More informationComputer Database Structure for Managing Data :-
The Map as an Abstraction of Space :- We begin the process of abstraction by conceptualizing what we encounter as a group of points, lines, areas and surfaces. We make decision about which object to take
More informationSpatial Analysis and Modeling (GIST 4302/5302) Representation of Spatial Data. Representation of Spatial Data Models 3/5/18
3/5/8 Spatial Analysis and Modeling (GIST 432/532) Representation of Spatial Data Guofeng Cao Department of Geosciences Texas Tech University Representation of Spatial Data Models Object-based model: treats
More informationSurface Analysis with 3D Analyst
2013 Esri International User Conference July 8 12, 2013 San Diego, California Technical Workshop Surface Analysis with 3D Analyst Khalid H. Duri Esri UC2013. Technical Workshop. Why use 3D GIS? Because
More informationv Editing Elevations DEM Basics Import, view, and edit digital elevation models WMS Tutorials Time minutes Prerequisite Tutorials None
v. 11.0 WMS 11.0 Tutorial Import, view, and edit digital elevation models Objectives Learn to import DEMs from an online database, set the display options for an imported DEM, and view and edit the DEM
More information3D Terrain Modelling of the Amyntaio Ptolemais Basin
2nd International Workshop in Geoenvironment and 1 3D Terrain Modelling of the Amyntaio Ptolemais Basin G. Argyris, I. Kapageridis and A. Triantafyllou Department of Geotechnology and Environmental Engineering,
More informationADVANCED TERRAIN PROCESSING: ANALYTICAL RESULTS OF FILLING VOIDS IN REMOTELY SENSED DATA TERRAIN INPAINTING
ADVANCED TERRAIN PROCESSING: ANALYTICAL RESULTS OF FILLING VOIDS IN REMOTELY SENSED DATA J. Harlan Yates Patrick Kelley Josef Allen Mark Rahmes Harris Corporation Government Communications Systems Division
More informationDocumentation for Velocity Method Segment Generator Glenn E. Moglen February 2005 (Revised March 2005)
Documentation for Velocity Method Segment Generator Glenn E. Moglen February 2005 (Revised March 2005) The purpose of this document is to provide guidance on the use of a new dialog box recently added
More information10.1 Overview. Section 10.1: Overview. Section 10.2: Procedure for Generating Prisms. Section 10.3: Prism Meshing Options
Chapter 10. Generating Prisms This chapter describes the automatic and manual procedure for creating prisms in TGrid. It also discusses the solution to some common problems that you may face while creating
More informationv TUFLOW 1D/2D SMS 11.2 Tutorial Time minutes Prerequisites TUFLOW 2D Tutorial
v. 11.2 SMS 11.2 Tutorial Objectives This tutorial describes the generation of a 1D TUFLOW project using the SMS interface. It is strongly recommended that the TUFLOW 2D tutorial be completed before doing
More informationA Modified Longest Side Bisection Triangulation
A Modified Longest Side Bisection Triangulation Christoph Stamm Stephan Eidenbenz Renato Pajarola Computer Science Department Institute of Theoretical Computer Science ETH Zurich, Switzerland E-mail: stamm@inf.ethz.ch
More informationDisplacement Methods based on Field Analysis
Displacement Methods based on Field Analysis Tinghua Ai Laboratory of Digital Mapping and Land Information Application Engineering Wuhan University, P. R. China aith@wuhan.cngb.com Peter van Oosterom Section
More informationLecture notes: Object modeling
Lecture notes: Object modeling One of the classic problems in computer vision is to construct a model of an object from an image of the object. An object model has the following general principles: Compact
More informationThe Crust and Skeleton Applications in GIS
The Crust and Skeleton Applications in GIS Christopher Gold and Maciek Dakowicz School of Computing, University of Glamorgan Pontypridd CF37 1DL Wales UK christophergold@voronoi.com Abstract This paper
More informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More informationBI-DIRECTIONAL AFFINE MOTION COMPENSATION USING A CONTENT-BASED, NON-CONNECTED, TRIANGULAR MESH
BI-DIRECTIONAL AFFINE MOTION COMPENSATION USING A CONTENT-BASED, NON-CONNECTED, TRIANGULAR MESH Marc Servais, Theo Vlachos and Thomas Davies University of Surrey, UK; and BBC Research and Development,
More informationSpatial Analysis and Modeling (GIST 4302/5302) Guofeng Cao Department of Geosciences Texas Tech University
Spatial Analysis and Modeling (GIST 4302/5302) Guofeng Cao Department of Geosciences Texas Tech University Representation of Spatial Data Representation of Spatial Data Models Object-based model: treats
More informationv SMS 11.1 Tutorial SRH-2D Prerequisites None Time minutes Requirements Map Module Mesh Module Scatter Module Generic Model SRH-2D
v. 11.1 SMS 11.1 Tutorial SRH-2D Objectives This lesson will teach you how to prepare an unstructured mesh, run the SRH-2D numerical engine and view the results all within SMS. You will start by reading
More informationLearn how to delineate a watershed using the hydrologic modeling wizard
v. 11.0 WMS 11.0 Tutorial Learn how to delineate a watershed using the hydrologic modeling wizard Objectives Import a digital elevation model, compute flow directions, and delineate a watershed and sub-basins
More informationEstimation of Design Flow in Ungauged Basins by Regionalization
Estimation of Design Flow in Ungauged Basins by Regionalization Yu, P.-S., H.-P. Tsai, S.-T. Chen and Y.-C. Wang Department of Hydraulic and Ocean Engineering, National Cheng Kung University, Taiwan E-mail:
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 17 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationPurpose: To explore the raster grid and vector map element concepts in GIS.
GIS INTRODUCTION TO RASTER GRIDS AND VECTOR MAP ELEMENTS c:wou:nssi:vecrasex.wpd Purpose: To explore the raster grid and vector map element concepts in GIS. PART A. RASTER GRID NETWORKS Task A- Examine
More informationGEOGRAPHIC INFORMATION SYSTEMS Lecture 25: 3D Analyst
GEOGRAPHIC INFORMATION SYSTEMS Lecture 25: 3D Analyst 3D Analyst - 3D Analyst is an ArcGIS extension designed to work with TIN data (triangulated irregular network) - many of the tools in 3D Analyst also
More informationAlgorithms for GIS csci3225
Algorithms for GIS csci3225 Laura Toma Bowdoin College Spatial data types and models Spatial data in GIS satellite imagery planar maps surfaces networks point cloud (LiDAR) Spatial data in GIS satellite
More informationSPATIAL DATA MODELS Introduction to GIS Winter 2015
SPATIAL DATA MODELS Introduction to GIS Winter 2015 GIS Data Organization The basics Data can be organized in a variety of ways Spatial location, content (attributes), frequency of use Come up with a system
More informationData Partitioning. Figure 1-31: Communication Topologies. Regular Partitions
Data In single-program multiple-data (SPMD) parallel programs, global data is partitioned, with a portion of the data assigned to each processing node. Issues relevant to choosing a partitioning strategy
More informationv Stratigraphy Modeling TIN Surfaces GMS 10.3 Tutorial Introduction to the TIN (Triangulated Irregular Network) surface object
v. 10.3 GMS 10.3 Tutorial Stratigraphy Modeling TIN Surfaces Introduction to the TIN (Triangulated Irregular Network) surface object Objectives Learn to create, read, alter, and manage TIN data from within
More informationKinetic Voronoi/Delaunay Drawing Tools
Kinetic Voronoi/Delaunay Drawing Tools Chris Gold and Maciej Dakowicz School of Computing University of Glamorgan Pontypridd, Wales, CF37 1DL, UK cmgold@glam.ac.uk; mdakowic@glam.ac.uk Abstract We describe
More informationPartition and Conquer: Improving WEA-Based Coastline Generalisation. Sheng Zhou
Partition and Conquer: Improving WEA-Based Coastline Generalisation Sheng Zhou Research, Ordnance Survey Great Britain Adanac Drive, Southampton, SO16 0AS, UK Telephone: (+44) 23 8005 5000 Fax: (+44) 23
More information