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

Generation algorithm of least independent closed loops and shortest annexed lines for leveling network

A technology that generates algorithms and closed loops, applied in computing, special data processing applications, instruments, etc., can solve the problems of heavy measurement workload, unguaranteed quality, high cost, etc., and achieves fast running speed, clear algorithm ideas, and improved efficiency. Effect

Inactive Publication Date: 2015-04-29
国家测绘地理信息局大地测量数据处理中心
View PDF2 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] In view of the above-mentioned defects and problems of the leveling network in the prior art that the leveling workload is very large, the quality cannot be guaranteed and the cost is high, the purpose of the embodiment of the present invention is to provide a better independent minimum closed loop of the leveling network, the shortest combined Line generation algorithm, the idea is simple and clear, easy to implement, the result is accurate and reliable, the operation cycle can be shortened, a large amount of manual work is no longer required, and the cost is greatly reduced

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
  • Generation algorithm of least independent closed loops and shortest annexed lines for leveling network
  • Generation algorithm of least independent closed loops and shortest annexed lines for leveling network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0033] 1 Graph theory analysis of leveling network

[0034] The endpoints at both ends of the horizontal route are called nodes, and the other intermediate points of the horizontal route are called transition points.

[0035] The essence of a graph is a two-dimensional matrix, so turning the leveling network into a "graph" means turning it into a "matrix", and the matrix is ​​stored in the form of an array in the computer, so the leveling route needs to be stored in a two-dimensional array .

[0036] Before the route is matrixed, it is necessary to perform preliminary inspection and processing on the route, distinguish different routes with the same nodes at both ends and the same accumulation distance, and add a value to the route distance to ensure different routes with the same nodes at both ends The distance is different, so that the node and the distance can uniquely represent a route. Note that the route does not distinguish the direction, that is, the route from the st...

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 provides a generation algorithm of least independent closed loops and shortest annexed lines for a leveling network. The algorithm includes the step of using ends of each leveling line as nodal points and other middle points as transitional points; storing the leveling lines in a two-dimensional array; distinguishing the different lines identical in nodal point and cumulative-sum distance; uniformly numbering nodal points of the leveling network; dividing the lines into independent connected sub-networks according to the nodal point adjacency feature, searching the sub-networks for the least independent closed loops and the shortest annexed lines; adjusting the directions of the closed loops to ensure that all loops of the leveling network are clockwise or anticlockwise. Compared with the traditional techniques, the algorithm has the advantages that the structure is simple, an algorithm idea is clear, a program developed on the basis of the algorithm runs fast, the closed loops are ensured being least, the annexed lines are ensured being shortest, the closed loops and the annexed lines are mutually independent and complete, closure conditions are omission free and non-redundant, the closed loops are all uniformly clockwise or anticlockwise, efficiency is improved, cost is saved, and synergy is achieved.

Description

technical field [0001] The invention relates to the technical field of geodetic leveling data processing, in particular to an algorithm for generating an independent minimum closed loop and shortest cohesive line of a leveling network. Background technique [0002] Leveling is a method of measuring the height difference between two points on the ground with a level and a leveling rod, using the sea level as a benchmark to measure the elevation of an object. It is the main method of elevation measurement, used to establish the national leveling network, monitor the vertical movement of the crust and the land subsidence caused by human causes, and establish the elevation control network required for engineering measurement. [0003] With the development of social economy and the advancement of science and technology, the requirements are getting higher and higher. Due to the instrument error, observation error and external influence in the leveling survey, there are inevitably...

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): G06F19/00
Inventor 王斌刘晓芸赵大江张世娟
Owner 国家测绘地理信息局大地测量数据处理中心
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