Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

# Base Point Split Algorithm for Generating Polygon Skeleton Lines

Version 1 : Received: 28 September 2020 / Approved: 29 September 2020 / Online: 29 September 2020 (16:52:30 CEST)

A peer-reviewed article of this Preprint also exists.

Lewandowicz, E.; Flisek, P. Base Point Split Algorithm for Generating Polygon Skeleton Lines on the Example of Lakes. ISPRS Int. J. Geo-Inf. 2020, 9, 680. Lewandowicz, E.; Flisek, P. Base Point Split Algorithm for Generating Polygon Skeleton Lines on the Example of Lakes. ISPRS Int. J. Geo-Inf. 2020, 9, 680.

## Abstract

The article presents the Base Point Split (BPSplit) algorithm for generating a polygon skeleton based on sets of vector data describing lakes and rivers. A key feature of the BPSplit algorithm is that it is dependent on base points representing the source or mouth of a river or a stream. The input values of base points determine the shape of the resulting skeleton. Various skeletons can be generated with the use of different base points. Base points are applied to divide polygon boundaries into segments. Segmentation supports the selection of TIN edges inside polygons. The midpoints of selected TIN edges constitute a basis for generating a skeleton. The algorithm handles polygons with numerous holes, and it accounts for all holes. This article proposes a method for modifying a complex skeleton with numerous holes. In the discussed approach, skeleton edges that do not meet the preset criteria (e.g. that the skeleton is to be located between holes in the center of the polygon), are automatically removed. A simple algorithm for smoothing zigzag lines was proposed.

## Keywords

straight skeleton; hydrographic network; network modeling

## Subject

Engineering, Automotive Engineering