Method and system for calculating point-to-point shortest path in plane in building

A technology for computing planes and shortest paths, applied in computing, special data processing applications, data processing applications, etc., can solve problems that cannot be calculated, technology cannot be supplemented and corrected, and the starting point/target point cannot be considered

Pending Publication Date: 2020-10-23
刘竞翔
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, libraries such as pyvisgraph, which are often used in geographic information systems (GIS), are not fully applicable to the situations faced in construction. For example, the situation where there is an outer contour cannot be considered, or the situation where the starting point / target point is on an arbitrary contour cannot be considered. Therefore, it cannot be directly used in the calculation of the shortest path from point to point in the building
[0006] In summary, the problems in the prior art are: (1) there is no software to solve this core problem in the existing construction industry, but there is an algorithm close to satisfying this need in the computer industry
This algorithm refers to pyvisgraph (an open source Python library), but it cannot calculate the existence of outer contours, and when the starting point / target point is on any contour, it will lead to calculation errors
However, existing technologies cannot be supplemented and amended
[0007] (2) In the current industry, when conducting building compliance audits, the point-to-point shortest path calculation in the plane is manually operated, which consumes a lot of time and human resources
[0008] (3) Autodesk's Revit2020 product fails to calculate the real shortest path, and only finds the path in the grid by gridding the building space to obtain an approximate shortest path
[0009] (4) pyvisgraph is not aimed at architectural graphic design, and cannot be calculated for the case where there is an outer contour, or when the starting point / target point is on an arbitrary contour.

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
  • Method and system for calculating point-to-point shortest path in plane in building
  • Method and system for calculating point-to-point shortest path in plane in building
  • Method and system for calculating point-to-point shortest path in plane in building

Examples

Experimental program
Comparison scheme
Effect test

example

[0141] For each polygon:

[0142] M = number of points in the polygon

[0143] For i=0, i

[0144] Let the i-th point be P1, and the (i+1)%M point be P2, generate Edge (P1, P2) and add this Edge to Graph.

[0145] 2.3 Calculate the visibility graph (Visibility Graph):

[0146] Based on the existing graph, an initialized visibility graph is established. Specifically, by using the visible point algorithm (described in detail later), find out other points that each point in the graph can see, and add the edge formed by each point and its corresponding visible point to the visibility diagram, thus completing the basic visibility diagram.

[0147] Specifically include:

[0148] Input: Graph

[0149] Output: Visibility Graph

[0150] Create a copy based on the current graph (Graph), that is, the initialized visibility graph (Visibility Graph)

[0151] For each point Point in Graph:

[0152] Calculate all the visible points of the point in the graph, using the Visibl...

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 belongs to the technical field of related data processing in a building plane, and discloses a method and system for calculating a point-to-point shortest path in a plane in a building.The method comprises the steps: abstracting a plane space into a point Point, an edge Edge, a polygon Polygon and a graph Graph which can be operated by a computer; calculating a visibility graph Visibilities Graph of the initial graph Graph by using a visibility point algorithm; for a point to be calculated, adding an additional visible edge (Advanced Visible Edge) into the Visible Graph (Graph)of the visibility graph; and a Dijkstra algorithm is used to find the shortest path. In the shortest path calculation provided by the invention, the calculated shortest path is a real shortest path; compared with the prior art, the accuracy is greatly improved.

Description

technical field [0001] The invention belongs to the technical field of related data processing in building planes, and in particular relates to a method and system for calculating the shortest path from any point to a point in a building plane. Background technique [0002] There are a large number of projects in the construction industry every year, and almost all projects need to consider the compliance with building regulations. Currently, this work is performed manually. From the architect's own design process, to the internal review of the design unit, to the government's approval, building regulations must be considered in every link, which consumes a lot of time and human resources. [0003] In fact, building compliance audits can be automated to a certain extent by computer programming. In this process, there is a core problem that must be solved, that is, the calculation of the shortest path (and the length of the path) from point to point in the plane. A large n...

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): G06Q10/04G06F30/13
CPCG06Q10/047G06F30/13
Inventor 刘竞翔
Owner 刘竞翔
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products