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

Edge orientation-based rectangular segmentation graph construction method

A construction method and rectangular segmentation technology, applied in the field of data visualization, can solve the problems of complex calculation and low efficiency, and achieve the effect of simple implementation process

Pending Publication Date: 2022-08-09
PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU
View PDF0 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 constructing a rectangular segmentation map based on edge orientation, so as to solve the problems of complicated calculation and low efficiency when dividing the original map into a rectangular segmentation map

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
  • Edge orientation-based rectangular segmentation graph construction method
  • Edge orientation-based rectangular segmentation graph construction method
  • Edge orientation-based rectangular segmentation graph construction method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0065] The specific embodiments of the present invention will be further described below with reference to the accompanying drawings.

[0066] Among the existing methods of constructing map rectangle segmentation, the idea is to first extract the topological relationship of the map to form a plane graph G, and G is processed according to the duality principle to obtain a dualable graph G*, and the edges of G* can be oriented according to the rules. Regular edge labeling REL (Regular Edge Labeling), and then construct the rectangular dual graph of the plane graph G* by REL.

[0067] A rectangular dual graph of a planar graph G*=(V, E) is a rectangular partition system Φ that satisfies the following two conditions. (1) The rectangle in Ф and the points in G* have a one-to-one correspondence f:V←→Ф; (2) Only when the two vertices in G are connected, the corresponding vertex V in Ф Rectangles have common sides. Figure 1-a for the original map, Figure 1-b is the floor plan extr...

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 relates to a rectangular segmentation graph construction method based on edge orientation, and belongs to the technical field of data visualization. According to the method, the topological graph is directly extracted from the original map, and after the topological graph is preprocessed, rings with the degree smaller than 4 do not exist in the topological graph, so that the divisible topological graph is obtained; on the basis, orientation is carried out on each edge in the divisible topological graph by utilizing relative position constraint, and then an orientation graph with each ring being a rectangle is obtained; and finally, determining the coordinate of each point by using the connection state of each point in the orientation map so as to obtain a rectangular segmentation map. According to the method, an original map does not need to be converted into a PTP map, and the segmentable topological graph can be obtained by directly utilizing a preprocessing mode of setting a rule; and meanwhile, positioning and coordinate determination can be realized through simple iteration only according to the property of the rectangular graph. Therefore, the method is simple in implementation process, does not need extra complex calculation, and can automatically implement the construction of the rectangular segmented graph.

Description

technical field [0001] The invention relates to a method for constructing a rectangular segmentation graph based on edge orientation, and belongs to the technical field of data visualization. Background technique [0002] Rectangular Cartogram is a Cartogram in which each area is a rectangle. It is a novel representation method that facilitates the simultaneous recognition of quantity and topological relationships. It is widely used in population trend analysis, natural disaster prediction and other fields. The mainstream algorithms for rectangular Cartogram construction include construction algorithms based on rectangular segmentation and heuristic construction algorithms. Among them, the construction algorithm based on rectangular segmentation map has clear ideas and wide applicability, and has been widely used. A rectangular segmentation map is a rectangular segmentation system Ф of the rectangle R. Ф={R1, R2...Rn} is a rectangular set formed by dividing R without four-...

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 Applications(China)
IPC IPC(8): G06T7/11G06T7/70
CPCG06T7/11G06T7/70Y02A10/40
Inventor 贾奋励王维明宋国民杨剑陈令羽苏明占
Owner PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU
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