CN116029858A - Equal-volume equivalent land dividing method - Google Patents
Equal-volume equivalent land dividing method Download PDFInfo
- Publication number
- CN116029858A CN116029858A CN202310170807.9A CN202310170807A CN116029858A CN 116029858 A CN116029858 A CN 116029858A CN 202310170807 A CN202310170807 A CN 202310170807A CN 116029858 A CN116029858 A CN 116029858A
- Authority
- CN
- China
- Prior art keywords
- land
- triangle
- value
- point
- dividing
- 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.)
- Pending
Links
Images
Landscapes
- Image Generation (AREA)
Abstract
The invention relates to a land dividing method with equal volume and equivalence, which comprises the steps of 1) extracting land block range according to the current state of land utilization, and 2) calculating the total value of the divided land block; step 3) obtaining the value VA of each part to be divided according to the designated total land parcel dividing quantity M; etc. The invention establishes a new method for dividing the land with equal volume and equivalent by taking the land price factors into consideration on the basis of dividing the land with equal area. 2. According to the invention, the land price factor is incorporated into the land dividing method for calculation, so that rights and interests of rights and people are ensured as much as possible, and balanced division is realized.
Description
Technical Field
The invention belongs to the technical field of land partition methods, and particularly relates to the technical field of an equal-volume equivalent land partition method.
Background
Real estate (land, above-ground buildings and attachments, etc.) may be subjected to repartition by the right man when divided. It is common practice to manually divide by natural topography or specified boundaries through internal negotiations. In the prior art, the area is basically the only consideration factor, but the land is different in application, for example, a good land and a gravel land with the same area have different values, so that land price factors are considered again when land is divided, and balanced division is needed. To meet this need, the present invention provides an equal volume equivalent land dividing method.
Disclosure of Invention
The invention aims to solve the defects, and provides a land dividing method with equal volume and equivalent.
The invention is realized by adopting the following technical scheme.
A method of equally volumetric land partitioning, the method comprising the steps of:
step 1) extracting land block range according to the present situation of land use, dividing the land block range into a plurality of land blocks A according to land classification 1 ,A 2 … … An; price factor P added as land block according to land classification by land price system 1 ,P 2 … …, pn in units of: meta/square meter;
step 2) calculating the total value of the divided land
Step 3) obtaining the value VA of each part to be divided according to the designated total land parcel dividing quantity M; va=vs++m;
step 4) dividing each land block into triangles by using an ear cutting method;
step 5) traversing all triangles from a certain azimuth angle of the whole land parcel, recording the adjacent side triangles of each triangle, and traversing for multiple times until all the triangles are incorporated into a traversing tree;
step 6) calculating the area Si, the value Vi=area×price unit price and the number of leaf nodes of all plots in the traversal tree;
step 7), searching a triangle with the minimum absolute value of the difference between Vi and VA in the triangle with the leaf node as one as a reference triangle;
step 8) setting a current value v=0;
step 9) finding the reference triangle A jak After that, there are three cases where the Vi value is less than, greater than or equal to the VA value;
vi is smaller than VA, continuing to traverse downwards;
vi is larger than VA, and the current triangle is intercepted;
vi is greater than VA, exit traversal.
Further, the method of the invention comprises the following steps: v is smaller than VA;
1) Obtaining a current value V=V+Vi and a difference DeltaV=VA-V;
2) And obtaining adjacent triangle leaf nodes which enter the traversal sequence graph recently, obtaining the value quantity of the adjacent triangle leaf nodes, adding the adjacent triangle leaf nodes according to the leaf node with the minimum absolute value of the difference between the Vj and the DeltaV, and recalculating the DeltaV (DeltaV=DeltaV-Vj) and the V=V+Vj until the DeltaV is a negative value or zero after adding one leaf node.
Further, the method of the invention comprises the following steps: v is greater than VA;
1) Obtaining a current value V=V+Vi and a difference value DeltaV=VA-V, wherein the difference value takes an absolute value;
2) Cutting a triangle meeting the conditions from the traversal sequence to be used as the last graph of the cutting of the round; acquiring the last graph A in the traversal sequence man And a common edge with the previous pattern in the sequence is obtained.
3) The method comprises the steps of obtaining the length L of a shared edge, and calculating the height of a cut triangle by using a triangle area formula in combination with the unit land price Pi of the local block land class;
area of cut triangle: Δs=Δv/Pi;
height of the cut triangle: h=2×Δs/L;
4) Acquiring the number of triangles related to the end points on two sides of the shared edge, taking the end points related to fewer triangles, marking the end points as a point P, and marking the end points on the other side as a point Q; obtaining the last graph A in the traversal sequence man The angle of the end point is marked as < alpha >, and if the < alpha is < P11P9P8. If the angle alpha is an obtuse angle, taking the remaining angle of the angle alpha to be 180 degrees;
5) Calculating a value h' =h×sin α using a sinusoidal formula; if α is a right angle, h' =h.
6) On the other side of the passing point P, a point with the length h 'from the P point is obtained and is marked as P';
7) Connecting the point Q and the point P ', wherein the point P, the point Q and the point P' form a new triangle;
8) The last graph in the traversal sequence is removed, and a newly constructed triangle is added.
Further, the method of the invention comprises the following steps: v is equal to VA;
1) Storing the current traversal sequence to finish one-time land parcel cutting;
2) And judging whether the number of uncut parts is one. If yes, combining all the divided plots to finish the cutting of the plots; if not, correcting the traversing tree of the rest land parcels, and entering the next traversing.
The method has the beneficial effects that 1, the land price factors are taken into consideration on the basis of dividing the equal area of the land, and a new equal-volume equivalent land dividing method is established. 2. According to the invention, the land price factor is incorporated into the land dividing method for calculation, so that rights and interests of rights and people are ensured as much as possible, and balanced division is realized.
The invention is further explained below with reference to the drawings and the detailed description.
Drawings
Fig. 1 is a schematic view of the present invention related to the "ear cutting method" for dividing each land block into triangular structures.
FIG. 2 is a schematic diagram of a partial traversal architecture of an exemplary plot of the present invention.
FIG. 3 is a two-pass diagram of the present invention.
Fig. 4 is a schematic diagram of two or three alpha calculations in the case of the present invention.
Fig. 5 is a block diagram of the steps of the present invention.
Detailed Description
See fig. 1, 2, 3, 4 and 5.
A method of equally volumetric land partitioning, the method comprising the steps of:
(1) Before land is divided, the land block range is extracted according to the current state of land use, and the land block range is represented as a plurality of land blocks A according to land classification (from the third national land investigation work classification, 69 types in total) 1 ,A 2 … … An, price factor P added as land block by land classification in the county (city, district) land price system 1 ,P 2 … …, pn (units: yuan/square meter).
(2) The total value of the divided land block can be calculated
(3) According to the designated total land parcel dividing number M, obtaining a value quantity VA of each parcel to be divided;
VA＝Vs÷M
(4) Each plot is divided into triangles using "ear cutting" as shown in FIG. 1, A 1 Cut into A 1a1 、A 1a2 、A 1a3 、A 1a4 、A 1a5 、A 1a6 We then get several triangles with price factors;
(5) Traversing all triangles from southwest corners of the whole land block, recording adjacent side triangles of each triangle, namely, each triangle has three adjacent triangles at most to form a similar thinking guide graph structure, recording every time traversing to leaf nodes (traversing the nodes to only record and not traversing downwards) until all triangles are traversed (if the original land block is not adjacent, a plurality of traversing trees exist);
such as: a is that 1a1 Adjacent triangle is A 1a2 、A 2a2 、A 3a3 ；
A 1a6 Adjacent triangle is A 1a5 ；
The partial traversal structure of an exemplary plot is as in fig. 2:
because the plots can be in non-adjacent condition, all triangle plot numbers must be recorded before traversing, after traversing is completed, whether omission exists is searched, if so, the plot at the southwest corner is searched again in the omitted triangle, and multiple rounds of traversing are started until all triangles are included in the traversing tree.
(6) The area Si, the value Vi (=area×price unit price), and the number of leaf nodes (the number of neighboring triangles) of all plots are calculated in the traversal tree.
(7) And searching a triangle with the minimum absolute value of the difference between Vi and VA from the triangle with the leaf node as one as a reference triangle.
First, the triangles whose leaf nodes are one are searched because they are all located on the block boundary, and searching in this way can keep the original boundary line of the block as much as possible.
As can be seen from the traversing tree, A 1a6 、A 3a1 Is a triangle with leaf nodes of one.
(8) The current value quantity v=0 is set.
(9) Find the reference triangle A jak After that, there are three cases where the Vi value is less than, greater than or equal to the VA value.
Vi is smaller than VA, continuing to traverse downwards;
vi is larger than VA, and the current triangle is intercepted;
vi is greater than VA, exit traversal.
(10) The detailed operation is as follows:
[1] case one: v is smaller than VA
1) Obtaining a current value V=V+Vi and a difference DeltaV=VA-V;
2) Obtaining adjacent triangle leaf nodes (which do not enter a sequence) of the latest traversal sequence graph, obtaining the value quantity of the adjacent triangle leaf nodes, adding the adjacent triangle leaf nodes according to the leaf node with the smallest absolute value of the difference between Vj and DeltaV, recalculating DeltaV (DeltaV=DeltaV-Vj) and V=V+Vj when each leaf node is added until DeltaV is a negative value or zero, and processing according to a second condition if the value quantity V is larger than VA; if the value V at this time is equal to VA, then the process is treated as "case three".
[2] And a second case: v is greater than VA
1) Obtaining a current value V=V+Vi and a difference value DeltaV=VA-V, wherein the difference value takes an absolute value;
2) From the traversal sequence, the eligible triangle is cut as the last graph of the current round of cuts. Acquiring the last graph A in the traversal sequence man And a common edge with the previous pattern in the sequence is obtained. For example, traversing the last graphic A in the sequence 2a3 The previous figure is A 1a4 Their common edge is P9P11;
3) The triangle area formula is used to calculate the height of the cut triangle from the acquired common edge length L, such as length LP9P11 of P9P11, in combination with the local block class unit land price Pi.
a) Area of cut triangle: Δs=Δv/Pi;
b) Height of the cut triangle: h=2×Δs/L;
4) The number of triangles related to the endpoints on two sides of the common edge is obtained, the endpoint related to fewer triangles is taken and is marked as a point P, and the endpoint on the other side is marked as a point Q. For example A 2a3 In the above, the end point P9 of the common edge LP9P11 refers to three triangles, and P11 refers to six triangles, so that the end point P9 is taken, and the point p=the end point P9. Obtaining the last graph A in the traversal sequence man The angle of the end point is marked as < alpha >, and if the < alpha is < P11P9P8. If the angle alpha is an obtuse angle, taking the remaining angle of the angle alpha to be 180 degrees;
5) Using a sinusoidal formula, the value h' =h×sin α is calculated. If α is a right angle, h' =h;
6) On the other side of the passing point P, a point with the length h 'from the P point is obtained and is marked as P';
7) Connecting the point Q and the point P ', wherein the point P, the point Q and the point P' form a new triangle;
8) Removing the last graph in the traversal sequence, and adding a newly constructed triangle;
9) Enter "case three".
[3] And a third case: v is equal to VA
1) Storing the current traversal sequence to finish one-time land parcel cutting;
2) And judging whether the number of uncut parts is one. If yes, combining all the divided plots to finish the cutting of the plots; if not, correcting the traversing tree of the rest land parcels, and entering the next traversing.
What has been described above is only a part of the specific embodiments of the present invention (since the technical solution of the present invention involves real estate, privacy-related content is hidden), and the specific content or common sense known in the solution is not described herein too much (including but not limited to shorthand, abbreviations, units commonly used in the art). It should be noted that the above embodiments do not limit the present invention in any way, and it is within the scope of the present invention for those skilled in the art to obtain the technical solution by equivalent substitution or equivalent transformation. The protection scope of the present application shall be subject to the content of the claims, and the description of the specific embodiments and the like in the specification can be used for explaining the content of the claims.
Claims (6)
1. An equal-volume equivalent land dividing method, characterized in that the method comprises the following steps:
step 1) extracting land block range according to the present situation of land use, dividing the land block range into a plurality of land blocks A according to land classification 1 ,A 2 … … An; price factor P added as land block according to land classification by land price system 1 ,P 2 … …, pn in units of: meta/square meter;
step 2) calculating the total value of the divided land
Step 3) obtaining the value VA of each part to be divided according to the designated total land parcel dividing quantity M; va=vs++m;
step 4) dividing each land block into triangles by using an ear cutting method;
step 5) traversing all triangles from a certain azimuth angle of the whole land parcel, recording the adjacent side triangles of each triangle, and traversing for multiple times until all the triangles are incorporated into a traversing tree;
step 6) calculating the area Si, the value Vi=area×price unit price and the number of leaf nodes of all plots in the traversal tree;
step 7), searching a triangle with the minimum absolute value of the difference between Vi and VA in the triangle with the leaf node as one as a reference triangle;
step 8) setting a current value v=0;
step 9) finding the reference triangle A jak After that, there are three cases where the Vi value is less than, greater than or equal to the VA value; vi is smaller than VA, continuing to traverse downwards;
vi is larger than VA, and the current triangle is intercepted;
vi is greater than VA, exit traversal.
2. The equal volume equivalent land dividing method as claimed in claim 1, wherein said method comprises the steps of: v is smaller than VA
a) Obtaining a current value V=V+Vi and a difference DeltaV=VA-V;
b) And obtaining adjacent triangle leaf nodes which enter the traversal sequence graph recently, obtaining the value quantity of the adjacent triangle leaf nodes, adding the adjacent triangle leaf nodes according to the leaf node with the minimum absolute value of the difference between the Vj and the DeltaV, and recalculating the DeltaV (DeltaV=DeltaV-Vj) and the V=V+Vj until the DeltaV is a negative value or zero after adding one leaf node.
3. The equal volume equivalent land dividing method as claimed in claim 1, wherein said method comprises the steps of: v is greater than VA
a) Obtaining a current value V=V+Vi and a difference value DeltaV=VA-V, wherein the difference value takes an absolute value;
b) Cutting a triangle meeting the conditions from the traversal sequence to be used as the last graph of the cutting of the round;
c) The method comprises the steps of obtaining the length L of a shared edge, and calculating the height of a cut triangle by using a triangle area formula in combination with the unit land price Pi of the local block land class;
area of cut triangle: Δs=Δv/Pi;
height of the cut triangle: h=2×Δs/L;
d) Acquiring the number of triangles related to the end points on two sides of the shared edge, taking the end points related to fewer triangles, marking the end points as a point P, and marking the end points on the other side as a point Q; obtaining the last graph A in the traversal sequence man The angle of the end point is marked as < alpha >, and if the < alpha is < P11P9P8. If the angle alpha is an obtuse angle, taking the remaining angle of the angle alpha to be 180 degrees;
e) Calculating a value h' =h×sin α using a sinusoidal formula;
f) On the other side of the passing point P, a point with the length h 'from the P point is obtained and is marked as P';
g) Connecting the point Q and the point P ', wherein the point P, the point Q and the point P' form a new triangle;
h) The last graph in the traversal sequence is removed, and a newly constructed triangle is added.
4. The equal volume equivalent land dividing method as claimed in claim 1, wherein said method comprises the steps of: v is equal to VA
a) Storing the current traversal sequence to finish one-time land parcel cutting;
b) And judging whether the number of uncut parts is one. If yes, combining all the divided plots to finish the cutting of the plots; if not, correcting the traversing tree of the rest land parcels, and entering the next traversing.
5. A method of equally volumetric-equivalent land dividing according to claim 3, wherein said step b) comprises: acquiring the last graph A in the traversal sequence man And a common edge with the previous pattern in the sequence is obtained.
6. A method of equally volumetric-equivalent land dividing according to claim 3, wherein said step e) comprises: if α is a right angle, h' =h.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310170807.9A CN116029858A (en) | 2023-02-27 | 2023-02-27 | Equal-volume equivalent land dividing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310170807.9A CN116029858A (en) | 2023-02-27 | 2023-02-27 | Equal-volume equivalent land dividing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116029858A true CN116029858A (en) | 2023-04-28 |
Family
ID=86091501
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310170807.9A Pending CN116029858A (en) | 2023-02-27 | 2023-02-27 | Equal-volume equivalent land dividing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116029858A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5774124A (en) * | 1994-11-07 | 1998-06-30 | International Business Machines Corporation | Finite element modeling method and computer system for converting a triangular mesh surface to a quadrilateral mesh surface |
| CN1910587A (en) * | 2004-01-16 | 2007-02-07 | M·B·加扎利 | A method for subdividing a housing land and the resulting housing subdivision |
| CN103473465A (en) * | 2013-09-17 | 2013-12-25 | 武汉大学 | Method for optimizing spatial layout of land resources based on multi-target artificial immunization system |
| CN107705310A (en) * | 2017-09-13 | 2018-02-16 | 北京建筑大学 | A kind of plot dividing method and system |
| CN114170385A (en) * | 2021-12-10 | 2022-03-11 | 北京优锘科技有限公司 | Method, apparatus, medium, and device for generating a mesh with holes in a model profile in real time |
| CN114398715A (en) * | 2021-12-02 | 2022-04-26 | 中国西安卫星测控中心 | Reentry return spacecraft dispersion area calculation method based on spherical vector |
-
2023
- 2023-02-27 CN CN202310170807.9A patent/CN116029858A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5774124A (en) * | 1994-11-07 | 1998-06-30 | International Business Machines Corporation | Finite element modeling method and computer system for converting a triangular mesh surface to a quadrilateral mesh surface |
| CN1910587A (en) * | 2004-01-16 | 2007-02-07 | M·B·加扎利 | A method for subdividing a housing land and the resulting housing subdivision |
| CN103473465A (en) * | 2013-09-17 | 2013-12-25 | 武汉大学 | Method for optimizing spatial layout of land resources based on multi-target artificial immunization system |
| CN107705310A (en) * | 2017-09-13 | 2018-02-16 | 北京建筑大学 | A kind of plot dividing method and system |
| CN114398715A (en) * | 2021-12-02 | 2022-04-26 | 中国西安卫星测控中心 | Reentry return spacecraft dispersion area calculation method based on spherical vector |
| CN114170385A (en) * | 2021-12-10 | 2022-03-11 | 北京优锘科技有限公司 | Method, apparatus, medium, and device for generating a mesh with holes in a model profile in real time |
Non-Patent Citations (1)
| Title |
|---|
| 梁其洋;吴保国;赵春江;潘瑜春;胡萌;郝星耀;: "基于德劳内三角化和二分查找法的土地自动分配方法", 农业工程学报, no. 04, 23 February 2018 (2018-02-23) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109934120B (en) | A step-by-step point cloud noise removal method based on spatial density and clustering | |
| CN111598915A (en) | Point cloud single wood segmentation method, device, equipment and computer readable medium | |
| Robinson | The accuracy of digital elevation models derived from digitised contour data | |
| Copas | On the unimodality of the likelihood for the Cauchy distribution | |
| CN112017288B (en) | A DEM synthesis and simplification method based on topographic map data | |
| CN117788174B (en) | Financial user data security protection method based on blockchain | |
| Martins et al. | Percolation on two-and three-dimensional lattices | |
| CN115797256A (en) | Method and device for processing information of structural surface of tunnel rock mass based on unmanned aerial vehicle | |
| CN116029858A (en) | Equal-volume equivalent land dividing method | |
| CN110032939A (en) | A kind of remote sensing time series data approximating method based on gauss hybrid models | |
| CN107357858B (en) | A Location-Based Network Reconstruction Method | |
| Theodoridis et al. | Direction relations and two-dimensional range queries: optimisation techniques | |
| Midtbo | Spatial modelling by Delaunay networks of two and three dimensions | |
| CN114463338B (en) | Automatic building laser foot point extraction method based on graph cutting and post-processing | |
| CN106153507B (en) | A kind of method of mini-frac proppant sphericity | |
| Ballesteros et al. | Zonation patterns in tideless environments (Northwestern Mediterranean): looking for discontinuities in species distributions | |
| CN108536647A (en) | Method for searching land parcel four-to-four by adopting boundary points and 45-degree external rectangle | |
| REISS | Experience with height interpolation by finite elements | |
| CN114511572A (en) | Single tree segmentation flow method for forest tree measurement | |
| CN114090959B (en) | Random space-time interpolation method for runoff of river basin under constraint of river network structure | |
| CN115131526A (en) | Automatic comprehensive drawing method and system | |
| CN113535747B (en) | Map updating method and device, electronic equipment and readable storage medium | |
| Wang et al. | Geodesics-based topographical feature extraction from airborne LIDAR data for disaster management | |
| CN110619134A (en) | Integrated detection and restoration method for solving problem of flying spot and spot density of road network data | |
| CN115436369B (en) | A method and system for identifying atmospheric rivers based on domestic hyperspectral satellites |
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 |