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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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