CN112765304A - Automatic completion method and device for polyline boundary scatter points and related equipment - Google Patents
Automatic completion method and device for polyline boundary scatter points and related equipment Download PDFInfo
- Publication number
- CN112765304A CN112765304A CN202110364748.XA CN202110364748A CN112765304A CN 112765304 A CN112765304 A CN 112765304A CN 202110364748 A CN202110364748 A CN 202110364748A CN 112765304 A CN112765304 A CN 112765304A
- Authority
- CN
- China
- Prior art keywords
- points
- scattered
- grid
- scatter
- grids
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
- G06F16/215—Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Remote Sensing (AREA)
- Image Analysis (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses an automatic completion method for polyline boundary scattered points, which is applied to the technical field of region division and is used for solving the technical problem of low efficiency of delineating region boundaries through completion of missing scattered points. The method provided by the invention comprises the following steps: acquiring coordinates of four scattered points with the maximum longitude value, the minimum longitude value, the maximum latitude value and the minimum latitude value in a polyline boundary scattered point set, and generating a corresponding rectangular area according to the coordinates of the four scattered points; dividing the rectangular area into a plurality of grids with the same size along the horizontal direction and the vertical direction respectively according to preset grid step lengths; identifying breakpoints in the polyline boundary scattered point set according to the state that each scattered point in the polyline boundary scattered point set falls into the grid; judging whether scattered points exist between the adjacent break points; when the scattered point does not exist between two adjacent break points, determining a break point line segment for connecting the two corresponding adjacent break points; and supplementing a scatter point on the acquired breakpoint line segment at each interval of the grid step length.
Description
Technical Field
The invention relates to the technical field of process optimization, in particular to an automatic completion method and device for polyline boundary scatter points, computer equipment and a storage medium.
In a solution of a related scenario of LBS (Location Based Services), it is often necessary to define a zone boundary, for example, when determining Location information of a certain cell, the zone boundary of the cell needs to be defined.
In the prior art, a method for delineating a boundary of an area generally calls an Application Programming Interface (API) of a map service provider such as a gold, a hundredth, and the like, sends a name of a search area as a parameter, and requests to return a polyline of the area, where the polyline represents a group of longitude and latitude scatter gather of the boundary of the area. When the border data of the front end region is incompletely displayed due to missing of the returned polyline set scattered point data, the existing solution is to introduce the region border longitude and latitude scattered point set into a geo visualization tool such as mapInfo and the like, locate two adjacent broken points through artificial naked eyes, manually determine the broken points of the region through a user, and complement the missing scattered point data by using the visualization tool.
Obviously, the method for completing missing scattered point data by manually determining the region break points through the user and combining the visualization tool depends on manual intervention and a completion tool, and the efficiency of delineating the region boundary through completing the missing scattered points is low.
Disclosure of Invention
The embodiment of the invention provides an automatic completion method and device for polyline boundary scatter points, computer equipment and a storage medium, and aims to solve the technical problem of low efficiency of delineating a region boundary through completion of missing scatter points.
A method for automatically completing polyline boundary scatter points, which comprises the following steps:
acquiring coordinates of four scattered points with the maximum longitude value, the minimum longitude value, the maximum latitude value and the minimum latitude value in a polyline boundary scattered point set, and generating a corresponding rectangular area according to the coordinates of the four scattered points;
dividing the rectangular area into a plurality of grids with the same size along the horizontal direction and the vertical direction respectively according to preset grid step lengths;
identifying grids in which the polyline boundary scatter points fall;
when the continuous grids with the polyline boundary scattered points are spaced by empty grids, judging the polyline boundary scattered points in the corresponding grids as break points;
judging whether at least one polyline boundary scatter exists between the adjacent breakpoints;
when the polyline boundary scatter does not exist between two adjacent breakpoint, acquiring a breakpoint line segment for connecting the two adjacent breakpoint;
and adding a scatter point at intervals of the grid step length on the obtained breakpoint line segment as a supplement of the missing scatter point.
An automatic completion apparatus for polyline boundary scatter, the apparatus comprising:
the rectangular region generation module is used for acquiring coordinates of four scattered points with the maximum longitude value, the minimum longitude value, the maximum latitude value and the minimum latitude value in the polyline boundary scattered point set and generating a corresponding rectangular region according to the coordinates of the four scattered points;
the grid division module is used for dividing the rectangular area into a plurality of grids with the same size along the horizontal direction and the vertical direction according to preset grid step length;
the identification module is used for identifying grids in which polyline boundary scatter points fall;
a breakpoint judgment module, configured to judge polyline boundary scatter points in a corresponding grid as breakpoints when empty grids are spaced between consecutive grids in which the polyline boundary scatter points fall;
the judgment module is used for judging whether at least one polyline boundary scatter point exists between the adjacent break points;
the line segment determining module is used for acquiring a breakpoint line segment for connecting two adjacent breakpoint points when the polyline boundary scatter point does not exist between the two adjacent breakpoint points;
and the scatter point supplementing module is used for adding a scatter point at intervals of the grid step length on the obtained breakpoint line segment as supplement of the missing scatter point.
A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the steps of the above method for automatic completion of polyline boundary scatterings when executing the computer program.
A computer-readable storage medium, which stores a computer program that, when executed by a processor, implements the steps of the above-described method for automatic completion of polyline boundary scatterings.
The application provides an automatic completion method, a device, computer equipment and a storage medium for polyline boundary scattered points, which comprises the steps of firstly obtaining coordinates of the most marginal scattered points in a polyline boundary scattered point set in east, south, west and north directions, generating a corresponding rectangular area according to the coordinates of the most marginal scattered points, then dividing the rectangular area into a plurality of grids with the same size along horizontal direction and vertical direction respectively according to preset grid step length, then identifying breakpoints in the polyline boundary scattered point set according to the state that each scattered point in the polyline boundary scattered point set falls into the grids, judging whether the scattered points exist between adjacent broken points, determining a line segment for connecting the corresponding broken points between the two adjacent broken points when the scattered points do not exist between the two adjacent broken points, and adding a scattered point at each interval of the grid step length on the obtained line segment as the supplement of missing scattered point data, the identification process and the supplement position determination process of the whole missing scattered point can be automatically realized through computer instructions, the manual naked eye positioning and labeling of the breakpoint in the polyline boundary scattered point set are not needed, the scattered point supplement is not needed to be carried out through leading-in to other scattered point supplement tools, the efficiency of delineating the region boundary through supplementing the missing scattered point is improved, the automatic supplement of the missing scattered point is realized, and the manual dependence and the tool dependence are reduced.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.
Fig. 1 is a schematic diagram of an application environment of an automatic completion method for polyline boundary scatter in an embodiment of the present invention.
FIG. 2 is a flowchart of a method for automatically completing polyline boundary scatter according to an embodiment of the present invention.
Fig. 3 is a flowchart illustrating an implementation of step S104 in fig. 2 according to an embodiment of the present invention.
Fig. 4 is a flowchart illustrating an implementation of step S105 in fig. 2 according to an embodiment of the present invention.
FIG. 5 is a schematic diagram of generating a rectangular region according to the coordinates of the edgemost scatter point in an embodiment of the present invention.
Fig. 6 is a schematic diagram of dividing the rectangular area in fig. 5 into a plurality of grids with the same size according to an embodiment of the present invention.
Fig. 7 is a schematic diagram of determining a breakpoint line segment for connecting between two corresponding adjacent breakpoints according to an embodiment of the present invention.
FIG. 8 is a schematic diagram of supplementing missing scatter in an embodiment of the present invention.
Fig. 9 is a schematic structural diagram of an automatic completion apparatus for polyline boundary scatter in an embodiment of the present invention.
FIG. 10 is a schematic diagram of a computer device according to an embodiment of the invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The method for automatically completing polyline boundary scatter points provided by the application can be applied to the computer device shown in fig. 1, wherein the computer device is communicated with the server through a network. The computer device includes, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices. The server may be implemented as a stand-alone server or as a server cluster consisting of a plurality of servers.
In one embodiment, as shown in fig. 2, an automatic completion method for polyline boundary scatter is provided, which is described by taking the computer apparatus in fig. 1 as an example, and includes the following steps S101 to S107.
S101, obtaining coordinates of four scattered points with the maximum longitude value, the minimum longitude value, the maximum latitude value and the minimum latitude value in the polyline boundary scattered point set, and generating a corresponding rectangular area according to the coordinates of the four scattered points.
It will be appreciated that polyline represents a software tool that can derive the boundaries of the scatter plot from its distribution. The "polyline boundary scatter gather" can be directly obtained by this tool. A polyline boundary scatter set may be understood as a boundary scatter set enclosing all scatters, which polyline boundary scatter set belongs to a polyline scatter set.
When a border of a certain area needs to be circled, an Interface call request can be sent to an Application Programming Interface (API) of a map service provider such as the university and the hundredth, the name of the search area is sent as a parameter, and the request is returned to a polyline border scatter point set of the area, so that the polyline border scatter point set can be obtained.
According to one scenario, for a checked area boundary, the boundary defined by a polyline boundary scatter set of the area returned by a map service provider is generally complete and does not need to be completed, but for a newly divided area, such as a newly-built cell, a school, and the like, due to the fact that the boundary check is not passed, a polyline boundary scatter is absent. In other scenarios, for example, the network state is unstable, which also causes the problem that the local end receives an incomplete polyline boundary scatter set.
It can be appreciated that generating a corresponding rectangular region from the coordinates of the edgemost blob encompasses all blobs in the polyline boundary blob set. In one embodiment, generating the corresponding rectangular area according to the coordinates of the edge-most scatter point is shown in FIG. 5. Two vertical lines can be made to respectively penetrate through an east coordinate point and a west coordinate point to be vertical to the south coordinate point and the north coordinate point, and similarly, two horizontal lines can be made to respectively penetrate through the south coordinate point and the north coordinate point to be vertical to the east coordinate point and the west coordinate point to form a rectangular area by gathering scattered points.
And S102, dividing the rectangular area into a plurality of grids with the same size along the horizontal direction and the vertical direction respectively according to preset grid step lengths.
Because the polyline boundary scattered points returned by map services such as Goodpasture, Baidu and the like are geographical longitude and latitude information, when the scattered points are judged to fall into which grid, in order to facilitate the execution of subsequent steps and reduce the calculation amount, the longitude and latitude of the scattered points can be mapped onto a coordinate system, and the longitude and latitude values are replaced by the coordinates on the coordinate system for calculation.
It is to be understood that a latitude direction may be determined as the horizontal direction, and a longitude direction may be determined as the vertical direction.
In one embodiment, before the step of dividing the rectangular area into a plurality of grids with the same size in the horizontal direction and the vertical direction according to a preset grid step size, the method further includes:
creating a coordinate system;
mapping a latitude coordinate of the polyline boundary scatter point on an x-axis of the coordinate system, mapping a longitude coordinate of the polyline boundary scatter point on a y-axis of the coordinate system, and mapping each scatter point in the polyline boundary scatter point set in the coordinate system.
It will be appreciated that the trellis step size represents the length and width of the partitioned multiple equal-sized trellis. In one embodiment, the length and width of the plurality of grids of the same size are the same.
In one embodiment, as shown in fig. 6, a schematic diagram of dividing the rectangular region into a plurality of grids with the same size along the x-axis direction and the y-axis direction is shown, and a coordinate point (min _ lat, min _ lng), (max _ lat, max _ lng) can be obtained by taking a lower left corner (southwest) and an upper right corner (northeast) of the rectangular region, defining a square grid step length div, dividing the grid according to the div by taking the lower left corner as a start node, decomposing the whole rectangle into a ndarray grid matrix, marking each grid, and marking the number of polyline boundary scatter points inside the grid (greater than or equal to 0).
S103, identifying the grids in which the polyline boundary scatter points fall.
In one embodiment, the grid into which a specific scatter point falls can be determined according to the relationship between the coordinates of each grid mapped on the coordinate system and the grid coordinates. And the specific grid in which the scattered point falls can be judged directly according to the relationship between the longitude and latitude values of the scattered point and the size of the grid area.
And S104, when the continuous grids in which the polyline boundary scatter points fall have empty grids, judging the polyline boundary scatter points in the corresponding grids as break points.
It is understood that since some grids do not have polyline boundary scatterers (i.e., empty grids), the "continuity" herein refers to a plurality of consecutive relationships of the previous, next, and next in the polyline boundary scatterer grids. When an empty grid is arranged between two continuous grids with the polyline boundary scatter points, the interval between the scatter points is too large, and scatter point supplement is needed.
As shown in fig. 6, whether a scatter point is a break point can be identified according to the state of the scatter point falling in the adjacent grid. Specifically, when the scatter points are included in each of the continuously adjacent grids, but no scatter point is included in one of the adjacent areas, the scatter points located in the boundary grid including the scatter points can be determined as the break points.
In one embodiment, as shown in fig. 3, when there is an empty mesh between the consecutive meshes in which the polyline boundary scatterers fall, the step of determining that the polyline boundary scatterers in the corresponding mesh are breakpoints includes the following steps S301 to S303:
s301, determining the number of polyline boundary scattered points falling into each grid according to the coordinates of the grids and the coordinates of the polyline boundary scattered points;
s302, obtaining grids with non-zero polyline boundary scatter points in each grid, and marking the grids as non-zero grids;
and S303, when empty grids exist between the continuous non-zero grids, judging that scattered points in the two continuous non-zero grids are break points.
It will be appreciated that there may be one scatter point or multiple scatter points falling within the same grid. When the number of the scattered points falling into one grid is too large, the area of the grid is too large, the scattered points in the polyline boundary scattered point set are not enough to be separated, and the step length of the grid needs to be reduced.
In one embodiment, the step of determining that the scatter points in two consecutive non-zero grids are break points when there is an empty grid between the two consecutive non-zero grids includes:
taking any non-zero grid as a starting node, and calculating the sum of the number of scattered points falling into the grid adjacent to the starting node;
if the sum of the calculated scattered points is equal to zero or only one non-zero grid adjacent to the starting node is included, marking the scattered points in the starting node as break points;
if the sum of the calculated scattered points is larger than zero and the number of the non-zero grids adjacent to the starting node is larger than one, marking the scattered points in the starting node as non-break points;
traversing the current non-zero grids adjacent to the non-zero grids corresponding to the marked scattered points, and calculating the sum of the number of the unmarked scattered points falling into the grids adjacent to the current non-zero grids;
if the sum of the number of the unmarked scattered points is equal to zero, marking the scattered points in the current non-zero grid as break points;
and if the sum of the number of the unmarked scattered points is greater than zero, marking the scattered points in the current non-zero grid as non-break points.
In this embodiment, the grid is used as a node to traverse, and the grid can be regarded as a basis for determining the distance between two scattered points, and if the distance is too far (e.g., more than one grid is apart), the grid is regarded as a breakpoint, and the missing scattered points need to be supplemented between the two scattered points.
In one embodiment, the scatter points in each non-zero grid can be traversed through a breadth-first search algorithm, whether the scatter points are breakpoints or not is marked by assignment one by one, the scatter points corresponding to the breakpoints can be assigned as false, and the scatter points corresponding to the non-breakpoints are assigned as true.
One usage scenario according to the present embodiment is for example: and taking any non-zero grid as an initial node, judging whether the sum of the mark values of the other grids except the already-passed grid in the eight grids adjacent to the point is greater than 0, if so, assigning the flag attribute of the initial node to true, and otherwise, assigning false. And then, based on breadth-first algorithm search, assigning values to the flag of all the path grids from the starting node, wherein the termination condition is that the flag is equal to false, which means that the point is a breakpoint, and one-time search is terminated. And taking the grids with any flag values larger than 0 and without assignment as search starting nodes, and repeating the whole process for multiple times until all flag values larger than 0 are assigned.
In this embodiment, a grid with a flag value greater than 0 and a flag value of false may be collectively referred to as a breakpoint. And establishing a coordinate system, wherein the north-south direction is used as a vertical axis to map longitude lng, and the east-west direction is used as a horizontal axis to map latitude lat.
In one embodiment, when the number of scatter points in the start node is greater than or equal to two, the method further includes:
if the sum of the calculated number of the scattered points is equal to zero, identifying the number of the scattered points in the starting node;
when the number of the scattered points is two, marking the two scattered points in the starting node as break points;
and when the number of the scattered points is more than two, sending a setting prompt for shortening the grid step length.
It can be understood that when the number of scatters falling into a mesh (starting node) is too large, the area representing the mesh is too large to separate the scatters in the polyline boundary scatterer set, and the mesh step size needs to be reduced.
In this embodiment, the setting prompt for shortening the grid step length is sent, so that the user can timely know the reason for the completion defect of the automatic completion method for polyline boundary scattered points, and the user can realize the new division of each scattered point in the polyline boundary scattered point set by shortening the setting of the grid step length and smoothly execute the subsequent steps to realize the automatic completion of the true scattered points.
When the number of the scatter points in the current non-zero grid is greater than or equal to two, if the sum of the number of the scatter points which are not marked is equal to zero, the step of marking the scatter points in the current non-zero grid as break points includes:
calculating the distance between each scatter point in the current non-zero grid and the central point of the non-zero grid where the adjacent marked scatter points are located;
and marking the scattered point which is farthest from the central point in the current non-zero grid as a breakpoint, and marking the rest scattered points in the current non-zero grid as non-breakpoints.
S105, judging whether at least one polyline boundary scatter exists between the adjacent break points.
It can be understood that when the scatter exists between two adjacent break points, it indicates that there is a scatter in other directions between the two break points, and there is no need to complete the scatter between the two break points, and when there is no scatter between two adjacent break points, it indicates that there is a need to complete the scatter between the two break points.
It can be understood that, the human eye can easily determine whether there is a scatter point between two adjacent break points, and this embodiment provides a method for determining whether there is a scatter point between two adjacent break points through a computer device, as shown in fig. 4, where the step of determining whether there is at least one polyline boundary scatter point between two adjacent break points includes the following steps S401 to S404:
s401, acquiring a first breakpoint with the minimum coordinate in the horizontal direction and a second breakpoint with the maximum coordinate from the breakpoints;
s402, generating a boundary line segment for connecting the first breakpoint and the second breakpoint;
s403, generating a breakpoint line segment, wherein the breakpoint line segment is used for sequentially connecting breakpoints on the same side of the boundary line segment from small to large according to the horizontal coordinate;
s404, judging whether scattered points exist between the breakpoint line segments in the region perpendicular to the boundary line segments, if so, judging that the scattered points exist between two adjacent breakpoints corresponding to the breakpoint line segments, otherwise, judging that the scattered points do not exist between the two adjacent breakpoints corresponding to the breakpoint line segments.
One usage scenario according to the present embodiment is for example: and sorting all breakpoint coordinates (lng, lat) from small to large, wherein the leftmost point is marked as a first breakpoint B, and the rightmost point is marked as a second breakpoint A. And connecting the first breakpoint A and the second breakpoint B by using a boundary line segment, and judging whether the rest breakpoints are above or below the boundary line segment. And constructing an upper boundary, connecting the upper boundary from the point B according to the lat coordinate from small to large, connecting the upper boundary and the lower boundary according to the longitude lng coordinate from small to large when the lat coordinate is the same, and constructing a lower boundary according to the same processing mode of the break point below the boundary line segment. The boundary line segments and the breakpoint line segments generated according to the present embodiment are shown in fig. 7.
And S106, when the polyline boundary scatter point does not exist between two adjacent break points, acquiring a break point line segment for connecting the two adjacent break points.
It can be understood that the breakpoint line segment defined herein for connecting between two corresponding adjacent breakpoints is a breakpoint line segment that needs to be supplemented with missing scatter.
In one embodiment, whether scattered points exist between the breakpoint line segments in a region perpendicular to the boundary line segment can be judged by traversing each breakpoint line segment, if so, the scattered points exist between two adjacent breakpoints corresponding to the breakpoint line segment, otherwise, the scattered points do not exist between two adjacent breakpoints corresponding to the breakpoint line segment, and all breakpoint line segments needing missing scattered point supplement are found.
And S107, adding a scatter point at intervals of the grid step length on the obtained breakpoint line segment as a supplement of the missing scatter point.
One usage scenario according to the present embodiment is for example: traversing all breakpoint line segments formed by connecting breakpoints, if grids with the quantity of other scattered points larger than 0 exist in the vertical area and are mapped to the same side of the boundary line segment between two breakpoints, the grids are indicated to be continuous grids, skipping is carried out, and if the grids do not exist, a scattered point is newly established between the two breakpoints along a straight line every grid step length to supplement missing data. A schematic diagram of the missing scatter supplemented according to this embodiment is shown in fig. 8.
The method for automatically completing polyline boundary scattered points provided by this embodiment first obtains coordinates of the most marginal scattered points in east, south, west, and north directions in a polyline boundary scattered point set, generates a corresponding rectangular region according to the coordinates of the most marginal scattered points, then divides the rectangular region into a plurality of grids with the same size along x-axis direction and y-axis direction respectively according to a preset grid step length, then identifies the broken points in the polyline boundary scattered point set according to the state that each scattered point in the polyline boundary scattered point set falls into the grids, and judges whether the scattered points exist between adjacent broken points, when the scattered points do not exist between two adjacent broken points, determines a broken point line segment for connecting the two corresponding adjacent broken points, and adds a scattered point at every interval of the grids on the obtained broken point line segment as supplement of missing scattered point step length, the identification process and the supplement position determination process of the whole missing scattered point can be automatically realized through computer instructions, the manual naked eye positioning and labeling of the breakpoint in the polyline boundary scattered point set are not needed, the scattered point supplement is not needed to be carried out through leading-in to other scattered point supplement tools, the efficiency of delineating the region boundary through supplementing the missing scattered point is improved, the automatic supplement of the missing scattered point is realized, and the manual dependence and the tool dependence are reduced.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
In an embodiment, an automatic completion device for polyline boundary scatter points is provided, and the automatic completion device for polyline boundary scatter points corresponds to the automatic completion method for polyline boundary scatter points in the above embodiment one to one. As shown in fig. 9, the apparatus 100 for automatically completing polyline boundary scatter includes a rectangular region generating module 11, a mesh dividing module 12, an identifying module 13, a breakpoint judging module 14, a judging module 15, a line segment determining module 16, and a scatter supplement module 17. The functional modules are explained in detail as follows:
the rectangular region generating module 11 is configured to obtain coordinates of four scattered points of a polyline boundary scattered point set, where the four scattered points have a maximum longitude value, a minimum longitude value, a maximum latitude value and a minimum latitude value, and generate a corresponding rectangular region according to the coordinates of the four scattered points;
the grid dividing module 12 is configured to divide the rectangular area into a plurality of grids with the same size in the horizontal direction and the vertical direction according to a preset grid step length;
the identification module 13 is configured to identify a grid in which the polyline boundary scatter points fall;
a breakpoint judgment module 14, configured to, when an empty grid is present between consecutive grids in which the polyline boundary scatter points fall, judge that the polyline boundary scatter points in the corresponding grid are breakpoints;
a judging module 15, configured to judge whether at least one polyline boundary scatter exists between adjacent break points;
the line segment determining module 16 is configured to, when the polyline boundary scatter does not exist between two adjacent breakpoint, obtain a breakpoint line segment for connecting the two adjacent breakpoint;
and a scatter supplement module 17, configured to add a scatter point at intervals of the grid step length on the obtained breakpoint line segment as a supplement to the missing scatter point.
The automatic completion device for polyline boundary scattered points provided by this embodiment first obtains coordinates of the most marginal scattered points in east, south, west, and north directions in a polyline boundary scattered point set, generates a corresponding rectangular region according to the coordinates of the most marginal scattered points, then divides the rectangular region into a plurality of grids with the same size along x-axis direction and y-axis direction respectively according to a preset grid step length, then identifies the broken points in the polyline boundary scattered point set according to the state that each scattered point in the polyline boundary scattered point set falls into the grids, and judges whether the scattered points exist between adjacent broken points, when the scattered points do not exist between two adjacent broken points, determines a broken point line segment for connecting the two corresponding adjacent broken points, and adds a scattered point at every interval of the grids on the obtained broken point line segment as the supplement of missing scattered point step length, the identification process and the supplement position determination process of the whole missing scattered point can be automatically realized through computer instructions, the manual naked eye positioning and labeling of the breakpoint in the polyline boundary scattered point set are not needed, the scattered point supplement is not needed to be carried out through leading-in to other scattered point supplement tools, the efficiency of delineating the region boundary through supplementing the missing scattered point is improved, the automatic supplement of the missing scattered point is realized, and the manual dependence and the tool dependence are reduced.
In one embodiment, the breakpoint determining module 14 specifically includes:
a quantity determining unit, configured to determine the quantity of polyline boundary scatter points falling in each grid according to the coordinates of the grid and the coordinates of the polyline boundary scatter points;
the non-zero grid acquisition unit is used for acquiring grids with non-zero polyline boundary scatter points in each grid and marking the grids as non-zero grids;
and the judging unit is used for judging that scattered points in the two continuous non-zero grids are breakpoints when empty grids are arranged between the two continuous non-zero grids.
It will be appreciated that there may be one scatter point or multiple scatter points falling within the same grid. When the number of the scatter points falling into one grid is too large, the area of the grid is too large to separate each scatter point in the polyline boundary scatter point set, and the step size of the grid needs to be reduced.
In one embodiment, the determining unit specifically includes:
a quantity calculation unit, configured to calculate a sum of quantities of the scatter points falling in a grid adjacent to a start node, using any non-zero grid as the start node;
a first breakpoint marking unit, configured to mark a scatter in the start node as a breakpoint if the sum of the calculated numbers of the scatter is equal to zero or only one non-zero mesh adjacent to the start node is included;
a first non-breakpoint marking unit, configured to mark a scatter point in the start node as a non-breakpoint if the sum of the calculated numbers of the scatter points is greater than zero and a non-zero grid adjacent to the start node is greater than one;
the traversal unit is used for traversing the current non-zero grid adjacent to the non-zero grid corresponding to the marked scattered points and calculating the sum of the number of the unmarked scattered points falling into the grid adjacent to the current non-zero grid;
a second breakpoint marking unit, configured to mark a scatter in the current non-zero mesh as a breakpoint if the sum of the number of unmarked scatters is equal to zero;
and the second non-breakpoint marking unit is used for marking the scattered points in the current non-zero grid as non-breakpoints if the sum of the number of the unmarked scattered points is greater than zero.
In one embodiment, the scatter points in each non-zero grid can be traversed through a breadth-first search algorithm, whether the scatter points are breakpoints or not is marked by assignment one by one, the scatter points corresponding to the breakpoints can be assigned as false, and the scatter points corresponding to the non-breakpoints are assigned as true.
One usage scenario according to the present embodiment is for example: and taking any non-zero grid as an initial node, judging whether the sum of the mark values of the other grids except the already-passed grid in the eight grids adjacent to the point is greater than 0, if so, assigning the flag attribute of the initial node to true, and otherwise, assigning false. And then, based on breadth-first algorithm search, assigning values to the flag of all the path grids from the starting node, wherein the termination condition is that the flag is equal to false, which means that the point is a breakpoint, and one-time search is terminated. And taking the grids with any flag values larger than 0 and without assignment as search starting nodes, and repeating the whole process for multiple times until all flag values larger than 0 are assigned.
In one embodiment, the second breakpoint marking unit is specifically configured to:
calculating the distance between each scatter point in the current non-zero grid and the central point of the non-zero grid where the adjacent marked scatter points are located;
and marking the scattered point farthest from the central point in the current non-zero grid as a breakpoint, and marking the rest scattered points in the current non-zero grid as non-breakpoints.
In one embodiment, when the number of the scatters in the start node is greater than or equal to two, the automatic completion apparatus 100 for polyline boundary scatters further includes:
an initial scatter number identification unit, configured to identify the number of scatter points in the initial node if the sum of the calculated number of scatter points is equal to zero;
the starting scattered point marking unit is used for marking two scattered points in the starting node as break points when the number of the scattered points is two;
and the step length setting and reminding unit is used for sending the setting and reminding for shortening the grid step length when the number of the scattered points is more than two.
It can be understood that when the number of scatters falling into a mesh (starting node) is too large, the area representing the mesh is too large to separate the scatters in the polyline boundary scatterer set, and the mesh step size needs to be reduced.
In this embodiment, the setting prompt for shortening the grid step length is sent, so that the user can timely know the reason for the completion defect of the automatic completion method for polyline boundary scattered points, and the user can realize the new division of each scattered point in the polyline boundary scattered point set by shortening the setting of the grid step length and smoothly execute the subsequent steps to realize the automatic completion of the true scattered points.
In one embodiment, the determining module 15 specifically includes:
a horizontal direction breakpoint acquisition unit configured to acquire a first breakpoint having a minimum coordinate in a horizontal direction and a second breakpoint having a maximum coordinate from the breakpoints;
a boundary line segment generating unit for generating a boundary line segment for connecting the first breakpoint and the second breakpoint;
a breakpoint line segment generating unit, configured to generate a breakpoint line segment, where the breakpoint line segment is configured to sequentially connect breakpoints located on the same side of the boundary line segment according to a sequence from small to large in horizontal coordinates;
and the area judgment unit is used for judging whether scattered points exist between the breakpoint line segments in the area perpendicular to the boundary line segment, if so, judging that the scattered points exist between two adjacent breakpoints corresponding to the breakpoint line segments, and otherwise, judging that the scattered points do not exist between two adjacent breakpoints corresponding to the breakpoint line segments.
One usage scenario according to the present embodiment is for example: and sorting all breakpoint coordinates (lng, lat) from small to large, wherein the leftmost point is marked as a first breakpoint B, and the rightmost point is marked as a second breakpoint A. And connecting the first breakpoint A and the second breakpoint B by using a boundary line segment, and judging whether the rest breakpoints are above or below the boundary line segment. And constructing an upper boundary, connecting the upper boundary from the point B according to the lat coordinate from small to large, connecting the upper boundary and the lower boundary according to the longitude lng coordinate from small to large when the lat coordinate is the same, and constructing a lower boundary according to the same processing mode of the break point below the boundary line segment. The boundary line segments and the breakpoint line segments generated according to the present embodiment are shown in fig. 7.
In one embodiment, the apparatus 100 for autocomplete of polyline boundary scatter further comprises:
a coordinate system creating module for creating a coordinate system;
and the mapping module is used for mapping the latitude coordinate of the polyline boundary scatter point on the x axis of the coordinate system, mapping the longitude coordinate of the polyline boundary scatter point on the y axis of the coordinate system, and mapping each scatter point in the polyline boundary scatter point set in the coordinate system.
The application provides an automatic completion device for polyline boundary scattered points, which comprises the steps of firstly obtaining the coordinates of the most marginal scattered points in east, south, west and north directions in a polyline boundary scattered point set, generating a corresponding rectangular area according to the coordinates of the most marginal scattered points, then dividing the rectangular area into a plurality of grids with the same size along the x-axis direction and the y-axis direction respectively according to the preset grid step length, then identifying the break points in the polyline boundary scattered point set according to the state that each scattered point in the polyline boundary scattered point set falls into the grids, judging whether the scattered points exist between the adjacent break points, determining a line segment for connecting the break points between the two corresponding adjacent break points when the scattered points do not exist between the two adjacent break points, and adding a scattered point as the supplement of missing scattered points at each interval of the grid step length on the obtained break point line segment, the identification process and the supplement position determination process of the whole missing scattered point can be automatically realized through computer instructions, the manual naked eye positioning and labeling of the breakpoint in the polyline boundary scattered point set are not needed, the scattered point supplement is not needed to be carried out through leading-in to other scattered point supplement tools, the efficiency of delineating the region boundary through supplementing the missing scattered point is improved, the automatic supplement of the missing scattered point is realized, and the manual dependence and the tool dependence are reduced.
Wherein the meaning of "first" and "second" in the above modules/units is only to distinguish different modules/units, and is not used to define which module/unit has higher priority or other defining meaning. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or modules is not necessarily limited to those steps or modules explicitly listed, but may include other steps or modules not explicitly listed or inherent to such process, method, article, or apparatus, and such that a division of modules presented in this application is merely a logical division and may be implemented in a practical application in a further manner.
For the specific definition of the automatic completion device for polyline boundary scatter points, see the above definition of the automatic completion method for polyline boundary scatter points, which is not described herein again. The modules in the automatic completion device for polyline boundary scatter can be wholly or partially realized by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in fig. 10. The computer device includes a processor, a memory, a network interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external server through a network connection. The computer program is executed by a processor to implement a method for automatic completion of polyline boundary scatterings.
In one embodiment, a computer device is provided, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the steps of the method for automatically completing polyline boundary scatter in the above embodiments are implemented, for example, steps 101 to 107 shown in fig. 2 and other extensions of the method and related steps are extended. Alternatively, the processor, when executing the computer program, implements the functions of the modules/units of the automatic completion apparatus for polyline boundary scatter in the above embodiments, such as the functions of the modules 11 to 17 shown in fig. 9. To avoid repetition, further description is omitted here.
The Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, etc. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like which is the control center for the computer device and which connects the various parts of the overall computer device using various interfaces and lines.
The memory may be used to store the computer programs and/or modules, and the processor may implement various functions of the computer device by running or executing the computer programs and/or modules stored in the memory and invoking data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, video data, etc.) created according to the use of the cellular phone, etc.
The memory may be integrated in the processor or may be provided separately from the processor.
In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, which when executed by a processor implements the steps of the method for automatic completion of polyline boundary scatterings in the above-described embodiments, such as the steps 101 to 107 shown in fig. 2 and extensions of other extensions and related steps of the method. Alternatively, the computer program, when executed by the processor, implements the functions of the modules/units of the automatic completion apparatus for polyline boundary scatter in the above-described embodiment, such as the functions of the modules 11 to 17 shown in fig. 9. To avoid repetition, further description is omitted here.
The application provides an automatic completion method, a device, computer equipment and a storage medium for polyline boundary scattered points, which comprises the steps of firstly obtaining coordinates of the most marginal scattered points in a polyline boundary scattered point set in east, south, west and north directions, generating a corresponding rectangular area according to the coordinates of the most marginal scattered points, then dividing the rectangular area into a plurality of grids with the same size along horizontal direction and vertical direction respectively according to preset grid step length, then identifying breakpoints in the polyline boundary scattered point set according to the state that each scattered point in the polyline boundary scattered point set falls into the grids, judging whether the scattered points exist between adjacent broken points, determining a line segment for connecting the corresponding broken points between the two adjacent broken points when the scattered points do not exist between the two adjacent broken points, and adding a scattered point at each interval of the grid step length on the obtained line segment as the supplement of missing scattered point data, the identification process and the supplement position determination process of the whole missing scattered point can be automatically realized through computer instructions, the manual naked eye positioning and labeling of the breakpoint in the polyline boundary scattered point set are not needed, the scattered point supplement is not needed to be carried out through leading-in to other scattered point supplement tools, the efficiency of delineating the region boundary through supplementing the missing scattered point is improved, the automatic supplement of the missing scattered point is realized, and the manual dependence and the tool dependence are reduced.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.
Claims (10)
1. A method for automatic completion of polyline boundary scatter, the method comprising:
acquiring coordinates of four scattered points with the maximum longitude value, the minimum longitude value, the maximum latitude value and the minimum latitude value in a polyline boundary scattered point set, and generating a corresponding rectangular area according to the coordinates of the four scattered points;
dividing the rectangular area into a plurality of grids with the same size along the horizontal direction and the vertical direction respectively according to preset grid step lengths;
identifying grids in which the polyline boundary scatter points fall;
when the continuous grids falling into the polyline boundary scattered points have empty grids at intervals, judging the polyline boundary scattered points in the corresponding grids as break points;
judging whether at least one polyline boundary scatter exists between the adjacent breakpoints;
when the polyline boundary scatter does not exist between two adjacent breakpoint, acquiring a breakpoint line segment for connecting the two adjacent breakpoint;
and adding a scatter point at intervals of the grid step length on the obtained breakpoint line segment as supplement of the missing scatter point.
2. The method of claim 1, wherein the step of determining polyline boundary scatterers in a corresponding grid as breakpoints when empty grids are present between consecutive grids in which the polyline boundary scatterers are present comprises:
determining the number of polyline boundary scattered points falling into each grid according to the coordinates of the grids and the coordinates of the polyline boundary scattered points;
acquiring grids with non-zero polyline boundary scatter points in each grid, and marking the grids as non-zero grids;
and when empty grids are arranged between the continuous non-zero grids, judging that scattered points in the two continuous non-zero grids are break points.
3. The method of claim 2, wherein the step of determining that the scatter in two consecutive non-zero grids is a break point when there is an empty grid between the consecutive non-zero grids comprises:
taking any non-zero grid as a starting node, and calculating the sum of the number of scattered points falling into the grid adjacent to the starting node;
if the sum of the calculated scattered points is equal to zero or only one non-zero grid adjacent to the starting node is included, marking the scattered points in the starting node as break points;
if the sum of the calculated scattered points is larger than zero and the number of the non-zero grids adjacent to the starting node is larger than one, marking the scattered points in the starting node as non-break points;
traversing the current non-zero grid adjacent to the non-zero grid corresponding to the marked scattered points, and calculating the sum of the number of the unmarked scattered points falling into the grid adjacent to the current non-zero grid;
if the sum of the number of the unmarked scattered points is equal to zero, marking the scattered points in the current non-zero grid as break points;
and if the sum of the number of the unmarked scattered points is greater than zero, marking the scattered points in the current non-zero grid as non-break points.
4. The method of claim 3, wherein when the number of scatters in the current non-zero mesh is greater than or equal to two, if the sum of the number of unlabeled scatters is equal to zero, the step of labeling the scatters in the current non-zero mesh as breakpoints comprises:
calculating the distance between each scatter point in the current non-zero grid and the central point of the non-zero grid where the adjacent marked scatter points are located;
and marking the scattered point which is farthest from the central point in the current non-zero grid as a breakpoint, and marking the rest scattered points in the current non-zero grid as non-breakpoints.
5. The method for automatic completion of polyline boundary scatterings according to claim 3, wherein when the number of scatterings in the starting node is two or more, the method further comprises:
if the sum of the calculated number of the scattered points is equal to zero, identifying the number of the scattered points in the starting node;
when the number of the scattered points is two, marking the two scattered points in the starting node as break points;
and when the number of the scattered points is more than two, sending a setting prompt for shortening the grid step length.
6. The method of claim 1, wherein the step of determining whether at least one polyline boundary scatter exists between adjacent break points comprises:
acquiring a first breakpoint with the minimum coordinate in the horizontal direction and a second breakpoint with the maximum coordinate from the breakpoints;
generating a boundary line segment for connecting the first breakpoint and the second breakpoint;
generating a breakpoint line segment, wherein the breakpoint line segment is used for sequentially connecting breakpoints positioned on the same side of the boundary line segment from small to large according to the horizontal coordinate;
and judging whether scattered points exist between the breakpoint line segments in an area vertical to the boundary line segments, if so, judging that the scattered points exist between two adjacent breakpoints corresponding to the breakpoint line segments, otherwise, judging that the scattered points do not exist between the two adjacent breakpoints corresponding to the breakpoint line segments.
7. The method for automatically completing polyline boundary scatters according to any one of claims 1 to 6, wherein before the step of dividing the rectangular region into a plurality of grids of the same size in the horizontal direction and the vertical direction according to preset grid steps, the method further comprises:
creating a coordinate system;
mapping a latitude coordinate of the polyline boundary scatter point on an x-axis of the coordinate system, mapping a longitude coordinate of the polyline boundary scatter point on a y-axis of the coordinate system, and mapping each scatter point in the polyline boundary scatter point set in the coordinate system.
8. An apparatus for automatic completion of polyline boundary scatter, the apparatus comprising:
the rectangular region generation module is used for acquiring coordinates of four scattered points with the maximum longitude value, the minimum longitude value, the maximum latitude value and the minimum latitude value in the polyline boundary scattered point set and generating a corresponding rectangular region according to the coordinates of the four scattered points;
the grid division module is used for dividing the rectangular area into a plurality of grids with the same size along the horizontal direction and the vertical direction according to preset grid step length;
the identification module is used for identifying grids in which polyline boundary scatter points fall;
a breakpoint judgment module, configured to judge polyline boundary scatterers in a corresponding grid as breakpoints when empty grids are spaced between consecutive grids in which the polyline boundary scatterers fall;
the judgment module is used for judging whether at least one polyline boundary scatter point exists between the adjacent break points;
the line segment determining module is used for acquiring a breakpoint line segment for connecting two adjacent breakpoint points when no polyline boundary scatter exists between the two adjacent breakpoint points;
and the scattered point supplementing module is used for adding a scattered point at intervals of the grid step length on the obtained breakpoint line segment as supplement of the missing scattered point.
9. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor when executing the computer program implements the steps of the method for automatic completion of polyline boundary scatterings as claimed in any one of claims 1 to 7.
10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of a method for automatic completion of polyline boundary scatterings as claimed in any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110364748.XA CN112765304B (en) | 2021-04-06 | 2021-04-06 | Automatic completion method and device for polyline boundary scatter points and related equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110364748.XA CN112765304B (en) | 2021-04-06 | 2021-04-06 | Automatic completion method and device for polyline boundary scatter points and related equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112765304A true CN112765304A (en) | 2021-05-07 |
| CN112765304B CN112765304B (en) | 2021-07-06 |
Family
ID=75691139
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110364748.XA Active CN112765304B (en) | 2021-04-06 | 2021-04-06 | Automatic completion method and device for polyline boundary scatter points and related equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112765304B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102867332A (en) * | 2012-08-29 | 2013-01-09 | 电子科技大学 | Multi-level subdivided mesh surface fitting method based on complicated boundary constraint |
| CN104063898A (en) * | 2014-06-30 | 2014-09-24 | 厦门大学 | Three-dimensional point cloud auto-completion method |
| CN106556402A (en) * | 2015-09-29 | 2017-04-05 | 高德软件有限公司 | A kind of paths planning method and device |
| CN106649339A (en) * | 2015-10-30 | 2017-05-10 | 北大方正集团有限公司 | Method and device for mining outlier |
| CN110716547A (en) * | 2019-10-30 | 2020-01-21 | 苏州大学 | 3D exploration method based on wavefront algorithm |
| CN111796298A (en) * | 2020-07-06 | 2020-10-20 | 贵州电网有限责任公司 | Automatic point cloud point supplementing method for laser LiDAR power line |
-
2021
- 2021-04-06 CN CN202110364748.XA patent/CN112765304B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102867332A (en) * | 2012-08-29 | 2013-01-09 | 电子科技大学 | Multi-level subdivided mesh surface fitting method based on complicated boundary constraint |
| CN104063898A (en) * | 2014-06-30 | 2014-09-24 | 厦门大学 | Three-dimensional point cloud auto-completion method |
| CN106556402A (en) * | 2015-09-29 | 2017-04-05 | 高德软件有限公司 | A kind of paths planning method and device |
| CN106649339A (en) * | 2015-10-30 | 2017-05-10 | 北大方正集团有限公司 | Method and device for mining outlier |
| CN110716547A (en) * | 2019-10-30 | 2020-01-21 | 苏州大学 | 3D exploration method based on wavefront algorithm |
| CN111796298A (en) * | 2020-07-06 | 2020-10-20 | 贵州电网有限责任公司 | Automatic point cloud point supplementing method for laser LiDAR power line |
Non-Patent Citations (1)
| Title |
|---|
| 李晓清: "彩色地形图中等高线断裂重建算法的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112765304B (en) | 2021-07-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109215486B (en) | Electronic map marking and displaying method and device, terminal equipment and storage medium | |
| CN112181397A (en) | Flow visualization monitoring method and device, computer equipment and storage medium | |
| CN111198739A (en) | Rendering method, device and equipment of application view and storage medium | |
| CN109726543B (en) | Login method and device of application program, terminal equipment and storage medium | |
| CN114186005A (en) | Optimized display processing method, device, terminal and medium based on map data aggregation | |
| CN112765304B (en) | Automatic completion method and device for polyline boundary scatter points and related equipment | |
| EP3624397A1 (en) | Node processing | |
| CN110532437B (en) | Electronic certificate prompting method, electronic certificate prompting device, computer equipment and storage medium | |
| CN109745705B (en) | 2d game map editing method and device | |
| CN112003729B (en) | Heterogeneous cloud platform resource topology display method, system, terminal and storage medium | |
| CN104599161A (en) | Method and device for pricing orders based on GPS (global positioning system) coordinate points of client | |
| CN112650692A (en) | Heap memory allocation method, device and storage medium | |
| CN111428197B (en) | Data processing method, device and equipment | |
| CN111008143B (en) | Coverage rate scheduling test method, terminal equipment and computer readable storage medium | |
| CN108834064B (en) | Site matching method and device based on electronic fence map | |
| CN112887910B (en) | Method and device for determining abnormal coverage area and computer readable storage medium | |
| CN111338629A (en) | Data processing method and device for building tree diagram | |
| CN105512312A (en) | Accelerating method for two-dimensional map library | |
| CN108829840B (en) | Electronic fence map construction method and device | |
| CN110489510B (en) | Road data processing method and device, readable storage medium and computer equipment | |
| CN109753721B (en) | FPGA device layout and wiring display method, device, equipment and storage medium | |
| CN109388498B (en) | Mutual exclusion processing method, device, equipment and medium | |
| CN112084288A (en) | Visual map management device | |
| CN105719268A (en) | Map data processing method and map data processing device | |
| CN117273412B (en) | Processing method and platform for intelligent water quantity scheduling 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |