Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Skeleton Line Extraction Method for Dense Areas of Intersections

A dense area and extraction method technology, applied in the field of map drawing, to achieve scientific and accurate results

Active Publication Date: 2020-03-17
CHINESE ACAD OF SURVEYING & MAPPING
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a method for extracting skeleton lines in dense areas of intersections, thereby solving the aforementioned problems in the prior art

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Skeleton Line Extraction Method for Dense Areas of Intersections
  • A Skeleton Line Extraction Method for Dense Areas of Intersections
  • A Skeleton Line Extraction Method for Dense Areas of Intersections

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0058] Such as Figure 2 to Figure 6 As shown, the specific content of step S1 is described in detail in this embodiment, and the specific content of step S1 includes the following content, such as figure 2 Shown:

[0059] S101. Identify obtuse triangles in class III triangles in the constrained Delaunay triangulation, and set a minimum angle threshold, mark obtuse triangles with minimum angles smaller than the minimum angle threshold, and put them into a triangle set;

[0060] S102. Identify the longest sides of all triangles in the triangle set, and search for Class II triangles that are adjacent to these longest sides and have one side as a boundary;

[0061] S103. Select all II triangles whose longest sides are boundary sides, mark them as triangles to be encrypted, and mark their corresponding longest sides as local long sides to be encrypted;

[0062] S104. Set the shortest side of a type III triangle in the triangle set associated with the triangle to be encrypted as...

Embodiment 2

[0066] Such as Figure 7 to Figure 10 As shown, in this embodiment, step S3 is described, and the step S3 includes the following content, such as Figure 7 Shown:

[0067] S301. Construct point and line topology for the initial skeleton line, and record the number of associated arcs associated with each node in the skeleton line topology;

[0068] S302. Select a node whose number of associated arcs is three, the node is a three-fork node, and its area is a three-fork area;

[0069] S303. Calculate the local approximate width of the trifurcation area;

[0070] S304. Define the arc segment whose first and last endpoints are both three-fork nodes as a connecting arc segment; respectively calculate the local approximate width of the area where the first node and the end node of the connecting arc segment are located, and use the larger value as the connecting arc segment The local approximate width of the area;

[0071] S305, record the part between the first node and the end ...

Embodiment 3

[0082] Such as Figure 11 to Figure 13 As shown, this embodiment describes step S4, and the step S4 specifically includes the following content, such as Figure 11 Shown:

[0083] S401. Using the CRITIC method to weight the length, connectivity, proximity and betweenness of each connecting arc to obtain the importance of the connecting arc;

[0084] S402. Select a three-fork node with an associated arc on only one side as the starting node for stroke connection tracking, and use the connecting arc of the three-fork node as a tracking arc, and the other side of the tracking arc The node is used as a tracking node;

[0085] S403, using the connection arcs of the tracking nodes as a stroke connection candidate set, and calculating the importance of each connection arc;

[0086] S404. Prioritize connecting the more important connecting arc with the previous connecting arc to form a stroke;

[0087] S405. On the basis of steps S403 and S404, continue to track and calculate the ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for extracting skeleton lines in a dense intersection area, comprising the following steps: S1, establishing a polygonal constrained Delaunay triangular network, encrypting the long sides of the polygon, and updating the constrained Delaunay triangular network; S2, based on updating The final constrained Delaunay triangular network is used to extract polygonal skeleton lines; S3, based on the extracted skeleton lines, identify intersection dense areas; S4, adjust and optimize the skeleton lines for the identified intersection dense areas. The advantage is: the overall characteristics of the original area can be maintained after the skeleton line is extracted by this method, which is naturally extended and meets the requirements of human vision; The skeleton line of the region is jittered, and the proposed skeleton line will not be distorted to a large extent, nor will the overall structure of the region be lost.

Description

technical field [0001] The invention relates to the technical field of map drawing, in particular to a method for extracting skeleton lines in dense areas of intersections. Background technique [0002] Skeleton line extraction is a key step to realize map comprehensive operations such as polygon dimension reduction, splitting and melting. Skeleton line extraction should take into account the shape characteristics of polygons, be able to summarize the main structure and extension characteristics of polygons, and meet human needs while conforming to cartography specifications visual cognition. At present, the most commonly used method for skeleton line extraction is a skeleton line extraction method based on boundary-constrained Delaunay triangulation proposed by DeLucia et al. in 1987, and a large number of subsequent researchers have improved it based on this method. For example, in the paper "Research on Automatic Search Algorithm of Polygon Skeleton Line and Centroid" by...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06T7/12G06T7/181G06T7/60
CPCG06T7/12G06T7/181G06T7/60G06T2207/10004G06T2207/30108G06T7/13G06T2207/20044
Inventor 李成名吴伟殷勇武鹏达郭沛沛刘晓丽
Owner CHINESE ACAD OF SURVEYING & MAPPING
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com