CN116071514B - Method, device and storage medium for automatically measuring building spacing - Google Patents
Method, device and storage medium for automatically measuring building spacing Download PDFInfo
- Publication number
- CN116071514B CN116071514B CN202310225911.3A CN202310225911A CN116071514B CN 116071514 B CN116071514 B CN 116071514B CN 202310225911 A CN202310225911 A CN 202310225911A CN 116071514 B CN116071514 B CN 116071514B
- Authority
- CN
- China
- Prior art keywords
- graph
- shortest distance
- coordinates
- building
- distance
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/05—Geographic models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/0002—Inspection of images, e.g. flaw detection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/60—Analysis of geometric attributes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/70—Determining position or orientation of objects or cameras
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/30—Subject of image; Context of image processing
- G06T2207/30204—Marker
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Software Systems (AREA)
- Remote Sensing (AREA)
- Computer Graphics (AREA)
- Quality & Reliability (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a method, a device and a storage medium for automatically measuring building space, which are used for acquiring a map model created by building plates based on actual proportion; obtaining a plurality of overlooking plane figures of building, road and building boundaries in the model according to the map model; determining the boundaries of each graph, and linearizing the boundaries; calculating the shortest distance from all vertexes forming the first graph to the second graph; calculating the shortest distance between all vertexes of the second graph and the first graph; comparing the two shortest distances, and taking a smaller value as the surface-to-surface shortest distance between the first graph and the second graph; acquiring final connection point coordinates corresponding to the shortest distance from the surface to the surface; the final connection point coordinates are connected and the distance values are indicated. The automatic marking distance between two target buildings is realized, manual participation in marking is not needed, a great amount of labor cost is saved, and errors existing in manual marking are reduced. The shortest building spacing is the minimum value, so that the user reference is improved.
Description
Technical Field
The invention belongs to the technical field of automatic measurement of building spacing, and particularly relates to a method, a device and a storage medium for automatic measurement of building spacing.
Background
The property belongs to a large amount of commodity transaction, and in the process of selling the house, house purchasers often need to conduct field or field observation so as to know the actual condition of the house. In the prior art, a house buyer or a house renter can enter a house to watch through an intermediary, a house owner or a developer, and can also watch pre-shot pictures and videos through an on-line APP and other internet platforms. However, when a house buyer purchases a house, he often looks at the house in the field in the daytime, and cannot know too much house living information, such as whether the house has environmental pollution, noise pollution intensity of the house, illumination intensity of the house, etc., when the house is observed. Most of these data require specialized sensors for detection and cannot be easily understood by the naked eye. In the prior art, the problems can not be solved no matter the house is seen on the spot or is seen on the internet through equipment such as a mobile phone and the like, and the house-purchasing platform in the prior art does not provide more information related to house livability for house purchasers. Further, when people select rooms on the internet platform, the platform often displays a large number of room sources for the users according to screening and the like of the users, and the users cannot know the suitability degree of the rooms according to remarked information on the room sources and can simply judge the house. Under the condition, people cannot directly know the house livability when buying the house, and the problem is easily caused after buying the house, so that the house is uncomfortable to live. In the invention with the patent number of CN202111328252.3, the evaluation information of the house is collected in various modes, the evaluation factors are calculated respectively for different evaluation information, and finally, the evaluation result is output according to the importance of influence, so that a house buyer or a user can intuitively know the house livability, grasp various defects and advantages of the house, and facilitate the house buyer to purchase the house.
However, in the house livability evaluation condition, the house spacing is one of the main evaluation factors, and the current house purchasing platform cannot provide corresponding house spacing information.
Disclosure of Invention
The invention aims to provide a method, a device and a storage medium for automatically measuring building spacing, which are used for solving the problems in the prior art.
In order to achieve the above purpose, the present invention adopts the following technical scheme:
a method for automatically measuring building spacing, which comprises the following steps,
acquiring a map model created by a building based on a real proportion; obtaining a plurality of overlooking plane figures of building, road and building boundaries in the model according to the map model;
determining the boundaries of each graph, and linearizing the boundaries;
calculating a first shortest distance from all vertexes forming a first graph to a second graph; the first graph is a graph corresponding to the target building; the second graph is a building or road near the first graph;
calculating a second shortest distance from all vertexes of the second graph to the first graph;
comparing the first shortest distance with the second shortest distance, and taking a smaller value as the surface-to-surface shortest distance between the first graph and the second graph; acquiring final connection point coordinates corresponding to the shortest distance from the surface to the surface;
the final connection point coordinates are connected and the distance values are indicated.
According to the technology, through the technical content, the building distance is calculated and generated from the acquired map model created based on the real proportion, the mark is marked, the comfort level of reference is separated, a renter or a house buyer can be given to see the building distance on line, in the calculation process, the graph boundary of two buildings is used, the surface-to-surface shortest distance is determined by the point-to-surface shortest distance, the point-to-surface shortest distance is the distance from the graph vertex of the target building to the edge of the graph interface of the building or the road to be detected, and the minimum distance is obtained by combining the distance from the vertex of the opposite graph interface of the building or the road to be detected to the edge of the graph interface of the target building; the shortest building distance is the minimum value, and the reference property is improved.
In one possible design, a method of calculating a first shortest distance from all vertices comprising a first graph to a second graph includes the steps of,
obtaining vertex coordinates of a first graph according to a preset sequence, wherein the vertex marks are as follows；
Acquiring coordinates of vertexes of a second graph according to a preset sequence, and sequentially acquiring coordinates of two adjacent points A and B of the second graph; is recorded as，
Calculating the side lengths of three sides of the triangle formed by the points P, A and B according to the coordinates;
judging the shortest distance value from the P point to the line segment AB line segment and the coordinates of two end points of the shortest distance composition line segment according to the side lengths of the three sides;
calculating the shortest distance value from all vertexes forming the first graph to the second graph, and collecting all results to obtain the minimum value; the minimum value is the first shortest distance from all vertexes of the first graph to the second graph;
acquiring coordinates of points where the endpoints are located when the shortest distance is obtained;
according to the mode, distances from all vertexes of the first graph to edge line segments of the second graph interface are calculated in sequence, and the shortest distance between two buildings is obtained by dividing the interface into the distances from the points to the line segments.
In one possible design, the method of calculating the three sides of the triangle formed by points P, A and B from coordinates is:
the PA distance is:，
PB distance is:，
the AB distance is:。
in one possible design, the method for judging the shortest distance value from the P point to the line segment AB and the coordinates of two end points of the shortest distance component line segment according to the side lengths of the three sides is as follows:
calculating the included angles formed by the edges PA, PB and AB according to the calculated three-edge length,
the angle PAB is of the size:，
the angle PBA size is:，
judging the shortest distance according to the included angle:
when the angle PAB is more than or equal to 90 degrees, the shortest distance from the P point to the AB line segment isThe endpoint coordinates are:，
when the angle PBA is more than or equal to 90 degrees, the shortest distance from the P point to the AB line segment isThe endpoint coordinates are:，
when the angle PAB and the angle PBA are smaller than 90 degrees, the shortest distance between the P line segment and the AB line segment is the vertical line distance;
the method for calculating the vertical line distance is as follows:
the area of triangle PAB is calculated according to the sea-land formula:
half perimeter:，
the area is:，
according to the triangle area formula, the height h from P to AB bottom edge is the vertical line distance:，
calculating endpoint coordinates: let P point to the perpendicular of AB beThe slope of the line where the vertical line is located is: />，
The coordinates of the end points that can be obtained from the calculated slope are:
。
in one possible design, the shortest distance values from all vertices that make up the first graph to the second graph are calculated, and all the result sets are minimized:and obtain the coordinates of the point where the endpoint is located at the shortest distanceThe value is the shortest distance value from all the vertices of the first graph to the second graphThe method comprises the steps of carrying out a first treatment on the surface of the The shortest distance between all the vertexes of the second graph and the first graph can be obtained in the same wayCoordinates of the vertical point where the shortest distance is located: />。。
In one possible design, taking a smaller value as a surface-to-surface shortest distance between a first graph and a second graph, and acquiring a final connection point coordinate corresponding to the surface-to-surface shortest distance;
when (when)</>When (1): the shortest distance is: />The connection end points are as follows: />；
When (when)</>When (1): shortest distance is：/>The connection end points are as follows: />。
In a second aspect, there is provided an electronic device comprising a memory and a processor, the memory and the processor being interconnected by a bus; the memory stores computer-executable instructions; the processor executes computer-executable instructions stored in the memory to cause the processor to perform the method for automatically measuring building spacing as described in the first aspect and any one of the possible designs of the first aspect.
In a third aspect, there is provided a storage medium having instructions stored thereon which, when executed on a computer, perform a method of automatically measuring building spacing as described in the first aspect and any one of the possible designs of the first aspect.
The beneficial effects are that: according to the technical content, building distances are calculated and generated from the obtained map model created based on the reality proportion, the map model is marked and shown, and reference comfort levels are separated, so that a renter or a house buyer can see building distances on line; the shortest building distance is the minimum value, and the reference property is improved.
The invention provides a method for automatically marking the distance between two target buildings, which does not need to participate in marking manually, saves a great deal of labor cost, reduces errors after a great deal of manual marking, and improves the generation efficiency.
Drawings
Fig. 1 is a flowchart of a method for automatically measuring a building spacing according to the first aspect of the present embodiment.
Detailed Description
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the present invention will be briefly described below with reference to the accompanying drawings and the description of the embodiments or the prior art, and it is obvious that the following description of the structure of the drawings is only some embodiments of the present invention, and other drawings can be obtained according to these drawings without inventive effort to a person skilled in the art. It should be noted that the description of these examples is for aiding in understanding the present invention, but is not intended to limit the present invention.
Examples:
as shown in fig. 1, a first aspect of the present embodiment provides a method for automatically measuring a building spacing, including the steps of,
obtaining a map model of a building; obtaining a plurality of overlooking plane figures of building, road and building boundaries in the model according to the map model;
determining the boundaries of each graph, and linearizing the boundaries;
calculating a first shortest distance from all vertexes forming a first graph to a second graph; the first graph is a graph corresponding to the target building; the second graph is a building or road near the first graph;
calculating a second shortest distance from all vertexes of the second graph to the first graph;
comparing the first shortest distance with the second shortest distance, and taking a smaller value as the surface-to-surface shortest distance between the first graph and the second graph; acquiring final connection point coordinates corresponding to the shortest distance from the surface to the surface;
connecting final connection point coordinates and marking distance values;
and determining the corresponding building space comfort level of the building according to the distance value.
Specifically, the shortest building distance algorithm is based on skchUp modeling, uses coordinate points forming a modeling graph as a data basis, and finally calculates the shortest distance between different buildings and line segment endpoint coordinates forming the shortest distance according to a necessary mathematical formula combination.
In one possible implementation, according to the above technique, the method of calculating the first shortest distance from all vertices constituting the first graph to the second graph comprises the steps of,
obtaining vertex coordinates of a first graph according to a preset sequence, wherein the vertex marks are as follows；
Acquiring coordinates of vertexes of a second graph according to a preset sequence, and sequentially acquiring coordinates of two adjacent points A and B of the second graph; is recorded as，
Calculating the side lengths of three sides of the triangle formed by the points P, A and B according to the coordinates;
judging the shortest distance value from the P point to the line segment AB line segment and the coordinates of two end points of the shortest distance composition line segment according to the side lengths of the three sides;
calculating the shortest distance value from all vertexes forming the first graph to the second graph, and collecting all results to obtain the minimum value; the minimum value is the first shortest distance from all vertexes of the first graph to the second graph;
and acquiring coordinates of points where the endpoints are located when the shortest distance is obtained.
According to the above technique, in one possible implementation, the method of calculating the three sides of the triangle formed by the points P, A and B from the coordinates is:
the PA distance is:，
PB distance is:，
the AB distance is:。
according to the above technology, in one possible implementation manner, the method for determining the shortest distance value from the P point to the line segment AB and the coordinates of two end points of the shortest distance component line segment according to the three edge lengths is:
calculating the included angles formed by the edges PA, PB and AB according to the calculated three-edge length,
the angle PAB is of the size:，
the angle PBA size is:，
judging the shortest distance according to the included angle:
when the angle PAB is more than or equal to 90 degrees, the shortest distance from the P point to the AB line segment isThe endpoint coordinates are:，
when the angle PBA is more than or equal to 90 degrees, the shortest distance from the P point to the AB line segment isThe endpoint coordinates are:，
when the angle PAB and the angle PBA are smaller than 90 degrees, the shortest distance between the P line segment and the AB line segment is the vertical line distance;
the method for calculating the vertical line distance is as follows:
the area of triangle PAB is calculated according to the sea-land formula:
half perimeter:，
the area is:，
according to the triangle area formula, the height h from P to AB bottom edge is the vertical line distance:，
calculating endpoint coordinates: let P point to the perpendicular of AB beThe slope of the line where the vertical line is located is: />，
The coordinates of the end points that can be obtained from the calculated slope are:
。
according to the above technique, in one possible implementation, the shortest distance values from all vertices constituting the first graph to the second graph are calculated, and all the results are collected to the minimum value:and acquires the coordinates +.>The shortest distance value from all the vertices of the first graph to the second graph is +.>The method comprises the steps of carrying out a first treatment on the surface of the The shortest distance between all the vertices of the second graph and the first graph can be obtained in the same way>Coordinates of the vertical point where the shortest distance is located: />。
According to the above technology, in one possible implementation manner, a smaller value is taken as the surface-to-surface shortest distance between the first graph and the second graph, and the final connection point coordinate corresponding to the surface-to-surface shortest distance is obtained;
when (when)</>When (1): the shortest distance is: />The connection end points are as follows: />；
When (when)</>When (1): the shortest distance is: />The connection end points are as follows: />。
In a second aspect, there is provided an electronic device comprising a memory and a processor, the memory and the processor being interconnected by a bus; the memory stores computer-executable instructions; the processor executes computer-executable instructions stored in the memory to cause the processor to perform the method for automatically measuring building spacing as described in the first aspect and any one of the possible designs of the first aspect. By way of specific example, the Memory may include, but is not limited to, random-Access Memory (RAM), read-Only Memory (ROM), flash Memory (Flash Memory), first-in first-out Memory (First Input First Output, FIFO), and/or first-in last-out Memory (First Input Last Output, FILO), etc.; the processor may not be limited to use with a processor of the type X86, internet series or other microprocessor; the transceiver may be, but is not limited to, a wired transceiver, a wireless fidelity (Wireless Fidelity, wiFi) wireless transceiver, a bluetooth wireless transceiver, a general packet radio service technology (General Packet Radio Service, GPRS) wireless transceiver, and/or a ZigBee wireless transceiver (low power local area network protocol based on the ieee802.15.4 standard), etc. The electronic device may also include, but is not limited to, a power module, a display screen, and other necessary components.
In a third aspect, there is provided a computer readable storage medium having instructions stored thereon which, when run on a computer, perform a method of automatically measuring building spacing as described in any one of the first aspect and the possible designs of the first aspect. The computer readable storage medium refers to a carrier for storing data, and may include, but is not limited to, a floppy disk, an optical disk, a hard disk, a flash Memory, and/or a Memory Stick (Memory Stick), etc., where the computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable devices.
The working process, working details and technical effects of the foregoing computer readable storage medium provided in the third aspect of the present embodiment may refer to the interaction method as described in the foregoing first aspect or any one of the possible designs of the first aspect, which are not repeated herein.
A fourth aspect of the present embodiments provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of building spacing automatic measurement as described in the first aspect or any one of the first aspects may be devised. Wherein the computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable devices.
Finally, it should be noted that: the foregoing description is only of the preferred embodiments of the invention and is not intended to limit the scope of the invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (7)
1. A method for automatically measuring building spacing is characterized by comprising the following steps,
acquiring a map model created by a building based on a real proportion;
obtaining a plurality of overlooking plane figures of building, road and building boundaries in the model according to the map model;
determining boundaries of each top-view plane graph, and linearizing the boundaries;
calculating the shortest distance between every two adjacent patterns: calculating a first shortest distance from all vertices constituting the boundary line of the first graph to the second graphThe method comprises the steps of carrying out a first treatment on the surface of the The first graph is a graph corresponding to the target building; the second graph is a graph of a building, a road or a cell boundary positioned near the first graph;
calculating a second shortest distance from all vertices of each of the second patterns to the first pattern；
Comparing the first shortest distance with the second shortest distance, and taking a smaller value as the surface-to-surface shortest distance between the first graph and the second graph;
acquiring final connection point coordinates corresponding to the shortest distance from the surface to the surface;
connecting final connection point coordinates and marking distance values;
the method of calculating the first shortest distance from all vertices constituting the first graph to the second graph comprises the steps of,
obtaining vertex coordinates of a first graph according to a preset sequence, wherein the vertex marks are as follows；
Acquiring coordinates of vertexes of the second graph according to a preset sequence, and sequentially acquiringCoordinates of two adjacent points A and B of the second graph; is recorded as，
Calculating the side lengths of three sides of the triangle formed by the points P, A and B according to the coordinates;
judging the shortest distance value from the P point to the line segment AB line segment and the coordinates of two end points of the shortest distance composition line segment according to the side lengths of the three sides;
calculating the shortest distance value from all vertexes forming the first graph to the second graph, and collecting all results to obtain the minimum value; the minimum value is the first shortest distance from all vertexes of the first graph to the second graph;
and acquiring coordinates of points where the endpoints are located when the shortest distance is obtained.
2. The method for automatically measuring the building spacing according to claim 1, wherein the method for calculating the three side lengths of the triangle formed by the points P, A and B according to coordinates is as follows:
the PA distance is:，
PB distance is:，
the AB distance is:。
3. the method for automatically measuring the building space according to claim 2, wherein the method for judging the shortest distance value from the P point to the line segment AB and the coordinates of two end points of the shortest distance component line segment according to the three edge lengths is as follows:
calculating the included angles formed by the edges PA, PB and AB according to the calculated three-edge length,
the angle PAB is of the size:，
the angle PBA size is:，
judging the shortest distance according to the included angle:
when the angle PAB is more than or equal to 90 degrees, the shortest distance from the P point to the AB line segment isThe endpoint coordinates are:，
when the angle PBA is more than or equal to 90 degrees, the shortest distance from the P point to the AB line segment isThe endpoint coordinates are:，
when the angle PAB and the angle PBA are smaller than 90 degrees, the shortest distance between the P line segment and the AB line segment is the vertical line distance;
the method for calculating the vertical line distance is as follows:
the area of triangle PAB is calculated according to the sea-land formula:
half perimeter:，
the area is:，
according to the triangle area formula, the height h from P to AB bottom edge is the vertical line distance:，
calculation ofEndpoint coordinates: let P point to the perpendicular of AB beThe slope of the line where the vertical line is located is:，
the coordinates of the end points that can be obtained from the calculated slope are:
。
4. the method for automatically measuring building spacing according to claim 1, wherein the shortest distance values from all vertices constituting the first graph to the second graph are calculated, and all result sets are minimized:and acquires the coordinates +.>The shortest distance value from all the vertices of the first graph to the second graph is +.>The method comprises the steps of carrying out a first treatment on the surface of the The shortest distance between all the vertices of the second graph and the first graph can be obtained in the same way>Coordinates of the vertical point where the shortest distance is located: />。
5. The method for automatically measuring building spacing according to claim 4, wherein a smaller value is taken as a face-to-face shortest distance between the first graph and the second graph, and final connection point coordinates corresponding to the face-to-face shortest distance are obtained;
when (when)< />When (1): the shortest distance is: />The connection end points are as follows: />；
When (when)< />When (1): the shortest distance is: />The connection end points are as follows: />。
6. The device for automatically measuring the building spacing is characterized by comprising a memory and a processor, wherein the memory and the processor are connected through a bus; the memory stores computer-executable instructions; the processor executing computer-executable instructions stored in a memory to cause the processor to perform the method for automatically measuring building spacing as claimed in any one of claims 1 to 5.
7. A storage medium having instructions stored thereon which, when executed on a computer, perform the method of automatic building spacing measurement of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310225911.3A CN116071514B (en) | 2023-03-10 | 2023-03-10 | Method, device and storage medium for automatically measuring building spacing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310225911.3A CN116071514B (en) | 2023-03-10 | 2023-03-10 | Method, device and storage medium for automatically measuring building spacing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116071514A CN116071514A (en) | 2023-05-05 |
| CN116071514B true CN116071514B (en) | 2023-08-04 |
Family
ID=86177015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310225911.3A Active CN116071514B (en) | 2023-03-10 | 2023-03-10 | Method, device and storage medium for automatically measuring building spacing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116071514B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110276124A (en) * | 2019-06-19 | 2019-09-24 | 国网上海市电力公司 | A kind of digitlization examines the information extracting method of mathematical model |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111177834B (en) * | 2019-12-27 | 2023-02-21 | 深圳集智数字科技有限公司 | Building automatic arrangement method, device, equipment and storage medium |
| CN111552429B (en) * | 2020-04-29 | 2021-07-23 | 杭州海康威视数字技术股份有限公司 | Graph selection method and device and electronic equipment |
| CN112164142B (en) * | 2020-10-21 | 2024-07-26 | 江苏科技大学 | Building lighting simulation method based on smart phone |
| CN113670240A (en) * | 2021-08-18 | 2021-11-19 | 中车青岛四方机车车辆股份有限公司 | System and method for acquiring size of measurement object and application |
| CN114282297A (en) * | 2021-12-28 | 2022-04-05 | 合肥量圳建筑科技有限公司 | Safe evacuation distance calculation method and system, readable storage medium and electronic equipment |
| CN114528625B (en) * | 2022-02-17 | 2024-10-18 | 深圳须弥云图空间科技有限公司 | Building space verification method and device |
-
2023
- 2023-03-10 CN CN202310225911.3A patent/CN116071514B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110276124A (en) * | 2019-06-19 | 2019-09-24 | 国网上海市电力公司 | A kind of digitlization examines the information extracting method of mathematical model |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116071514A (en) | 2023-05-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sanhudo et al. | Building information modeling for energy retrofitting–A review | |
| Machete et al. | The use of 3D GIS to analyse the influence of urban context on buildings’ solar energy potential | |
| CN107909541B (en) | Map conversion method and device | |
| Ariza-Villaverde et al. | Influence of urban morphology on total noise pollution: Multifractal description | |
| Samsonov et al. | Object-oriented approach to urban canyon analysis and its applications in meteorological modeling | |
| Hu et al. | Quantifying the shape of urban street trees and evaluating its influence on their aesthetic functions based on mobile lidar data | |
| KR101388448B1 (en) | A system and method for climate change impact assessment and economic costs calculation | |
| CN115937439B (en) | Method and device for constructing three-dimensional model of urban building and electronic equipment | |
| Mirzaee et al. | Neighborhood-scale sky view factor variations with building density and height: A simulation approach and case study of Boston | |
| CN115082699B (en) | Contour shape extraction method and device, electronic equipment and storage medium | |
| CN111986326B (en) | Construction method and device of pavement three-dimensional model, computer equipment and storage medium | |
| CN103389041B (en) | A kind of method of measuring grid line width | |
| CN112507444B (en) | AI-construction-based digital urban building night scene generation method and system | |
| Haithcoat et al. | Building footprint extraction and 3-D reconstruction from LIDAR data | |
| CN112365572A (en) | Rendering method based on tessellation and related product thereof | |
| CN115526924B (en) | Monte Carlo simulated hydrologic environment modeling method and system | |
| CA2749880A1 (en) | Geospatial modeling system for 3d clutter data and related methods | |
| CN116071514B (en) | Method, device and storage medium for automatically measuring building spacing | |
| CN112686945A (en) | Web-based three-dimensional terrain surface area measurement method | |
| CN115186347A (en) | Building CityGML modeling method combining house type plan and inclined model | |
| CN109241233B (en) | Coordinate matching method and device | |
| TWM540341U (en) | Green building performance simulation and analysis system | |
| CN115493657B (en) | Atmospheric pollution tracing method and device based on unmanned aerial vehicle | |
| CN114037792B (en) | Method for dynamically generating million-magnitude underground pipeline model under Unreal Engine platform | |
| CN103175491A (en) | Tree measuring method and tree measuring system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Lu Zucheng Inventor after: Xie Kunlin Inventor after: Wang Xiaohui Inventor before: Han Zhengqi Inventor before: Lu Zucheng Inventor before: Xie Kunlin Inventor before: Wang Xiaohui |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |