Improved Jitter Elimination and Topology Correction Method for the Split Line of Narrow and Long Patches

Li, Chengming; Yin, Yong; Wu, Pengda; Liu, Xiaoli; Guo, Peipei

doi:10.3390/ijgi7100402

Cited by 11 publications

(7 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the skeleton lines of the branch have an unstable direction, then connect the endpoint of the third arc with the midpoint of the Arc adjust ; otherwise, extend the third arc to Arc adjust along its directions. The direction of the skeleton is defined by the algorithm proposed by Li et al (2018), which is then determined by the direction of internal arcs of five adjacent triangles. The skeleton lines are deemed to be directionally stable if the direction differences of these five arcs are less than 5 • .…”

Section: Skeleton Line Adjustmentmentioning

confidence: 99%

“…Relying on the WJ-III map workstation developed by the Chinese Academy of Surveying and Mapping [20], the method of extracting the skeleton line of the areas with dense junctions considering stroke features proposed in this paper is embedded, and a complex water area group in the topographic map of an area in Jiangsu with a scale of 1:10000 was taken as the experimental data for reliability and effectiveness verification. The experimental data space range was 2.7 × 2.7 km 2 , the software system running environment was the Windows 7 64-bit operating system, the CPU was an Intel Core I7-3770, the main frequency was 3.2 GHz, the memory as 16GB, and the solid-state hard disk was 1 TB.…”

Section: Experimental Data and Environmentmentioning

confidence: 99%

See 1 more Smart Citation

Skeleton Line Extraction Method in Areas with Dense Junctions Considering Stroke Features

Yin

et al. 2019

IJGI

Self Cite

View full text Add to dashboard Cite

Extraction of the skeleton line of complex polygons is difficult, and a hot topic in map generalization study. Due to the irregularity and complexity of junctions, it is difficult for traditional methods to maintain main structure and extension characteristics when dealing with dense junction areas, so a skeleton line extraction method considering stroke features has been proposed in this paper. Firstly, we put forward a long-edge adaptive node densification algorithm, which is used to construct boundary-constrained Delaunay triangulation to uniformly divide the polygon and extract the initial skeleton line. Secondly, we defined the triangles with three adjacent triangles (Type III) as the basic unit of junctions, then obtained the segmented areas with dense junctions on the basis of local width characteristics and correlation relationships of each Type III triangle. Finally, we concatenated the segments into strokes and corrected the initial skeleton lines based on the extension direction features of each stroke. The actual water network data of Jiangsu Province in China were used to verify the method. Experimental results show that the proposed method can better identify the areas with dense junctions and that the extracted skeleton line is naturally smooth and well-connected, which accurately reflects the main structure and extension characteristics of these areas.

show abstract

Section: Skeleton Line Adjustmentmentioning

confidence: 99%

Section: Experimental Data and Environmentmentioning

confidence: 99%

Skeleton Line Extraction Method in Areas with Dense Junctions Considering Stroke Features

Yin

et al. 2019

IJGI

Self Cite

View full text Add to dashboard Cite

show abstract

“…In successive steps, the selected skeleton edges are modified and removed to improve the applicability of the results. Skeletons are modified with the use of various methods, including correction [7,15], extraction [8], hierarchical feature extraction [16], filtration [17,18] and generalization [19]. Different types of triangles are identified in polygons that are generated with the use of methods based on triangulated irregular networks (TIN) [7,10,20].…”

Section: Introductionmentioning

confidence: 99%

Base Point Split Algorithm for Generating Polygon Skeleton Lines on the Example of Lakes

Lewandowicz¹,

Flisek²

2020

IJGI

View full text Add to dashboard Cite

This article presents the Base Point Split (BPSplit) algorithm to generate a complex 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 of complex polygons. Various skeletons can be generated with the use of different base points. Base points are applied to divide complex polygon boundaries into segments. Segmentation supports the selection of triangulated irregular network (TIN) edges inside complex polygons. The midpoints of the selected TIN edges constitute a basis for generating a skeleton. The algorithm handles complex 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. An algorithm for smoothing zigzag lines was proposed.

show abstract

“…In successive steps, selected skeleton edges are modified and removed to improve the applicability of the results. Skeletons are modified with the use of various methods, including correction [7,15], extraction [8], hierarchical feature extraction [16], filtration [17,18] and generalization [19]. Different types of triangles are identified in polygons that are generated with the use of methods based on triangulated irregular networks (TIN) [10,7,20].…”

Section: Introductionmentioning

confidence: 99%

“…Figure15. Examples of different polygon segments for generating a skeleton based on the midpoints of selected TIN edges.…”

mentioning

confidence: 99%

Base Point Split Algorithm for Generating Polygon Skeleton Lines

Lewandowicz¹,

Flisek²

2020

Preprint

View full text Add to dashboard Cite

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.

show abstract

Improved Jitter Elimination and Topology Correction Method for the Split Line of Narrow and Long Patches

Cited by 11 publications

References 17 publications

Skeleton Line Extraction Method in Areas with Dense Junctions Considering Stroke Features

Skeleton Line Extraction Method in Areas with Dense Junctions Considering Stroke Features

Base Point Split Algorithm for Generating Polygon Skeleton Lines on the Example of Lakes

Base Point Split Algorithm for Generating Polygon Skeleton Lines

Contact Info

Product

Resources

About