Next Article in Journal
Visualization of 3D Survey Data for Strata Titles
Previous Article in Journal
Multisensorial Close-Range Sensing Generates Benefits for Characterization of Managed Scots Pine (Pinus sylvestris L.) Stands
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Method for Generating the Centerline of an Elongated Polygon on the Example of a Watercourse

by
Elżbieta Lewandowicz
* and
Paweł Flisek
Department of Geoinformation and Cartography, Institute of Geodesy and Civil Engineering, Faculty of Geoengineering, University of Warmia and Mazury in Olsztyn, 10-719 Olsztyn, Poland
*
Author to whom correspondence should be addressed.
ISPRS Int. J. Geo-Inf. 2020, 9(5), 304; https://doi.org/10.3390/ijgi9050304
Submission received: 23 March 2020 / Revised: 21 April 2020 / Accepted: 4 May 2020 / Published: 7 May 2020

Abstract

:
The centerlines of polygons can be generated with the use of various methods. The aim of this study was to propose an algorithm for generating the centerline of an elongated polygon based on the transformation of vector data. The proposed method involves the determination of base points denoting the direction of river flow. These points were also used to map two polygon boundaries. A Triangulated Irregular Network (TIN) was created based on the polygon’s breakpoints. Edges that intersect the river channel in a direction perpendicular to river flow (across) were selected from a set of TIN edges. The polygon was partitioned into segments with the use of the selected TIN edges. The midpoints of selected TIN edges were used to generate the polygon’s centerline based on topological relations. The presented methodology was tested on a polygon representing a 15-km-long section of a river intersecting the city of Olsztyn (a university center). The analyzed river is a highly meandering watercourse, and its channel is narrowed down by hydraulic structures. The river features an island and distributary channels. The generated centerline effectively fits the polygon, and, unlike the solution modeled with the Medial Axis Transformation (MAT) algorithm, it does not feature branching streams.

1. Introduction

Inland bodies of water are represented by raster or vector data in Geographic Information System (GIS) applications. Raster data are acquired from satellite images. Datasets describing inland water bodies are generated by extracting (detecting, classifying) the information contained in images [1,2]. Vector data representing water bodies are obtained by converting classified images [3,4] or by manual vectorization of data.
Watercourses are modeled based on the data describing bodies of water. When raster data are used, the centerlines of watercourses are modeled with dedicated algorithms [5]. These tools are applied in Digital Terrain Models (DTMs), and they increase modeling accuracy by automatically generating maximum gradient lines [6]. Numerous algorithms for generating polygon centerlines based on raster data have been presented in the literature [7,8,9,10]. These solutions are based on the parallel thinning algorithm or its modified versions [11,12,13].

1.1. Generation of a Polygon Skeleton Based On Vector Data

In large-scale maps, data from classified images are converted to vector format. After data conversion, smaller rivers can be represented by lines, whereas larger rivers are represented by polygons. The resulting data are used to model watercourses. The centerlines of the modeled watercourses are extrapolated with manual, semi-automatic or automatic methods in GIS applications. The ESRI and GRASS applications [14] for generating polygon centerlines involved semi-automatic editing options with tools for mapping midpoints. River centerlines can be generated automatically in ESRI software [14] by the “Polygon to centerline” tool.
The solutions for generating the centerlines of watercourses have been described in the literature [2,9]. Four basic methods are used for this purpose: Voronoi diagrams (VDs), the Straight Skeleton algorithm, the Medial Axis Transformation (MAT) algorithm, and triangulation (Figure 1). These methods have been presented and compared in the literature [15,16].
In the first solution, a polygon is partitioned into segments [9,17] with the use of tools for generating Voronoi diagrams (VDs) (Figure 2).
This method is deployed by various tools in programming platforms such as ET SpatialTechniques [18], GRASS GIS [19] and FME [20], as well as in Python libraries [21]. In the resulting solutions, the generated centerline covers all side streams which need to be eliminated. The generated centerlines have to be smoothed and aligned with polygon boundaries.
Polygon centerlines can also be generated with the Straight Skeleton algorithm [15,22,23,24,25,26], which is based on buffer lines (Figure 3). Similarly to other solutions, the Straight Skeleton algorithm first generates a skeleton of a polygon, and the centerline is then extracted from the skeleton.
Other solutions are based on the MAT algorithm [27,28]. The centerline of a watercourse generated with the MAT algorithm features distributary channels (Figure 4) that have to be eliminated [29,30,31,32,33].
Delaunay triangulation has been used by many authors to generate polygon skeletons. The algorithms based on Delaunay triangulation rely on Triangulated Irregular Network (TIN) polygons, TIN edges and special locations. Three [36,37] (Figure 5(1)) or even four types of TIN polygons are identified: type 0, type 1, type 2 and type 3 [38] (Figure 5(2)), and Figure 6.
Polygon skeletons are generated based on topological relations. The relations between special points, including midpoints of TIN edges, midpoints of TIN polygons and TIN polygons, are taken into consideration [36,37]. The polygon axis is extracted based on the generated skeleton [39,40,41] and the relations between the areas adjacent to the polygons. Various methods are applied for this purpose.
A split area algorithm was presented by [38] for weighted splitting of faces in the context of a planar partition which is used to generate network segments on polygons representing water bodies. The proposed solution relies on Delaunay triangulation of polygon vortices. The edges of a Triangulated Irregular Network (TIN) form a skeleton. Selected triangles are assigned weights, which facilitates correct generation of the network model (Figure 7)

1.2. Methods of Generating the Axes of Elongated Polygons

Detailed solutions for generating elongated polygons based on points denoting an elongated polygon line have been proposed in the literature [40,41,42]. TIN edges that do not intersect the main direction of the anticipated polygon in a perpendicular direction pose a problem in the presented solutions. Side streams are created when TIN edges are taken into consideration in the process of generating a skeleton, and they have to be eliminated in successive steps. Various methods for addressing this issue have been proposed in the literature.
Wang et al. [40] used a backtracking algorithm to generate the main skeleton line by searching for other nodes in an orderly manner. This procedure involves three steps. First, a polygon is generated by Delaunay triangulation. Secondly, the start and end points of the main skeleton line are determined based on the main extension direction of the polygon. Finally, the backtracking algorithm is applied to generate the main skeleton line by searching for other nodes in an orderly manner.
Li et al. [41] proposed a partition line extraction algorithm that accounts for the direction between triangle edges and the distance of nodes in aggregation zones. Dangling arcs in the skeleton topology are eliminated by iterative deletion, and the split line is retained. The proposed method aims to maintain consistency between the characteristics of the extracted line structure and the actual structure of the object, in particular in complex branch convergence zones. In the first step, three types of aggregation patterns (aggregation zones type A, B and C) that occur in partition line extractions for LN patches of complex branch convergence zones were described using Delaunay triangulation. A partition line extraction algorithm that accounts for the direction between triangle edges and the distance of nodes in aggregation zones was then proposed.
A solution for extracting the skeleton line based on stroke features was described by [42]. In traditional approaches, the main structure and extension characteristics are difficult to maintain when dealing with dense junction areas due to the irregularity and complexity of junctions. Therefore, a skeleton line extraction method was proposed based on stroke features.
In the algorithm described by [37], TIN edges that do not intersect the polygon’s main direction are transformed. The algorithm is difficult, but not impossible to compute (Figure 8). In this solution, edges were carefully flipped in the constrained Delaunay triangulation to produce high-quality axes.
The described algorithms [37,40,41,42] for determining the main polygon axes and river axes are highly complex. New and simple solutions for automating the generation of the main river axes based on raster and vector data are thus needed. This is an important consideration because geometric models of watercourses are widely used in the management of water resources. They are also applied in specialist hydrographic research [43] and network analyses. Such solutions will also have numerous applications in cartographic generalization [44,45] and other processes [46].

1.3. Research Objective

The aim of this study was to propose a new and simple method for generating the centerlines of elongated polygons. It was assumed that the centerline can be generated based only on the midpoints of selected TIN edges that intersect polygons in a direction perpendicular to river flow (across). The research hypothesis states that the elimination of TIN edges that do not intersect the elongated polygon in a perpendicular direction does not exert a significant influence on the shape of the main polygon axis. Therefore, a simplified algorithm based on selected triangle types can be applied to generate the main polygon axis: (a), (b) or type 1 and type 2 triangles (Figure 5).
To verify the research hypothesis, the result produced by the simplified algorithm was compared with the centerline generated by the MAT algorithm in the ESRI application with the ”Polygon to center line” tool [33] and with the centerline generated with the VDs tool. The shape of the resulting axes was compared graphically by overlapping the relevant lines and with the use of statistical data.
The proposed method was tested on vector data acquired from the public Database of Topographic Objects in 1:10,000 scale (BDOT_10) [47]. The database contains vectorized digital orthophotomaps. In the study, the river channel was represented by an elongated polygon. The BDOT_10 database features a line representing the polygon axis (river). The line was generated manually with tools for mapping midpoints, and it was compared with the axis that was generated automatically in the adopted method.
The Database of Topographic Objects in 1:10,000 scale was developed in 2010, and it sets the following requirements for editing watercourses:
  • the minimum distance between line midpoints is 2 m,
  • river width should be determined with an accuracy of 20%.
If the accuracy with which two river banks are determined affects the accuracy of river width and the river axis, the same approach can be applied to determine the river axis. The above requirements can be also taken into consideration in other methods for determining the river axis.

2. Materials and Methods

The proposed method makes a reference to the approach that had been previously deployed by [48,49] to model a network of corridors in buildings. In the present study, the described approach was used to model a river channel based on geometric data. For the needs of this study, the presented approach was modified to model elongated objects characterized by varied width and narrow segments due to the presence of hydraulic structures in the river channel. Due to variations in river width, a universal approach to selecting midpoints on polygon centerlines was adopted. In this study and in the authors’ previous research, line segments intersecting polygons were generated by developing a Triangulated Irregular Network (TIN). Segments that intersect the polygon in a direction perpendicular to river flow (across) were selected by buffering (masking). The selected edges were used to generate polygon midpoints. In a watercourse with varied width, edges that intersect the river in a direction perpendicular to river flow (across) could not be selected by buffering. In the previous study, polygons were segmented with the use of VDs.
In the present study, this operation was performed based on selected TIN edges. Selected TIN edges were used to divide the polygon into segments. Segments of the polygon and the midpoints of selected TIN edges were used to generate the centerline based on topographic relations. The proposed method is not influenced by polygon features (geometric shape), and only two points have to be determined: the beginning and the end of the river. The new method is described in detail in successive parts of the article.
The method for generating a geometric model of a polygon’s centerline was tested on a section of the Łyna River. The river was represented by a polygon { P O L Y G O N R I V E R } . Lines representing the river’s left (Left_Bank) and right (Right_Bank) banks and the boundary lines of river islands (Island_Boundary) were derived from the polygon’s boundaries. Lines denoting river boundaries in the examined area, i.e., within the administrative boundaries of the city of Olsztyn, were also derived (River Boundary_City). A set of points { P O I N T B O U N D A R Y R I V E R } (1) denoting breaks in polygon lines was generated based on the polygon { P O L Y G O N R I V E R } .
{ P O L Y G O N R I V E R } g e n e r a t i o n { P O I N T B O U N D A R Y R I V E R } ,
The resulting dataset { P O I N T B O U N D A R Y R I V E R } was used to generate the { T I N } , (2).
{ P O I N T B O U N D A R Y R I V E R } g e n e r a t i o n { T I N } ,
TIN edges intersecting the river channel were selected based on the polygon { P O L Y G O N R I V E R } and the generated TIN (3).
{ P O L Y G O N R I V E R } { T I N } = T I N R I V E R ,
TIN edges which touch the boundaries on opposing river banks and represent adjacent segments of the river bank were selected from the set of TIN edges { T I N R I V E R } to generate the centerline of the examined river (4). This approach to selecting TIN edges is the fundamental part of the proposed methodology.
{ T I N R I V E R } s e l e c t { T I N R I V E R S E L E C T } ,
In the solutions proposed by other authors, such as Meisner et al. (2016), the skeleton is generated based on the entire dataset { T I N R I V E R } (3). In the next stage, the skeleton is adjusted to centerlines.
The selected edges T I N R I V E R S E L E K T were used to automatically generate the midpoints of the river channel { M I D P O I N T } (5).
{ T I N R I V E R S E L E C T } g e n e r a t i o n { M I D P O I N T } ,
The { M I D P O I N T } set contains only points inside the polygon { P O L Y G O N R I V E R } . Two points denoting the beginning and end of the examined river have to be added to the dataset. These points are generated from a segment of the line denoting the boundary of the analyzed area {River Boundary_City} (6). They are the midpoints of polygon edges representing the boundaries of the examined area (administrative boundaries of the city) {River Boundary_City}.
{ R i v e r   B o u n d a r y _ C i t y } g e n e r a t i o n   { M I D P O I N T B O U N D A R Y } ,
The sum of { M I D P O I N T } and {MIDPOINTBOUNDARY} datasets is the set of midpoints of the river channel { P O I N T A X I S } (7).
{ M I D P O I N T }   { M I D P O I N T B O U N D A R Y } = { P O I N T A X I S } ,
The centerline of the river cannot be determined based only on dataset { P O I N T A X I S } alone. Neighboring points have to be identified. It was assumed that { T I N R I V E R S E L E C T } divides the polygon { P O L Y G O N R I V E R } } into segments { S E G M E N T R I V E R } (8).
T I N R I V E R S E L E C T { P O L I G O N R I V E R } = { S E G M E N T R I V E R } ,
At least two points from the set { P O I N T A X I S } are positioned on the boundary of the polygon segment { S E G M E N T R I V E R } . The river centerline can be generated based on the neighborhood relations between datasets { S E G M E N T R I V E R b a s e }   and   { P O I N T A X I S } (9). A segment of the river channel is mapped between two selected points from set { P O I N T A X I S } if these points are positioned on the boundary of one segment from set { S E G M E N T R I V E R } .
( { P O I N T A X I S } , { { S E G M E N T R I V E R } } ) g e n e r a t e T O P O L O G Y   R I V E R   C E N T E R L I N E
In popular solutions that rely on TIN edges, a skeleton is generated for the entire polygon based on all midpoints of TIN edges within polygon boundaries (selection of internal triangles). As a result, the polygon centerline is generated with all side streams. In the adopted methodology, data edge TIN for generating the skeleton and the centerline are prepared first. The midpoints of selected TIN edges are used to generate the polygon centerline only. Therefore, side streams are not generated in the skeleton.
The adopted methodology is illustrated by the example presented in Figure 6. The polygon contains three types of triangles. In the traditional approach, the skeleton is based on all TIN edges (Figure 5, Figure 9a). When the polygon centerline line crosses two points, for example A D ¯ , TIN edge G E ¯ does not intersect the main polygon axis. This edge should not be taken into consideration in the presented method. When this edge is eliminated, the polygon axis is determined based on selected TIN edges ( G B ¯ ,   B E ¯ ,   C E ¯ ) . The topological relations between points A, D, and the midpoints of selected TIN edges vs. three triangles and a polygon with vertices F, G, B, E are taken into account in the process of determining the polygon axis. The results are presented in Figure 9b.
The proposed methodology was tested on a dataset representing a fragment of river channel within the administrative boundaries of a city. The presented solution is developed with the use of GIS tools in ArcMap, ESRI [14].

3. Results

3.1. Research Site

The proposed method was tested on data from the public Database of Topographic Objects in 1:10,000 scale (BDOT_10) created in 2012. The fragment of the Łyna River within the administrative boundaries of the city of Olsztyn in the Region of Warmia and Mazury, Poland, was represented by a single polygon (Figure 10).
The Łyna River is a meandering watercourse with varied channel width. The river features an island and hydraulic structures which considerably narrow down the river channel in selected locations (Figure 11). The Łyna River was selected for testing the proposed methodology due to its meandering geometry and the presence of distributary channels.
The centerline of the river from the BDOT_10 database was edited semi-manually by selecting points on both river banks (polygons), and it was drawn with the software tool. The resulting centerline does not account for the river’s course on both sides of the island.

3.2. Implementation of the Proposed Method

The edges intersecting the river channel were determined in the first stage of the study. A TIN was developed based on the points denoting river banks using the Delaunay triangulation algorithm (Figure 12, Figure 13). TIN edges positioned inside the river channel { T I N R I V E R } were selected, and TIN edges touching the bank on one side of the river were eliminated. The resulting TIN edges intersect the river channel in a direction perpendicular to river flow (across) { T I N R I V E R S E L E C T } (Figure 13d, Figure 14b,d).
TIN edges denoting opposing river banks were selected based on topological relations. In the proposed solution, edges were selected based on the neighborhood relations between TIN edges and the polygons adjacent to the river. Topological relations were generated based on the boundary lines of the river and the city (boundaries of the examined area), the polygon on the left bank, the polygon on the right bank, and the polygon representing the river island (Figure 15). The neighborhood relations between the river boundary and the polygons adjacent to the river are presented in Figure 15b. The “Joining Data by Location (Spatially)” tool was used to assign the ID numbers of adjacent polygons to TIN edges. TIN edges were selected with the “Select by Location” GIS tool and the “Touch the boundary of” option. These operations were iterated to analyze different neighborhood relations for all TIN edges. The TIN edges selected in successive iterations are marked in different colors in Figure 15b.
The selected edges TIN { T I N R I V E R S E L E C T } intersected the river channel in a direction perpendicular to river flow (across).
The presented methodology does not generate centerlines in side streams and distributary channels. TIN edges in side streams are eliminated because they touch the polygon’s boundary line on one side of the river, left or right (Figure 16).
Midpoints {MIDPOINT} (5) were generated based on selected edges { T I N R I V E R S E L E C T } . These points are situated inside the river channel (Figure 11). The centerline of the analyzed river was generated based on the topological relations between segments { S E G M E N T R I V E R } (8) and points { P O I N T A X I S } (7). A segment of the centerline was generated between two points from the { P O I N T A X I S } dataset if these points touched the edge of one segment from the dataset { S E G M E N T R I V E R } . An algorithm from the Geospatial Data Abstraction Library (GDAL) was used for data processing. The centerline generated in selected segments of the analyzed river is presented in Figure 17.
Adjustments are required in the centerline of the river segment near the island. Two segments that form loops should be eliminated. The centerline by the hydraulic structure should be adjusted. Acute angles in the centerline should be eliminated. The centerline should be generalized with the use of the available methods [50].

3.3. Verification of the Proposed Method with an ESRI Tool and a Tool Based On the Voronoi Diagram

The proposed solution was verified with the use of the “Polygon to centerline” option in ESRI software that relies on the MAT algorithm. According to the description of the ESRI tool, adaptive densification is applied to the input features to improve centerline quality. The center of the polygon, generated with the ESRI tool based on the same data, represents the Łyna River, and it is shown in Figure 18 against the TIN edges from Figure 17. The network generated with the ESRI tool is largely consistent with the results presented in Figure 18, and discrepancies are observed only in the proximity of floodplains and large river bends. The centerline generated with the ESRI tool in the vicinity of the hydraulic structure runs closer to the central part of the floodplain. Downstream from the hydraulic structure, the centerline breaks at acute angles. The solution based on the TIN produced similar results. The presented method should be simplified.
According to ESRI guidelines, the input features are densified to improve the quality of the generated centerline. As a result, the centerline of the analyzed river was generated based on a much higher number of points than in the TIN approach.
The diagram in Figure 19 reveals differences between the solution developed by the authors and that generated with the ESRI tool. In the floodplain (Figure 19a), the location of the centerlines generated by the compared approaches differs by up to 15 m (the river channel has a width of around 100 m). The compared centerlines are consistent in straight-line segments of the river (Figure 19a). The solution generated with the ESRI tool is different because the input features were densified, and the output was smoothed and written as a spline.
The proposed approach does not generate centerlines in distributary channels (Figure 20). The banks of side streams are incorporated into polygons representing the right or left river bank. In hydrological practice, distributary channels are usually eliminated in the process of generating a network.
A centerline was also generated with VDs [38]. The stages of generating a centerline are presented in Figure 15a–c. The generated skeleton had to be simplified to produce a centerline. The centerline generated in different segments of the river is shown in Figure 21d–f.
Additional parameters for comparing the results generated by the proposed method, the ESRI tool and the VD tool are presented in Table 1. The analyzed segment of the river has a length of approximately 15 km. The centerline generated by the proposed algorithm is 29 m shorter, and it is composed of 2646 segments (50% less than in the ESRI approach). The results were used to generate network models with the use of Network Analyst tools. The shortest paths between the beginning and end points of the analyzed river segment were generated with the use of Dijkstra’s algorithm. These values can be compared because they do not contain loops and do not account for distributary channels. In the proposed solution, the Łyna River is around 26 m longer than in the model developed with the ESRI tool. The difference is less than 2% relative to river length. The river described by the centerline generated with VDs is longest, which can be attributed to the zigzag centerline in straight-line segments of the river (Figure 20f). The difference in river length determined with ESRI and VD methods is 283 m. The difference of 26 m represents only 10% of 283 m.

3.4. A Comparison of Automatically and Manually Generated Centerlines

The comparison was performed based on public resource data. Vector data describing the river channel and the centerline were obtained from the BDOT database. The river axis was generated manually. It is most highly generalized and characterized by the smallest number of segments and the longest segments. The watercourse has a length of 14,669 m. It is based on only 1048 edges, and it shorter than the shortest paths generated by the proposed method as well as ESRI and VD tools.
Three automatically generated centerlines and one manually generated centerline are presented in Figure 22. In meandering segments, the manually derived centerline better fits river bends. The centerline created with the proposed method is more consistent with the centerline generated with the VD tool and the manually generated centerline than the centerline generated with the ESRI tool. The generated centerlines are consistent in straight-line segments of the river within a margin of 1.5 m (the average width of the river channel is around 16 m), which accounts for only 9.3% of river width.
The tools proposed by [51] were used to compare the centerlines of the river channel polygon. Four out of the 50 generated control lines intersecting the river channel are shown in Figure 23. The midpoints of control lines and the points at which all centerlines intersect control lines were generated. Four sets of river segments where the centerline deviates from the center of the river channel were created. The results are visualized in Figure 23, and the statistical parameters of the generated datasets are presented in Table 2.
The most appropriate centerline is difficult to identify. In straight-line segments of the river, the generated centerlines are similar and consistent with the average values given in Table 2. Greater deviations were noted in the floodplain and by the hydraulic structure.
All methods produced comparable results. The values generated by the manual method deviate most considerably from the values generated by the remaining methods. The polygon axis is generalized. The greatest deviation relative to river width is 14.5%. The axes developed with the use of the VD tool and the proposed algorithm are characterized by the smallest deviations. The method based on the VD tool was characterized by the lowest statistical parameters (Table 1), but the generated river was longest because its centerline is a zigzag line.

3.5. A Comparison of Formal BDOT_10 Requirements and Automatically Generated Centerlines

The provisions of the regulation setting the formal requirements regarding the precision and accuracy of the generated data should be taken into account when evaluating various methods for generating river axes. The first requirement is the distance between points, which should not be less than 2 m. The second requirement states that river width should be determined with an accuracy of up to 20%. As noted in Section 1, the accuracy of river width and the river axis depends on the accuracy with which the river banks are determined. In the presented example, the river axis was also determined to the nearest 20%. The evaluated values are presented in Table 3.
In the automatic generation method, the centerline is fragmented into a large number of segments. The highest fragmentation was observed in the ESRI method. A total of 2012 segments do not fulfill the requirements of the regulation. The smallest fragmentation was observed in the manual method, where all segments are longer than 2 m. In the proposed method, only 140 segments do not meet the relevant requirements. All automatically generated axes have to be simplified.
The accuracy of the generated axes was determined based on 50 control segments (Table 2). The axis generated by the ESRI method was characterized by the lowest accuracy, whereas the axis generated by the VD method was most accurate. It should be noted that river width was determined with an accuracy of up to 20%; therefore, the generated values are consistent with the relevant requirements.
The values generated by the proposed method require fewest modifications for consistency with the BDOT_10 requirements. The presented results testify to the effectiveness of the proposed method.

4. Discussion and Conclusions

The presented study proposes a new and simple algorithm for generating river centerlines. The presented solution was developed with the use of GIS tools in ArcMap.
The proposed method for generating the centerline of a river polygon is based on selected TIN edges that intersect the river channel in a direction perpendicular to river flow (across). The main river axis was generated. The centerlines of distributary channels were not generated. This approach to selecting TIN edges is a fundamental part of the proposed methodology. The described method can also be used to generate the centerline of a single river in a polygon containing a river with distributary channels.
The results of this study indicate that the proposed algorithm correctly generates the centerline of a river based on vector data. In straight-line segments of the river, the generated centerline is consistent with the centerlines generated in the remaining solutions. The centerline should be simplified in segments where the width of the river channel is significantly narrowed down by hydraulic structures. This modification is also required in the centerline generated with ESRI and VD tools.
The proposed algorithm offers an alternative to the existing solutions, and its main advantage is that it is simpler than the remaining methods. Only the main river axis is generated, without local centerlines in the river’s distributary channels. The presented results indicate that the proposed method is correct and practical.
The variations in the centerlines generated based on the same set of data indicate that none of the analyzed tools are ideal. The same algorithms should be used to generate centerlines that account for variations in river geometry over time. The application of different methods to generate the centerline of a watercourse can produce erroneous results.
In the future, the proposed algorithm will be tested and modified in analyses of other objects with varied shapes, in particular a larger number of connected water bodies.

Author Contributions

Conceptualization, Elżbieta Lewandowicz; Methodology, Elżbieta Lewandowicz; Software, Paweł Flisek; Validation, Elżbieta Lewandowicz; Formal Analysis, Elżbieta Lewandowicz; Writing-Original Draft Preparation, Elżbieta Lewandowicz; Writing-Review & Editing, Elżbieta Lewandowicz and Paweł Flisek; Visualization, Elżbieta Lewandowicz. All authors have read and agreed to the published version of the manuscript.

Funding

This research was financed as part of a statutory research project of the Faculty of Geongineering of the University of Warmia and Mazury in Olsztyn, Poland, entitled “Geoinformation from the theoretical, analytical and practical perspective” (No. 28.610.033-300_timeline: 2017–2020).

Acknowledgments

The authors are grateful to the Regional Center for Geodetic and Cartographic Documentation in Olsztyn for providing access to the Database of Topographical Objects in 1:10 000 scale. The acquired data supported analyses of the tested objects.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Łoś, H.; Osińska-Skotak, K.; Pluto-Kossakowska, J.; Bernier, M.; Yves, G.Y.; Pawłowski, B. Performance evaluation of quad-pol datacompare to dual-pol SAR data for river ice classification. Eur. J. Remote Sens. 2019, 52, 79–95. [Google Scholar] [CrossRef] [Green Version]
  2. Gao, F.; Ma, F.; Wang, J.; Sun, J.; Yang, E.; Zhou, H. Visual Saliency Modeling for River Detection in High-Resolution SAR Imagery. Access IEEE 2018, 6, 1000–1014. [Google Scholar] [CrossRef] [Green Version]
  3. Sarade, S.D.; Ghule, N.B.; Disale, S.P.; Sasane, S.R. Large ScaleSatellite Image Processing Using Hadoop Distributed System. Int. J. Adv. Res. Comput. Eng. Technol. 2014, 3, 731–735. [Google Scholar]
  4. Ciecholewski, M. River channel segmentation in polarimetric SAR images: Watershed transform combined with average contrast maximization. Expert Syst. Appl. 2017, 82, 196–215. [Google Scholar] [CrossRef]
  5. Arcelli, C.; Cordella, I.; Levialdi, S. Parallel thinning of binary pictures. Electron. Lett. 1975, 11, 148–149. [Google Scholar] [CrossRef]
  6. Greenlee, D.D. Raster and Vector Processing for Scanned Linework. Photogramm. Eng. Remote Sens. 1987, 53, 1383–1387. [Google Scholar]
  7. Hasthorpe, J.; Mount, N. The generation of river channel skeletons from binary images using raster thinning algorithms. In Proceedings of the Geographical Information Science Research UK Conference, Ireland Maynooth, Ireland, 11–13 April 2007. [Google Scholar]
  8. Pavelsky, T.M.; Smith, L.C. A software tool for the calculation of river widths from remotely sensed imagery. IEEE Geosci. Remote Sens. Lett. 2008, 5, 70–73. [Google Scholar] [CrossRef]
  9. Zeng, C.; Bird, S.; Luce, J.J.; Wang, J.A. Natural-Rule-Based-Connection (NRBC) Method for River Network Extraction from High-Resolution Imagery. Remote Sens. 2015, 7, 14055–14078. [Google Scholar] [CrossRef] [Green Version]
  10. Obida, C.B.; Blackburn, G.A.; Whyatt, J.D.; Kirk, T. River network delineation from Sentinel-1 SAR data. Int. J. Appl. Earth Obs. Geoinf. 2019, 83, 101910. [Google Scholar] [CrossRef]
  11. Holt, C.M.; Stewart, A.; Clint, M.; Perrott, R. An Improved Parallel Thinning Algorithm. Commun. ACM 1987, 30, 156–160. [Google Scholar] [CrossRef]
  12. Zhang, Y.Y.; Wang, P.S.P. A modified parallel thinning algorithm. In Proceedings of the 9th International Conference on Pattern Recognition, Rome, Italy, 14 May–17 November 1988. [Google Scholar]
  13. Pujari, A.K.; Mitra, C.; Mishra, S. A New Parallel Thinning Algorithm with Stroke Correction for Odia Characters. In Advanced Computing, Proceedings of the Networking and Informatics, 24–26 June, 2014; Kumar Kundu, M., Mohapatra, D., Konar, A., Chakraborty, A., Eds.; Springer, 2019; Volume 1, pp. 413–420. Available online: https://books.google.pl/books?id=qjwqBAAAQBAJ&printsec=frontcover&dq=New+Parallel+Thinning+Algorithm+with+Stroke+Correction+for+Odia+Characters.+In+Advanced+Computing,+proceedings+of+the+Networking+and+Informatics&hl=pl&sa=X&ved=0ahUKEwiwxIWJoqDpAhVNwqYKHQXFBJsQ6wEIQDAC#v=onepage&q=New%20Parallel%20Thinning%20Algorithm%20with%20Stroke%20Correction%20for%20Odia%20Characters.%20In%20Advanced%20Computing%2C%20proceedings%20of%20the%20Networking%20and%20Informatics&f=false (accessed on 23 March 2020).
  14. ESRI Polygon to Centerline. Available online: https://pro.arcgis.com/en/pro-app/tool-reference/topographic-production/polygon-to-centerline.htm#C_GUID-22398A58-3D55-4193-9C13-9A945C5BD1F0 (accessed on 23 March 2020).
  15. Haunert, J.H.; Sester, M. Using the Straight Skeleton for Generalisation in a Multiple Representation Environment. In Proceedings of the 7th ICA Workshop on Generalisation and Multiple Representation, Leicester, UK, 20–21 August 2004. [Google Scholar]
  16. Szombara, S. Comparison of methods used in cartography for the skeletonisation of areal objects. Geoinform. Pol. 2015, 14. [Google Scholar] [CrossRef]
  17. Golly, A.; Turowski, J.M. Deriving principle channel metrics from bank and long-profile geometry with the R-package cmgo. Earth Surf. Dynam. 2017, 5, 557–570. [Google Scholar] [CrossRef] [Green Version]
  18. ET SpatialTechniques. Available online: https://www.ian-ko.com (accessed on 23 March 2020).
  19. GRASS. Available online: https://grass.osgeo.org/grass76/manuals/addons/v.centerline.html (accessed on 23 March 2020).
  20. FME-Approximate-Centerline-of-Polygon. Available online: https://knowledge.safe.com/questions/92663/approximate-centerline-of-polygon.html (accessed on 23 March 2020).
  21. Python. Available online: https://pypi.org/project/centerline/ (accessed on 23 March 2020).
  22. Aurenhammer, F.; Alberts, D.; Gartner, B. A Novel Type of Skeletons or Polygons. J. Univers. Comput. Sci. 1995, 1, 752–761. [Google Scholar]
  23. Felkel, P.; Obdrzalek, S. Straight Skeleton Implementation. In Proceedings of the Spring Conferenceon Computer Graphics, Budmerice, Slovakia, 23–25 April 1998; pp. 210–218. [Google Scholar]
  24. Huber, S. The Topology of Skeletons and Offsets. In Proceedings of the 34th European Workshop on Computational Geometry, Berlin, Germany, 21–23 March 2018. [Google Scholar]
  25. Biedl, T.; Held, M.; Hubert, S.; Kaaser, D.; Palfrader, P. A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Inf. Process. Lett. 2015, 115, 243–247. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  26. Eder, G.; Held, M. Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement. Elsevier Inf. Process. Lett. 2017, 132, 28–32. [Google Scholar] [CrossRef]
  27. Lee, D.T. Medial Axis Transformation of a Planar Shape. IEEE Trans. Pattern Anal. Mach. Intell. 1982, 4, 363–369. [Google Scholar] [CrossRef]
  28. Chin, F.; Snoeyink, J.; Wang, C.A. Finding the Medial Axis of a Simple Polygon in Linear Time. In Proceedings of the 6th International Symposium Algorithms and Computation (ISAAC 95), Cairns, Australia, 4–6 December 1995; pp. 382–391, ISBN 3-540-60573-8. Available online: https://dblp1.uni-trier.de/db/conf/isaac/isaac95.html (accessed on 23 March 2020).
  29. Karimipour, F.; Ghandehari, M.; Ledoux, H. Watershed delineation from the medial axis of river networks. Comput. Geosci. 2013, 59, 132–147. [Google Scholar] [CrossRef]
  30. Joan-Arinyo, R.; Pérez-Vidal, L.; Gargallo-Monllau, E. An adaptive algorithm to compute the medial axis transform of 2-d polygonal domains. In CAD Systems Development Tools and Methods; Roller, D., Brunet, P., Eds.; Springer: Berlin/Heidelberg, Germany, 1997; pp. 283–298. [Google Scholar]
  31. Prinz, F.B.; Cern, J.-H. Geometric Abstractions Using Medial Axis Transformation; Carnegie Mellon University: Pittsburgh, PA, USA, 1988. [Google Scholar]
  32. McAllister, M.; Snoeyink, J. Medial axis generalization of river net-works. Cartogr. Geogr. Inf. Sci. 2000, 27, 129–138. [Google Scholar] [CrossRef] [Green Version]
  33. Giesen, J.; Miklos, B.; Pauly, M. Medial axis approximation of planar shapesfrom union of balls: A simpler and more robust algorithm. In Proceedings of the 19th Annual Canadian Conference on Computational Geometry, Ottawa, ON, Canada, 20–22 August 2007. [Google Scholar]
  34. Smathermather. Available online: https://smathermather.com/2011/09/16/what-is-the-center-line-of-a-polygon-or-how-to-change-labeling-in-geoserver/ (accessed on 23 March 2020).
  35. Giesen, J.; Miklos, B.; Pauly, M.; Wormser, C. The scale axis transform. In Proceedings of the 25th Annual Symposium on Computational Geometry, Aarhus, Denmark, 8–10 June 2009. [Google Scholar]
  36. Lu, W.; Tinghua, A. Center Point of Simple Area Feature Based on Triangulation Skeleton Graph. (Short Paper). GIScience 2018, 41:1–41:6. [Google Scholar]
  37. Aigner, W.; Aurenhammer, F.; Jüttler, B. On triangulation axes of polygons. Inf. Process. Lett. 2015, 115, 45–51. [Google Scholar] [CrossRef]
  38. Meijers, M.; Savino, S.; Van Oosterom, P. SPLITAREA: An algorithm for weighted splitting of faces in the context of a planar partition. Int. J. Geogr. Inf. Sci. 2016, 30, 1522–1551. [Google Scholar] [CrossRef] [Green Version]
  39. Li, C.; Yin, Y.; Wu, P.; Liu, X.; Guo, P. Improved Jitter Elimination and Topology Correction Method for the Split Line of Narrow and Long Patches. ISPRS Int. J. Geo-Inf. 2018, 7, 402. [Google Scholar] [CrossRef] [Green Version]
  40. Wang, Z.; Yan, H. An algorithm for extracting main skeleton lines of polygons based on main extension directions. In Proceedings of the 2011 International Conference on Electronics, Communications and Control (ICECC), Ningbo, China, 9–11 September 2011; pp. 125–127. [Google Scholar]
  41. Li, C.; Dai, Z.; Yin, Y.; Wu, P. A method for the extraction of partition lines from long and narrow patches that account for structural features. Trans. GIS 2019, 23, 349–364. [Google Scholar] [CrossRef]
  42. Li, C.; Yin, Y.; Wu, P.; Wei, W. Skeleton Line Extraction Method in Areas with Dense Junctions Considering Stroke Features. Int. J. Geo-Inf. 2019, 8, 303. [Google Scholar] [CrossRef] [Green Version]
  43. Rajib, A.; Merwade, V. Hydrologic response to future land use change in the Upper Mississippi River Basin by the end of 21st century. Hydrol. Process. 2017, 31, 3645–3661. [Google Scholar] [CrossRef]
  44. Kozioł, K.; Lupa, M.; Krawczyk, A. The Extended Structure of Multi-Resolution Database. In Beyond Databases, Architectures, and Structures, Proceedings of the BDAS 2014. Communications in Computer and Information Science, Ustron, Poland, 27–30 May 2014; Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D., Eds.; Springer: Cham, Switzerland, 2014; Volume 424. [Google Scholar]
  45. Delucai, A.A.; Black, R.T. A Comprehensice Approach to Automatic Feature Generalization. In Proceedings of the 13th International Cartographic Conference, Mich, Mexico, 12–21 October 1987. [Google Scholar]
  46. Penninga, F.; Verbree, E.; Quak, W.; Van Oosterom, P. Construction of the Planar Partition Postal Code Map Based on Cadastral Registration. GeoInformatica 2005, 9, 181–204. [Google Scholar] [CrossRef] [Green Version]
  47. Regulation of the Minister of the Interior of 17 November 2011 on databases of topographic objects, databases of geographic objects, and standard maps (Journal of Laws 2011, poz. 1642)., (in Polish:. Rozporządzenie ministra spraw wewnętrznych i administracji z dnia 17 listopada 2011 r. w sprawie bazy danych obiektów topograficznych oraz bazy danych obiektów ogólnogeograficznych, a także standardowych opracowań kartograficznych (D.U. z dnia 17 listopada 2011 r).
  48. Lewandowicz, E.; Lisowski, P. Methodology to generate navigation models in buildings. J. Civ. Eng. Manag. 2018, 28, 653–663. [Google Scholar] [CrossRef]
  49. Lewandowicz, E.; Lisowski, P.; Flisek, P. A Modified Methodology for Generating Indoor Navigation Models. Int. J. Geo-Inf. 2019, 8, 60. [Google Scholar] [CrossRef] [Green Version]
  50. Chrobak, T. A Numerical Method for Generalizing the Linear Elements of Large-Scale Maps, Based on the Example of Rivers. Cartogr. Cartogr. Int. J. Geogr. Inf. Geovisualization 2006, 37, 49–56. [Google Scholar] [CrossRef]
  51. Nyberg, B. Geometric Attributes Tools. Available online: https://github.com/BjornNyberg/Geometric-Attributes-Toolbox/blob/master/Datasets/README.pdf (accessed on 23 March 2020).
Figure 1. A skeleton (red lines) of the created object: (a) based on Voronoi diagram (VD) edges; (b) with the use of the Straight Skeleton method; (c) with the Medial Axis (Transform) method; (d) with constrained Delaunay triangulation [16].
Figure 1. A skeleton (red lines) of the created object: (a) based on Voronoi diagram (VD) edges; (b) with the use of the Straight Skeleton method; (c) with the Medial Axis (Transform) method; (d) with constrained Delaunay triangulation [16].
Ijgi 09 00304 g001
Figure 2. Process of generating the centerline of a river by partitioning a polygon into segments with VDs. (a) this study; (b) visualization realized by Golly and Turowski [9].
Figure 2. Process of generating the centerline of a river by partitioning a polygon into segments with VDs. (a) this study; (b) visualization realized by Golly and Turowski [9].
Ijgi 09 00304 g002
Figure 3. Generation of polygon centerlines with the use of the Straight Skeleton algorithm [25]; (a) simple example, (b) example at diverse polygon.
Figure 3. Generation of polygon centerlines with the use of the Straight Skeleton algorithm [25]; (a) simple example, (b) example at diverse polygon.
Ijgi 09 00304 g003
Figure 4. Generation of polygon centerlines with the use of the Medial Axis Transformation (MAT) algorithm: (a1) and (a2) the resulting centerline of a watercourse [34], (b) elimination of distributary channels during the generation of polygon centerlines on the map of Italy [35].
Figure 4. Generation of polygon centerlines with the use of the Medial Axis Transformation (MAT) algorithm: (a1) and (a2) the resulting centerline of a watercourse [34], (b) elimination of distributary channels during the generation of polygon centerlines on the map of Italy [35].
Ijgi 09 00304 g004
Figure 5. Triangle types: (1): (a) ear triangle, (b) link triangle, (c) branch triangle [37]; (2): 0-triangles, 1-triangles, 2-triangles and 3-triangles [38].
Figure 5. Triangle types: (1): (a) ear triangle, (b) link triangle, (c) branch triangle [37]; (2): 0-triangles, 1-triangles, 2-triangles and 3-triangles [38].
Ijgi 09 00304 g005
Figure 6. Delaunay triangle classification and the generated polygon skeleton [36].
Figure 6. Delaunay triangle classification and the generated polygon skeleton [36].
Ijgi 09 00304 g006
Figure 7. The results of a split area algorithm for generating a polygon axis based on three triangle types: (a) base skeleton, (b) modification of the final skeleton [38].
Figure 7. The results of a split area algorithm for generating a polygon axis based on three triangle types: (a) base skeleton, (b) modification of the final skeleton [38].
Ijgi 09 00304 g007
Figure 8. Two different axes generated from a single polygon: (a) an axis containing an unwanted branch, (b) the axis is pruned by flipping in the triangulation [37].
Figure 8. Two different axes generated from a single polygon: (a) an axis containing an unwanted branch, (b) the axis is pruned by flipping in the triangulation [37].
Ijgi 09 00304 g008
Figure 9. A comparison of two methods: (a) a traditional approach where the skeleton is based on three types of triangles; (b) the solution adopted in the proposed algorithm (based on the data in Figure 4).
Figure 9. A comparison of two methods: (a) a traditional approach where the skeleton is based on three types of triangles; (b) the solution adopted in the proposed algorithm (based on the data in Figure 4).
Ijgi 09 00304 g009
Figure 10. Research site in an Open Street Map (OSM): (a) map of Europe, (b) fragment of the Łyna River within the administrative boundaries of Olsztyn city.
Figure 10. Research site in an Open Street Map (OSM): (a) map of Europe, (b) fragment of the Łyna River within the administrative boundaries of Olsztyn city.
Ijgi 09 00304 g010
Figure 11. Research site: (a) fragment of the river within the administrative boundaries of Olsztyn; (b) hydraulic structure in the river channel; (c) river island by the hydraulic structure; (d) river axis from the BDOT_10 database.
Figure 11. Research site: (a) fragment of the river within the administrative boundaries of Olsztyn; (b) hydraulic structure in the river channel; (c) river island by the hydraulic structure; (d) river axis from the BDOT_10 database.
Ijgi 09 00304 g011
Figure 12. Triangulated Irregular Network Triangulated Irregular Network (TIN); (a) fragment of the river within the administrative boundaries of Olsztyn; (b) TIN model generated based on breakpoints in the river bank line within the administrative boundaries of Olsztyn city.
Figure 12. Triangulated Irregular Network Triangulated Irregular Network (TIN); (a) fragment of the river within the administrative boundaries of Olsztyn; (b) TIN model generated based on breakpoints in the river bank line within the administrative boundaries of Olsztyn city.
Ijgi 09 00304 g012
Figure 13. Generation of edges intersecting the river channel in a direction perpendicular to river flow (across) (a) points situated on the bank line, (b) TIN model, (c) TIN edges positioned inside the river channel, (d) selection of edges touching opposing river banks.
Figure 13. Generation of edges intersecting the river channel in a direction perpendicular to river flow (across) (a) points situated on the bank line, (b) TIN model, (c) TIN edges positioned inside the river channel, (d) selection of edges touching opposing river banks.
Ijgi 09 00304 g013
Figure 14. Selection of TIN edges in special locations: (a) island in the river channel, TIN edges in the river channel; (b) selected segments of TIN edges in the river channel; (c) hydraulic structure, TIN edges; (d) selected segments of TIN edges in the river channel by the hydraulic structure.
Figure 14. Selection of TIN edges in special locations: (a) island in the river channel, TIN edges in the river channel; (b) selected segments of TIN edges in the river channel; (c) hydraulic structure, TIN edges; (d) selected segments of TIN edges in the river channel by the hydraulic structure.
Ijgi 09 00304 g014
Figure 15. Topological (neighborhood) relations between TIN edges and polygons: (a) graphic presentation of neighboring polygons; (b) presentation of topological relations in the database, and the TIN edges selected in successive iterations based on topological relationships (marked in different colors).
Figure 15. Topological (neighborhood) relations between TIN edges and polygons: (a) graphic presentation of neighboring polygons; (b) presentation of topological relations in the database, and the TIN edges selected in successive iterations based on topological relationships (marked in different colors).
Ijgi 09 00304 g015
Figure 16. Automatic elimination of TIN channels in distributary channels during { T I N R I V E R } s e l e c t { T I N R I V E R S E L E K T } (4). The centerlines of side streams are not generated because TIN edges were eliminated. (a) TIN edges in the river channel { T I N R I V E R } ; (b) selected TIN edged { T I N R I V E R S E L E C T } .
Figure 16. Automatic elimination of TIN channels in distributary channels during { T I N R I V E R } s e l e c t { T I N R I V E R S E L E K T } (4). The centerlines of side streams are not generated because TIN edges were eliminated. (a) TIN edges in the river channel { T I N R I V E R } ; (b) selected TIN edged { T I N R I V E R S E L E C T } .
Ijgi 09 00304 g016
Figure 17. Centerline of the river channel in special locations: (a) floodplain; (b) river island; (c) narrow segment of the river by the hydraulic structure.
Figure 17. Centerline of the river channel in special locations: (a) floodplain; (b) river island; (c) narrow segment of the river by the hydraulic structure.
Ijgi 09 00304 g017
Figure 18. Segments of the river centerline generated with the ESRI tool and { T I N R I V E R S E L E C T } developed by the authors in special locations: (a) floodplain; (b) river island; (c) narrow river segment by the hydraulic structure.
Figure 18. Segments of the river centerline generated with the ESRI tool and { T I N R I V E R S E L E C T } developed by the authors in special locations: (a) floodplain; (b) river island; (c) narrow river segment by the hydraulic structure.
Ijgi 09 00304 g018
Figure 19. The results of the compared approaches: (a) graphic presentation of the compared solutions; (b) features of the centerline generated by the proposed method; (c) features of the centerline generated with the ESRI tool.
Figure 19. The results of the compared approaches: (a) graphic presentation of the compared solutions; (b) features of the centerline generated by the proposed method; (c) features of the centerline generated with the ESRI tool.
Ijgi 09 00304 g019
Figure 20. Centerlines generated by the compared methods: (a) centerlines are consistent in straight-line segments of the river; (b,c) the proposed solution does not generate centerlines in distributary channels.
Figure 20. Centerlines generated by the compared methods: (a) centerlines are consistent in straight-line segments of the river; (b,c) the proposed solution does not generate centerlines in distributary channels.
Ijgi 09 00304 g020
Figure 21. The centerline of a polygon generated with a tool based on the VD algorithm; (a) a view of selected river segments; (b) generated skeleton model. Centerlines in (c) the floodplain, (b) near the island, (e) by the hydraulic structure. (f) A zigzag centerline in straight-line segments of the river.
Figure 21. The centerline of a polygon generated with a tool based on the VD algorithm; (a) a view of selected river segments; (b) generated skeleton model. Centerlines in (c) the floodplain, (b) near the island, (e) by the hydraulic structure. (f) A zigzag centerline in straight-line segments of the river.
Ijgi 09 00304 g021
Figure 22. A centerline generated manually based on the image of the river channel, and the centerlines generated by the proposed method, the ESRI tool and the VD tool: (a) floodplain; (b) river island; (c) narrow segment of the river by the hydraulic structure.
Figure 22. A centerline generated manually based on the image of the river channel, and the centerlines generated by the proposed method, the ESRI tool and the VD tool: (a) floodplain; (b) river island; (c) narrow segment of the river by the hydraulic structure.
Ijgi 09 00304 g022
Figure 23. Centerlines in the control segments of the river channel; (a) control segments [44]; (b) Control line with a length of 61.68 m and the deviation of midpoints generated with different methods; (c) control line with a length of 86.82 m. The maximum deviation of 10.11 m was noted for the manually generated line.
Figure 23. Centerlines in the control segments of the river channel; (a) control segments [44]; (b) Control line with a length of 61.68 m and the deviation of midpoints generated with different methods; (c) control line with a length of 86.82 m. The maximum deviation of 10.11 m was noted for the manually generated line.
Ijgi 09 00304 g023
Table 1. River features in the compared approaches.
Table 1. River features in the compared approaches.
Network Generation MethodAutomatically Generated Length of the River’s Center lineNumber of Edges on the CenterlineAverage Edge LengthMaximum Edge LengthStandard Deviation of Edge LengthRiver Length Described by the Shortest Path
Proposed method15,014 m26465.6 m82.7 m4.514,865 m
ESRI tool15,097 m
The output contains distributary channels
53072.8 m26.9 m2.114,839 m
Voronoi Diagram tool (VD)15,122 m39403.838.22.715,122 m
Manual14,669 m104813.993.612.114,669 m
Table 2. Statistical parameters of the centerlines in the control segments of the river channel based on the segments between the midpoints of control lines and the points where centerlines intersect control segments.
Table 2. Statistical parameters of the centerlines in the control segments of the river channel based on the segments between the midpoints of control lines and the points where centerlines intersect control segments.
Network Generation MethodDeviation of Central Lines from the Center of the River Channel Based on Control Segments
Maximum Deviation Relative to the Width of the River Channel
[m]/[m]
Average Deviation [m]Sum of 50 Deviations [m]Standard Deviation
Proposed method1.53/61.680.2412.160.29
ESRI tool2.52/17.310.2411.970.54
VD tool0.46/61.68 0.136.290.11
Manual11.66/95.192.44121,762.99
Table 3. Evaluation of centerlines based on the regulation relating to the BDOT_10 database.
Table 3. Evaluation of centerlines based on the regulation relating to the BDOT_10 database.
Network Generation MethodEvaluation of Centerlines Based on the Regulation Relating to the BDOT_10 Database
Number of Edges on the Centerline/Number Edges Shorter than 2 mMaximum Deviation Relative to the Width of the River ChannelAccuracy of the River Axis for Maximum Deviations
Proposed method2646/1401.53/61.682.5%
ESRI tool5307/20122.52/17.3114.5%
VD tool3940/10700.46/61.680.7%
Manual1048/011.66/95.191.2%

Share and Cite

MDPI and ACS Style

Lewandowicz, E.; Flisek, P. A Method for Generating the Centerline of an Elongated Polygon on the Example of a Watercourse. ISPRS Int. J. Geo-Inf. 2020, 9, 304. https://doi.org/10.3390/ijgi9050304

AMA Style

Lewandowicz E, Flisek P. A Method for Generating the Centerline of an Elongated Polygon on the Example of a Watercourse. ISPRS International Journal of Geo-Information. 2020; 9(5):304. https://doi.org/10.3390/ijgi9050304

Chicago/Turabian Style

Lewandowicz, Elżbieta, and Paweł Flisek. 2020. "A Method for Generating the Centerline of an Elongated Polygon on the Example of a Watercourse" ISPRS International Journal of Geo-Information 9, no. 5: 304. https://doi.org/10.3390/ijgi9050304

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop