An electronic fence non-connected block clipping method and system

Abstract

The application discloses an electronic fence non-connected block clipping method and system, wherein the method comprises the following steps: acquiring a first electronic fence range and a second electronic fence range; taking the intersection of the first electronic fence range and the second electronic fence range, so as to clip off the fence blocks in the second electronic fence range that exceed the first fence range, and obtain a plurality of non-connected closed fence blocks; using a Turf.js framework to arrange the plurality of closed fence blocks, so that the plurality of non-connected closed fence blocks only exist one largest-area electronic fence in the first electronic fence range; and acquiring the coordinates of the largest-area closed fence block. The scheme of the application can realize automatic interception function without manual intervention, thereby reducing the workload of business personnel.

Description

Technical Field

[0001] This invention generally relates to the field of electronic map technology. More specifically, this invention relates to a method and system for cropping discontinuous blocks in an electronic fence. Background Technology

[0002] Because the third-party platform requires that the fence not exceed 5km from the center of the store, it is necessary to find the intersection of the service provider's own fence and the 5km circle to trim off the fenced area that exceeds the 5km range.

[0003] After trimming, the merged fence may form multiple closed, independent small blocks within the same area, making it impossible to synchronize the fence to the third-party platform. This is because the third-party platform considers only one closed fence block allowed within a fence; if multiple blocks exist, the data will be considered invalid. Figure 1 As indicated by the arrow. If the cut fence forms multiple independent blocks, the smaller blocks are deleted using a front-end algorithm, while the larger fence blocks are retained, ultimately meeting the data requirements of all three parties and updating the delivery fence.

[0004] When business personnel are merging delivery areas for multiple stores, the third-party platform requires that the fence for each store cannot exceed a 5km radius centered on the store's address. If this limit is exceeded, the fenced area needs to be truncated. However, the truncated fenced area often contains multiple non-contiguous closed blocks. When the fence is synchronized to the third-party platform, the platform returns "incompatible data," preventing the synchronization of subsequent fence data. The current technical solution calculates whether the merged and truncated fence data contains multiple closed blocks. If multiple closed, non-adjacent blocks exist, they are first split, and smaller blocks are deleted, while larger blocks are retained, ensuring that store delivery data can be correctly synchronized to the third-party platform.

[0005] The existing technical solution has the following problems: 1. Changes to the delivery-side fence may prevent automatic synchronization to third parties after the fence is captured. 2. Manual processing by business personnel is required to delete the problematic block and then manually trigger the fence synchronization. Summary of the Invention

[0006] To at least address the technical problems described in the background section, this invention proposes a method and system for trimming disconnected blocks in electronic fences. Utilizing the solution of this invention, the accuracy of reconstructing the actual vehicle travel path is improved when ETC gantry information is missing. Therefore, this invention provides solutions in the following aspects.

[0007] A first aspect of the present invention provides a method for trimming disconnected blocks in an electronic fence, comprising: obtaining a first electronic fence range and a second electronic fence range; taking the intersection of the first electronic fence range and the second electronic fence range to trim fence blocks in the second electronic fence range that extend beyond the first fence range, thereby obtaining multiple disconnected closed fence blocks; using the Turf.js framework to organize the multiple closed fence blocks so that only one closed fence block with the largest area exists within the first electronic fence range; and obtaining the coordinates of the closed fence block with the largest area.

[0008] In one embodiment, the process of organizing the closed fence block using the Turf.js framework includes: calculating multiple intersection points of the closed fence block itself; forming multiple lines from each pair of intersection points, and calculating a line from these lines that does not intersect the closed fence block graphic as a reference line; trimming the closed fence block with the reference line to obtain multiple different trimmed blocks; calculating the trimmed block with the largest area from the multiple different trimmed blocks; merging the trimmed blocks that intersect with the trimmed block with the largest area together to obtain the electronic fence with the largest area; and clearing the non-intersecting trimmed blocks.

[0009] In one embodiment, the Turf.js framework is used to organize the closed fence block, including: applying the kinks function of the Turf.js framework to calculate multiple intersection points of the closed fence block itself; forming multiple lines from each pair of intersection points, and applying the booleanDisjoint function of the Turf.js framework to calculate a line from the multiple lines that does not intersect the closed fence block graphic as a reference line; applying the difference function of the Turf.js framework to trim the reference line and the closed fence block to obtain multiple different trimmed blocks; applying the area function of the Turf.js framework to calculate the trimmed block with the largest area from the multiple different trimmed blocks; merging the trimmed blocks that intersect with the trimmed block with the largest area together to obtain the electronic fence with the largest area; and clearing the non-intersecting trimmed blocks.

[0010] In one embodiment, the first electronic fence range is an electronic fence range defined according to preset rules.

[0011] In one embodiment, the second electronic fence range is an inherent electronic fence range defined according to business conditions.

[0012] A second aspect of the present invention provides a system for trimming disconnected electronic fence blocks, comprising: an acquisition module for acquiring a first electronic fence range and a second electronic fence range; a trimming module for taking the intersection of the first and second electronic fence ranges to trim fence blocks in the second electronic fence range that extend beyond the first fence range, thereby obtaining multiple disconnected closed fence blocks; an organization module for organizing the multiple closed fence blocks using the Turf.js framework, so that only one closed fence block with the largest area exists within the first electronic fence range; and a synchronization module for acquiring the coordinates of the closed fence block with the largest area.

[0013] In one embodiment, the process of organizing the closed fence block using the Turf.js framework includes: calculating multiple intersection points of the closed fence block itself; forming multiple lines from each pair of intersection points, and calculating a line from these lines that does not intersect the closed fence block graphic as a reference line; trimming the closed fence block with the reference line to obtain multiple different trimmed blocks; calculating the trimmed block with the largest area from the multiple different trimmed blocks; merging the trimmed blocks that intersect with the trimmed block with the largest area together to obtain the electronic fence with the largest area; and clearing the non-intersecting trimmed blocks.

[0014] In one embodiment, the Turf.js framework is used to organize the closed fence block, including: applying the kinks function of the Turf.js framework to calculate multiple intersection points of the closed fence block itself; forming multiple lines from each pair of intersection points, and applying the booleanDisjoint function of the Turf.js framework to calculate a line from the multiple lines that does not intersect the closed fence block graphic as a reference line; applying the difference function of the Turf.js framework to trim the reference line and the closed fence block to obtain multiple different trimmed blocks; applying the area function of the Turf.js framework to calculate the trimmed block with the largest area from the multiple different trimmed blocks; merging the trimmed blocks that intersect with the trimmed block with the largest area together to obtain the electronic fence with the largest area; and clearing the non-intersecting trimmed blocks.

[0015] In one embodiment, the first electronic fence range is an electronic fence range defined according to preset rules.

[0016] In one embodiment, the second electronic fence range is an inherent electronic fence range defined according to business conditions.

[0017] The solution provided by this invention uses an algorithm to determine whether merging captured fences results in multiple non-adjacent blocks. These non-adjacent blocks are then segmented, their areas calculated, and the largest block is retained and automatically synchronized to all three parties. This invention fully considers automatic capture functionality, eliminating the need for manual intervention and reducing the workload of business personnel. Attached Figure Description

[0018] The above and other objects, features, and advantages of exemplary embodiments of the present invention will become readily apparent upon reading the following detailed description with reference to the accompanying drawings. In the drawings, several embodiments of the invention are illustrated by way of example and not limitation, and like or corresponding reference numerals denote like or corresponding parts, wherein:

[0019] Figure 1 This illustrates a method for trimming disconnected blocks of an electronic fence according to an embodiment of the present invention;

[0020] Figure 2 This illustrates a method for organizing blocks using the turf.js framework according to an embodiment of the present invention;

[0021] Figure 3 This illustrates a block trimming process according to an embodiment of the present invention;

[0022] Figure 4 This illustrates a second block trimming process according to an embodiment of the present invention;

[0023] Figure 5 This illustrates the block trimming process according to an embodiment of the present invention;

[0024] Figure 6 This illustrates the block trimming process according to an embodiment of the present invention;

[0025] Figure 7 This illustrates the block trimming process according to an embodiment of the present invention;

[0026] Figure 8 This illustrates the block trimming process according to an embodiment of the present invention;

[0027] Figure 9 This illustrates an electronic fence non-connected block trimming system according to an embodiment of the present invention. Detailed Implementation

[0028] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, and not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0029] It should be understood that the terms "first," "second," "third," and "fourth," etc., in the claims, specification, and drawings of this invention are used to distinguish different objects, rather than to describe a specific order. The terms "comprising" and "including" used in the specification and claims of this invention indicate the presence of the described features, integrals, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, integrals, steps, operations, elements, components, and / or collections thereof.

[0030] It should also be understood that the terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the invention. As used in this specification and claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used in this specification and claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes such combinations.

[0031] As used in this specification and claims, the term "if" may be interpreted, depending on the context, as "when," "once," "in response to determination," or "in response to detection." Similarly, the phrase "if determined" or "if [described condition or event] is detected" may be interpreted, depending on the context, as "once determined," "in response to determination," "once [described condition or event] is detected," or "in response to detection of [described condition or event]."

[0032] The specific embodiments of the present invention will now be described in detail with reference to the accompanying drawings.

[0033] A first aspect of the present invention provides a method for trimming disjoint blocks in an electronic fence. For example... Figure 1 The diagram illustrates a method for trimming disjoint blocks according to an embodiment of the present invention. This method can be summarized as including steps S100-S400:

[0034] Step S100: Obtain the range of the first electronic fence and the range of the second electronic fence;

[0035] Step S200: Take the intersection of the first electronic fence range and the second electronic fence range to cut off the fence blocks in the second electronic fence range that exceed the first fence range, and obtain multiple unconnected closed fence blocks.

[0036] Step S300: Use the Turf.js framework to organize the multiple closed fence blocks so that only one electronic fence with the largest area exists within the range of the first electronic fence among the multiple unconnected closed fence blocks.

[0037] Step S400: Obtain the coordinates of the electronic fence with the largest area.

[0038] In one embodiment of the present invention, the first electronic fence range is an electronic fence range defined according to preset rules; the second electronic fence range is an inherent electronic fence range defined according to business conditions.

[0039] In a preferred embodiment of the present invention, the first electronic fence range is a range defined by a third-party platform, such as a food delivery platform, according to preset rules, such as... Figure 3 As shown, the first electronic fence range is a circular area with a radius of 5km centered on the target store; the second electronic fence range is the business scope of the supplier platform itself, such as... Figure 3 The irregular fence area in the upper left corner is an irregular fence area centered on the target store and within the scope of the business.

[0040] Because third-party platforms require that fences not exceed a 5km radius from the store center, and only one closed fence block is allowed within a single fence area; multiple closed fence blocks are considered invalid. When suppliers need to expand their business to third-party platforms, they need to find the intersection between the third-party platform's defined electronic fence range and their own fence to trim fence blocks exceeding the platform's limits. However, after trimming, the merged fence may result in multiple closed, independent small blocks within the same area, for example... Figure 3 In addition to the large block in the upper left corner, there are also smaller blocks indicated by arrows. Because they do not comply with the regulations of the third-party platform, the fence coordinates cannot be synchronized to the third-party platform.

[0041] It is understood that the first electronic fence scope is not limited to what is defined by a third-party platform, but can also be defined according to one's own needs; the second electronic fence scope is not limited to the inherent electronic fence scope defined by business circumstances, but can also be an electronic fence scope generated by other means. Any situation involving the trimming of two electronic fences to create multiple disjoint blocks should be included within the protection scope of this invention.

[0042] The Turf.js library used in the above steps is a spatial geometry calculation library developed by Mapbox, commonly used for geometric relationship analysis within geospatial areas, and boasts powerful functionality. However, Turf.js currently does not provide a method for clipping disjoint blocks appearing in electronic fences. Although Turf.js offers various methods for determining the positional relationships of points, lines, and polygons, and based on these, it cannot effectively solve the problem of clipping disjoint blocks in practical applications. Therefore, this invention implements a disjoint block clipping function that meets business requirements based on Turf.

[0043] In one embodiment of the present invention, the following steps are implemented using the Turf.js framework to complete the trimming of disjoint blocks:

[0044] Calculate multiple intersection points of the closed fence block itself;

[0045] The multiple intersection points are paired to form multiple lines, and a line that does not intersect the closed fence block graphic is calculated from the multiple lines as a reference line.

[0046] The reference line and the closed fence block are cut to obtain multiple different cut blocks;

[0047] Calculate the largest area of ​​the cropping block from the plurality of different cropping blocks; merge the cropping blocks that intersect with the largest area of ​​the cropping block together to obtain the electronic fence with the largest area; and clear the non-intersecting cropping blocks.

[0048] In a preferred embodiment of the present invention, such as Figure 2 The diagram illustrates a method for organizing blocks using Turf.js according to an embodiment of the present invention. This method can be summarized as including steps S301-S304:

[0049] Step S301: Use the kinks function of the turf.js framework to calculate multiple intersection points of the closed fence block itself;

[0050] Step S302: Combine the multiple intersection points into multiple lines, and use the booleanDisjoint function of the turf.js framework to calculate a line from the multiple lines that does not intersect the closed fence block graphic as a reference line;

[0051] Step S303: Use the difference function of the turf.js framework to clip the reference line and the closed fence block to obtain multiple different clipped blocks;

[0052] Step S304: Apply the area function of the turf.js framework to calculate the largest clipping block from the multiple different clipping blocks; merge the clipping blocks that intersect with the largest area clipping block together to obtain the electronic fence with the largest area; clear the non-intersecting clipping blocks.

[0053] Specifically, such as Figure 4 As shown, by intersecting the first and second electronic fence ranges as described above, two non-contiguous closed fence blocks are obtained. Figure 4 The large closed fence area in the lower left corner and the small closed fence area in the upper right corner are not connected. It should be noted that... Figure 4 Although a line appears between the lower left and upper right blocks, this line is not required. It's caused by jumping from point 22 (overlapping with point 27) to point 23 (overlapping with point 26) after point 22 was drawn. To meet the data requirements of all three parties and update the delivery fence, it's necessary to delete smaller fence blocks from the multiple independent closed fence blocks formed by the cut fences, retaining the larger fence blocks. The specific method is as follows:

[0054] The first step is to use the "kinks" method of the turf.js framework to find the set of intersection points of the blocks themselves. For example... Figure 5 As shown, the intersection points of blocks are calculated using the kinks function of the turf.js framework. The intersection points of each block itself are shown as multiple arrow markers in the diagram.

[0055] The second step is to pair these intersection points together to form lines, and then use the booleanDisjoint function to calculate a line that does not intersect the existing block graph at all. For example... Figure 6 The lines obtained from the calculation (indicated by the arrows) are non-intersecting lines. It's important to note that this calculation actually generates two non-intersecting lines: one between coordinates 0 and 2, and another between coordinates 1 and 3. Only one of these two lines needs to be randomly selected.

[0056] The third step involves using the difference function to trim the two unconnected closed fence blocks obtained from the intersection of the line acquired in the second step with the first and second electronic fence ranges, resulting in multiple different blocks. For example... Figure 7 As shown, two non-adjacent blocks were separated.

[0057] The fourth step is to Figure 7The two non-adjacent blocks obtained are used to calculate the block with the largest area using the area function. If other blocks are cut off by the cutting line, the blocks adjacent to the block with the largest area are merged together. Finally, the non-adjacent blocks are removed. The blocks obtained after this process are as follows: Figure 8 As shown. Obtained Figure 8 The coordinates of the large blocks can then be pushed to third-party platforms.

[0058] Furthermore, the usage of the kinks, boolean Disjoint, difference, and area functions of the turf.js framework used in the above steps is as follows:

[0059] 1. The kinks function: used to obtain lines, multilines, polygons, or polygons and return all points where they intersect.

[0060] Its parameters, types, and descriptions are as follows:

[0061] featureInFeature<(LineString|MultiLineString|MultiPolygon|Polygon)>inputfeature

[0062] Here are some examples of how the kinks function can be used:

[0063] varpoly = turf.polygon([[

[0064] [-12.034835, 8.901183],

[0065] [-12.060413,8.899826],

[0066] [-12.03638, 8.873199],

[0067] [-12.059383,8.871418],

[0068] [-12.034835, 8.901183] ]]);

[0070] varkinks=turf.kinks(poly);

[0071] / / addToMap

[0072] var addToMap = [poly, kinks]

[0073] ReturnsFeatureCollection<point>self-intersections

[0074] 2. BooleanDisjoint function: Returns TRUE if the intersection of two geometric figures is an empty set.

[0075] The parameters, types, and descriptions of the BooleanDisjoint function are as follows:

[0076] feature1(Geometry|Feature <any>)GeoJSONFeatureorGeometryfeature2(Geometry|Feature <any>The following is an example of how the GeoJSONFeatureorGeometryBooleanDisjoint function can be used:

[0077] varpoint=turf.point([2,2]);

[0078] varline=turf.lineString([[1,1],[1,2],[1,3],[1,4]]);

[0079] turf.booleanDisjoint(line,point);

[0080] / / =true

[0081] 3. Difference function: used to calculate the part that belongs to face 1 but not face 2.

[0082] The parameters, types, and descriptions of the difference function are as follows:

[0083] polygon1Feature<(Polygon, MultiPolygon)>inputPolygon feature

[0084] polygon2Feature<(Polygon, MultiPolygon)>Polygonfeaturetodifferencefrompolygon1

[0085] Here are some examples of how the difference function can be used:

[0086] varpolygon1 = turf.polygon([[

[0087] [128,-26],

[0088] [141,-26],

[0089] [141,-21],

[0090] [128,-21],

[0091] [128, -26]

[0092] ]],{

[0093] "fill":"#F00",

[0094] "fill-opacity": 0.1

[0095] });

[0096] varpolygon2 = turf.polygon([[

[0097] [126,-28],

[0098] [140,-28],

[0099] [140,-20],

[0100] [126,-20],

[0101] [126, -28]

[0102] ]],{

[0103] "fill":"#00F",

[0104] "fill-opacity": 0.1

[0105] });

[0106] vardifference=turf.difference(polygon1,polygon2);

[0107] IV. The area function: used to retrieve one or more features and return their area in square meters.

[0108] The parameters, types, and descriptions of the area function are as follows:

[0109] geojsonGeoJSONinputGeoJSONfeature(s)

[0110] Here are some examples of how the area function can be used:

[0111] varpolygon = turf.polygon([[

[0112] [108.09876,37.200787], / / Note: The coordinates of the first and last polygons must be consistent.

[0113] [106.398901,33.648651],

[0114] [114.972103,33.340483],

[0115] [113.715685,37.845557],

[0116] [108.09876,37.200787] ]]);

[0118] vararea=turf.area(polygon).

[0119] It is understood that the kinks, booleanDisjoint, difference, and area functions of the turf.js framework used in the above methods are merely examples. Any method that can achieve the function functionality through the turf.js framework should be included within the scope of protection of this invention.

[0120] based on Figures 1-8 The second aspect of the present invention also provides a system for trimming discontinuous blocks of an electronic fence, as described in the method for trimming discontinuous blocks of an electronic fence; this system can be implemented. Figure 1 Figures 1-8 The described method enables effective trimming of electronic fences; such as Figure 9 As shown, the electronic fence non-connected block trimming system of the present invention includes:

[0121] Module 100 acquires the range of the first electronic fence and the range of the second electronic fence.

[0122] The trimming module 200 takes the intersection of the first electronic fence range and the second electronic fence range to trim the fence blocks in the second electronic fence range that exceed the first fence range, thereby obtaining multiple unconnected closed fence blocks.

[0123] The sorting module 300 uses the Turf.js framework to sort out the multiple closed fence blocks so that only one electronic fence with the largest area exists within the range of the first electronic fence.

[0124] Synchronization module 400 obtains the coordinates of the electronic fence with the largest area.

[0125] In one embodiment, the process of organizing the closed fence block using the Turf.js framework includes: calculating multiple intersection points of the closed fence block itself; forming multiple lines from each pair of intersection points, and calculating a line from these lines that does not intersect the closed fence block graphic as a reference line; trimming the closed fence block with the reference line to obtain multiple different trimmed blocks; calculating the trimmed block with the largest area from the multiple different trimmed blocks; merging the trimmed blocks that intersect with the trimmed block with the largest area together to obtain the electronic fence with the largest area; and clearing the non-intersecting trimmed blocks.

[0126] In one embodiment, the Turf.js framework is used to organize the closed fence block, including: applying the kinks function of the Turf.js framework to calculate multiple intersection points of the closed fence block itself; forming multiple lines from each pair of intersection points, and applying the booleanDisjoint function of the Turf.js framework to calculate a line from the multiple lines that does not intersect the closed fence block graphic as a reference line; applying the difference function of the Turf.js framework to trim the reference line and the closed fence block to obtain multiple different trimmed blocks; applying the area function of the Turf.js framework to calculate the trimmed block with the largest area from the multiple different trimmed blocks; merging the trimmed blocks that intersect with the trimmed block with the largest area together to obtain the electronic fence with the largest area; and clearing the non-intersecting trimmed blocks.

[0127] In one embodiment, the first electronic fence range is an electronic fence range defined according to preset rules.

[0128] In one embodiment, the second electronic fence range is an inherent electronic fence range defined according to business conditions.

[0129] While various embodiments of the invention have been shown and described herein, it will be apparent to those skilled in the art that such embodiments are provided by way of example only. Many modifications, alterations, and alternatives will occur to those skilled in the art without departing from the spirit and intent of the invention. It should be understood that various alternatives to the embodiments of the invention described herein may be employed in the practice of the invention. The appended claims are intended to define the scope of protection of the invention and therefore cover modular compositions, equivalents, or alternatives within the scope of these claims.< / any> < / any> < / point>

Claims

1. A method for cutting non-connected blocks in an electronic fence, characterized in that, include: Obtain the range of the first electronic fence and the range of the second electronic fence; The intersection of the first and second electronic fence ranges is used to cut off fence blocks in the second electronic fence range that extend beyond the first electronic fence range, resulting in multiple unconnected closed fence blocks. The Turf.js framework is used to organize the multiple closed fence blocks so that only one electronic fence with the largest area exists within the range of the first electronic fence. Obtain the coordinates of the electronic fence with the largest area; The process of organizing the closed fenced area using the Turf.js framework includes: Calculate multiple intersection points of the closed fence block itself; The multiple intersection points are paired to form multiple lines, and a line that does not intersect the closed fence block graphic is calculated from the multiple lines as a reference line. The closed fence block is cut using the reference line to obtain multiple different cut blocks; Calculate the largest area of ​​the cropping block from the plurality of different cropping blocks; merge the cropping blocks that intersect with the largest area of ​​the cropping block together to obtain the electronic fence with the largest area; and clear the non-intersecting cropping blocks.

2. The method for cutting off non-connected blocks in an electronic fence according to claim 1, characterized in that, The process of organizing the closed fenced area using the Turf.js framework specifically includes: The kinks function of the turf.js framework is used to calculate multiple intersection points of the closed fence block itself; The multiple intersection points are paired to form multiple lines, and the boolean Disjoint function of the turf.js framework is used to calculate a line from the multiple lines that does not intersect the closed fence block graphic at all, as a reference line. The difference function of the turf.js framework is used to clip the closed fence block using the reference line to obtain multiple different clipped blocks; The `area` function of the `turf.js` framework is used to calculate the largest clipping block from the multiple different clipping blocks; clipping blocks that intersect with the largest area clipping block are merged together to obtain the electronic fence with the largest area; and non-intersecting clipping blocks are cleared.

3. The method for cutting non-connected blocks in an electronic fence according to claim 2, characterized in that, The first electronic fence range is the electronic fence range defined according to preset rules.

4. The method for cutting off non-connected blocks of an electronic fence according to claim 2 or 3, characterized in that, The second electronic fence range is the inherent electronic fence range defined according to business conditions.

5. A system for trimming discontinuous blocks in an electronic fence, characterized in that, include: The acquisition module acquires the range of the first electronic fence and the range of the second electronic fence. The trimming module takes the intersection of the first electronic fence range and the second electronic fence range to trim the fence blocks in the second electronic fence range that exceed the first electronic fence range, thereby obtaining multiple unconnected closed fence blocks. The organization module uses the Turf.js framework to organize multiple closed fence blocks so that only one electronic fence with the largest area exists within the range of the first electronic fence. The synchronization module obtains the coordinates of the electronic fence with the largest area. The process of organizing the closed fenced area using the Turf.js framework includes: Calculate multiple intersection points of the closed fence block itself; The multiple intersection points are paired to form multiple lines, and a line that does not intersect the closed fence block graphic is calculated from the multiple lines as a reference line. The closed fence block is cut using the reference line to obtain multiple different cut blocks; Calculate the largest area of ​​the cropping block from the plurality of different cropping blocks; merge the cropping blocks that intersect with the largest area of ​​the cropping block together to obtain the electronic fence with the largest area; and clear the non-intersecting cropping blocks.

6. The electronic fence non-connected block trimming system according to claim 5, characterized in that, The process of organizing the closed fenced area using the Turf.js framework specifically includes: The kinks function of the turf.js framework is used to calculate multiple intersection points of the closed fence block itself; The multiple intersection points are paired to form multiple lines, and the boolean Disjoint function of the turf.js framework is used to calculate a line from the multiple lines that does not intersect the closed fence block graphic at all, as a reference line. The difference function of the turf.js framework is used to clip the closed fence block using the reference line to obtain multiple different clipped blocks; The `area` function of the `turf.js` framework is used to calculate the largest clipping block from the multiple different clipping blocks; clipping blocks that intersect with the largest area clipping block are merged together to obtain the electronic fence with the largest area; and non-intersecting clipping blocks are cleared.

7. The electronic fence non-connected block trimming system according to claim 5, characterized in that, The first electronic fence range is the electronic fence range defined according to preset rules.

8. The electronic fence non-connected block trimming system according to claim 5 or 6, characterized in that, The second electronic fence range is the inherent electronic fence range defined according to business conditions.

Images