CN111667552B - S57 electronic chart depth range rapid judging and filling method and equipment - Google Patents
S57 electronic chart depth range rapid judging and filling method and equipment Download PDFInfo
- Publication number
- CN111667552B CN111667552B CN202010498658.5A CN202010498658A CN111667552B CN 111667552 B CN111667552 B CN 111667552B CN 202010498658 A CN202010498658 A CN 202010498658A CN 111667552 B CN111667552 B CN 111667552B
- Authority
- CN
- China
- Prior art keywords
- depth
- sea area
- isolated
- depth point
- isolated sea
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/40—Filling a planar surface by adding surface attributes, e.g. colour or texture
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/001—Texturing; Colouring; Generation of texture or colour
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/206—Drawing of charts or graphs
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Generation (AREA)
Abstract
The invention discloses a method and equipment for rapidly judging and filling depth ranges of S57 electronic chart, which are characterized in that sea area polygons are described as polygons with N inner boundaries and one outer boundary, the sea area polygons are classified into isolated sea area polygons and non-isolated sea area polygons according to the number of the inner boundaries, the non-isolated sea area polygons are sorted from small to large, the depth value ranges of the isolated sea area polygons and the non-isolated sea area polygons are respectively judged, and the filling is directly carried out according to the sequence from large to small of the number of the inner boundaries, so that no region is required to be removed or a complete father-son relation tree is established, and the depth range judgment and filling efficiency is improved. And when judging that the depth point and the outer boundary of the sea polygon have the inclusion relationship each time, the invention deletes the depth point from the depth point set, thereby reducing the cycle times.
Description
Technical Field
The invention relates to the field of navigation, in particular to a method and equipment for rapidly judging and filling an S57 electronic chart depth range.
Background
With the development of electronic technology, navigation aids have achieved computerization and highly automated vessels have been achieved in countries where the world transportation industry is advanced. Besides the same information quantity as the traditional paper chart, the electronic chart can also realize the positioning and updating of the chart in a short time, and provides guarantee for the development and utilization of ocean resources. The navigation state of navigation equipment and the danger existing in the navigation area can be clear for the driver with the help of the electronic chart, and the superposition display of the sensor data and the chart can be realized more simply. The international standard, namely the S57 standard electronic chart region depth range rapid judging and filling method is one of the main factors influencing the analysis and use efficiency of electronic chart data and the display and browsing efficiency, and the current method of removing and father-son relation tree method is the most commonly used method.
The elimination method needs to find out the topological relation of all sea area polygons in the electronic chart, namely, all child sea area polygons are eliminated from the father sea area polygons to obtain complementary areas except the child sea area polygons in the father sea area polygons, and depth range judgment and filling are carried out one by one. The method has simple logic, accurate result, huge operation amount, long operation time and very low efficiency.
The parent-child relation tree method builds all the sea area polygons into parent-child relation trees before judging depth and filling, forms clear hierarchical relations, judges depth ranges one by one, sorts the depth ranges according to the parent-child relation from large to small, and covers and fills the sea area polygons layer by layer. The method has higher efficiency than the method of eliminating, but the sea area polygons and depth value points in the S57 electronic chart are often huge in number, and the establishment of a complete father-son relationship tree is complex.
Disclosure of Invention
The invention aims at: aiming at the problems of huge operand, long operation time and low efficiency existing in the removing method and the father-son relation tree method in the prior art, the S57 electronic chart depth range rapid judging and filling method and equipment are provided.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows:
an S57 electronic chart depth range rapid judging and filling method describes a sea polygon as a polygon with N inner boundaries and one outer boundary, wherein N is greater than or equal to 0, N=0 is an isolated sea polygon, and N is greater than 0 is a non-isolated sea polygon; the method comprises the following steps:
s100 traversing the determined sea area polygon set of the S57 electronic chart to obtain an isolated sea area polygon set (B) 1 ，B 2 ，B 3 ，...，B m ) And a collection of non-isolated sea-domain polygons; b (B) m Is the m-th isolated sea area polygon;
s200, sorting from small to large according to the number of inner boundaries to obtain a non-isolated sea area polygon set (A 1 ，A 2 ，A 3 ，...，A n ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the inner boundaries are the same in number, and are ordered from small to large according to the perimeter; a is that n Is the n-th non-isolated sea area polygon;
s300 according to the isolated sea area polygon set (B 1 ，B 2 B 3 ，...，B m ) Judging depth points contained in each isolated sea area polygon outer boundary area by the depth point set; obtaining depth value ranges of all the isolated sea area polygons according to the depth points contained in the isolated sea area polygons;
s400 is based on a set of non-isolated sea-area polygons (A 1 ，A ２ A 3 ，...，A n ) And (3) sequentially judging A with the rest depth point set 1 ，A ２ A 3 ，...，A n The depth points contained in the outer boundary region are deleted from the rest depth point set, so that the depth points of all the non-isolated sea area polygons are obtained; obtaining a depth value range of the non-isolated sea area polygon according to the depth points of the non-isolated sea area polygon;
s500 according to A n ，A n-1 ，A n-2 ，...，A 1 Covering colors corresponding to the depth value range of the non-isolated sea area polygon layer by layer on the S57 electronic chart;
s600, covering colors corresponding to the depth value range of the isolated sea area polygon on the uppermost layer of the S57 electronic chart.
The sea area polygon is described as a polygon with N inner boundaries and one outer boundary, the sea area polygon is classified into an isolated sea area polygon and a non-isolated sea area polygon according to the number of the inner boundaries, the non-isolated sea area polygons are sorted from small to large, the depth value ranges of the isolated sea area polygon and the non-isolated sea area polygon are respectively judged, and the sea area polygon and the non-isolated sea area polygon are directly filled according to the sequence from large to small of the number of the inner boundaries, so that no region is needed to be removed or a complete father-son relation tree is established, and the depth range judgment and filling efficiency is improved.
Preferably, the set of depth points is a set of sampling points, and each depth point includes longitude, latitude and depth information.
Preferably, each time it is determined that the depth point has an inclusion relationship with the outer boundary of the sea polygon, the depth point is deleted from the depth point set, and the remaining depth points form a new depth point set, i.e., a remaining depth point set.
Preferably, the step S300 includes:
s310, judging the inclusion relation between the current depth point of the depth point set and the current isolated sea area polygon outer boundary area; if the current depth point is in the outer boundary, storing the current depth point and deleting the current depth point from the depth point set, traversing the pointer to back 1, and judging the next depth point; if the depth point is not within the outer boundary, directly judging the next depth point;
s320, repeating the step S310 to judge the inclusion relation between the next depth point and the outer boundary region of the current isolated sea area polygon until the last depth point judgment is completed, and obtaining a depth point set and a residual depth point set of the current isolated sea area polygon; the residual depth point set is used for judging the inclusion relation of the polygonal outer boundary area of the next isolated sea area;
s330, calculating the depth value range of the current isolated sea area polygon according to the depth point set of the current isolated sea area polygon;
s310, S320, S330 are repeated until a range of depth values for all isolated sea-area polygons is obtained. Excellent (excellent)
Optionally, the step S400 includes:
s410 judges the current depth point of the residual depth point set and A t Inclusion relation of outer boundary region, t=1, 2,3,..n; if the current depth point is in the outer boundary, storing the current depth point and deleting the current depth point from the depth point set, traversing the pointer to back 1, and judging the next depth point; if the depth point is not within the outer boundary, directly judging the next depth point;
s420 repeating step S410 to proceed the next depth point and A t Determining the inclusion relation of the outer boundary region until the last depth point determination is completed, and obtaining A t A depth point set and a remaining depth point set; residual depth point set for judgment and A t+1 Inclusion of the outer boundary region;
s430, calculating the depth value range of the current isolated sea area polygon according to the depth point set of the current non-isolated sea area polygon;
repeating steps S410, S420, 430 until A is obtained 1 ,A 2 A 3 ，...，A n Is provided.
An S57 electronic chart depth range fast decision filling device comprising:
the sea area polygon classifier is used for dividing the determined sea area polygon set into an isolated sea area polygon set and a non-isolated sea area polygon set, and sorting the non-isolated sea area polygons from small to large according to the number of inner boundaries, wherein the number of inner boundaries is the same, and sorting is carried out from small to large according to the circumference;
the isolated sea area polygon depth value calculation module judges the depth point contained in each isolated sea area polygon outer boundary area according to the isolated sea area polygon set and the imported depth point set; obtaining depth value ranges of all the isolated sea area polygons according to the depth points contained in the isolated sea area polygons;
the non-isolated sea area polygon depth value calculation module calculates the depth value according to the non-isolated sea area polygon set (A 1 ，A 2 ，A 3 ，...，A n ) And (3) sequentially judging A with the rest depth point set output by the isolated sea area polygon depth value calculation module 1 ，A 2 ，A 3 ，...，A n The depth points contained in the outer boundary area are deleted from the rest depth point set after each judgment, so that the depth points of all the non-isolated sea area polygons are obtained; obtaining a depth value range of the non-isolated sea area polygon according to the depth points of the non-isolated sea area polygon;
filling the module according to A n ，A n-1 ，A n-2 ，...，A 1 Covering colors corresponding to the depth value range of the non-isolated sea area polygon layer by layer on the S57 electronic chart; then, the color corresponding to the depth value range of the isolated sea area polygon is covered on the uppermost layer of the S57 electronic chart.
An electronic device comprising at least one processor, and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 5.
In summary, due to the adoption of the technical scheme, the beneficial effects of the invention are as follows:
the invention relates to a method and equipment for rapidly judging and filling depth ranges of S57 electronic chart, which are characterized in that sea area polygons are described as polygons with N inner boundaries and one outer boundary, the sea area polygons are classified into isolated sea area polygons and non-isolated sea area polygons according to the number of the inner boundaries, the non-isolated sea area polygons are sorted from small to large, the depth value ranges of the isolated sea area polygons and the non-isolated sea area polygons are respectively judged, and the filling is directly carried out according to the sequence from large to small of the number of the inner boundaries, so that no region is required to be removed or a complete father-son relation tree is established, and the depth range judgment and filling efficiency is improved. And when judging that the depth point and the outer boundary of the sea polygon have the inclusion relationship each time, the invention deletes the depth point from the depth point set, thereby reducing the cycle times.
Drawings
Fig. 1 is a diagram of S57 standard electronic chart sea area depth value distribution.
FIG. 2 is a schematic diagram of the inclusion relationship of the sea polygon.
Fig. 3 is a flowchart illustrating a method for quickly determining and filling the depth range of the electronic chart in S57.
Fig. 4 is a schematic structural diagram of the S57 electronic chart depth range quick determination and filling device.
Fig. 5 is a schematic structural diagram of an electronic device provided by the present invention.
FIG. 6 is a graph showing comparison of time-consuming curves recorded by the method of removing, father-son relationship tree method and the method of the invention.
The marks in the figure: the system comprises a 1-sea area polygon classifier, a 2-isolated sea area polygon depth value calculation module, a 3-non-isolated sea area polygon depth value calculation module and a 4-filling module.
Detailed Description
The present invention will be described in detail with reference to the accompanying drawings.
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
Example 1
As shown in fig. 1, the S57 standard electronic chart depth values are represented by a set of points having a depth value attribute, i.e., a set of sea-area depth sampling points, the depth range being defined by depth point values distributed within the outer boundary and outside the inner boundary of the pre-determined sea-area polygon,
and there is a complex inclusion relationship between sea area polygons. Existing methods typically require either culling the area or determining the complete parent-child relationship, as shown in fig. 2, determining the depth and filling the area as shown, and culling the decision filling one by one or establishing c.child_1=a, c.child_2=b, b.child=d. Whereas in practice S57 electronic chart is a chart format in which representations are stored in a point-line-surface topology, a surface area (sea polygon) can be understood as an object having two properties, an outer boundary and an inner boundary.
As shown in fig. 3, an S57 electronic chart depth range rapid decision filling method describes a sea polygon as a polygon having N inner boundaries and one outer boundary, N being greater than or equal to 0, where n=0 is an isolated sea polygon and N being greater than 0 is a non-isolated sea polygon (a sea polygon with an inner boundary); the method comprises the following steps:
s100 traversing the determined sea area polygon set of the S57 electronic chart to obtain an isolated sea area polygon set (B) 1 ,B 2 ，B 3 ，...，B m ) And a collection of non-isolated sea-domain polygons;
s200, sorting from small to large according to the number of inner boundaries to obtain a non-isolated sea area polygon set (A 1 ，A 2 ，A 3 ，...，A n ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the inner boundaries are the same in number, and are ordered from small to large according to the perimeter;
s300 according to the isolated sea area polygon set (B 1 ，B 2 ，B 3 ，...，B m ) Deep and deepA degree point set (a depth point set is a set of sampling points, each depth point comprises longitude, latitude and depth information), and judging the depth point contained in each isolated sea area polygon outer boundary area; obtaining depth value ranges of all the isolated sea area polygons according to the depth points contained in the isolated sea area polygons;
the method specifically comprises the following steps: s310, judging the inclusion relation between the current depth point of the depth point set and the current isolated sea area polygon outer boundary area; if the current depth point is in the outer boundary, storing the current depth point and deleting the current depth point from the depth point set, traversing the pointer to back 1, and judging the next depth point; if the depth point is not within the outer boundary, directly judging the next depth point;
s320, repeating the step S310 to judge the inclusion relation between the next depth point and the outer boundary region of the current isolated sea area polygon until the last depth point judgment is completed, and obtaining a depth point set and a residual depth point set of the current isolated sea area polygon; the residual depth point set is used for judging the inclusion relation of the polygonal outer boundary area of the next isolated sea area;
s330, calculating the depth value range of the current isolated sea area polygon according to the depth point set of the current isolated sea area polygon;
s310, S320, S330 are repeated until a range of depth values for all isolated sea-area polygons is obtained.
S400 is based on a set of non-isolated sea-area polygons (A 1 ，A 2 ，A 3 ，...，A n ) And (3) sequentially judging A with the rest depth point set 1 ，A ２ ，A 3 ，...，A n The depth points contained in the outer boundary region are deleted from the rest depth point set, so that the depth points of all the non-isolated sea area polygons are obtained; obtaining a depth value range of the non-isolated sea area polygon according to the depth points of the non-isolated sea area polygon;
the method specifically comprises the following steps: s410 judges the current depth point of the residual depth point set and A t Inclusion relation of outer boundary region, t=1, 2,3,..n; if in the outer boundary, storing the current depth point and deleting the current depth from the depth point setThe point is traversed by pointer rollback 1, and the judgment of the next depth point is carried out; if the depth point is not within the outer boundary, directly judging the next depth point;
s420 repeating step S410 to proceed the next depth point and A t Determining the inclusion relation of the outer boundary region until the last depth point determination is completed, and obtaining A t A depth point set and a remaining depth point set; residual depth point set for judgment and A t+1 Inclusion of the outer boundary region;
s430, calculating the depth value range of the current isolated sea area polygon according to the depth point set of the current non-isolated sea area polygon;
repeating steps S410, S420, 430 until A is obtained 1 ，A ２ A 3 ，...，A n Is provided.
S500 according to A n ，A n-1 ，A n-2 ，...，A 1 Covering colors corresponding to the depth value range of the non-isolated sea area polygon layer by layer on the S57 electronic chart;
s600, covering colors corresponding to the depth value range of the isolated sea area polygon on the uppermost layer of the S57 electronic chart.
Example 2
As shown in fig. 4, an S57 electronic chart depth range quick decision filling apparatus includes:
the sea area polygon classifier 1 divides a judging sea area polygon set into an isolated sea area polygon set and a non-isolated sea area polygon set, and sorts the non-isolated sea area polygons from small to large according to the number of inner boundaries, wherein the number of inner boundaries is the same, and the non-isolated sea area polygons are sorted from small to large according to the circumference;
the isolated sea area polygon depth value calculation module 2 judges the depth point contained in each isolated sea area polygon outer boundary area according to the isolated sea area polygon set and the imported depth point set; obtaining depth value ranges of all the isolated sea area polygons according to the depth points contained in the isolated sea area polygons;
the non-isolated sea area polygon depth value calculation module 3 calculates the depth value of the non-isolated sea area polygon according to the non-isolated sea area polygon set (A 1 ，A 2 A 3 ，...，A n ) And (3) sequentially judging A with the rest depth point set output by the isolated sea area polygon depth value calculation module 1 ，A 2 A 3 ，...，A n The depth points contained in the outer boundary area are deleted from the rest depth point set after each judgment, so that the depth points of all the non-isolated sea area polygons are obtained; obtaining a depth value range of the non-isolated sea area polygon according to the depth points of the non-isolated sea area polygon;
filling the module 4, first according to A n ，A n-1 ，A n-2 ，...，A 1 Covering colors corresponding to the depth value range of the non-isolated sea area polygon layer by layer on the S57 electronic chart; then, the color corresponding to the depth value range of the isolated sea area polygon is covered on the uppermost layer of the S57 electronic chart.
Example 3
As shown in fig. 5, an electronic device (e.g., a computer server with program execution function) according to an exemplary embodiment of the present invention includes at least one processor, a power supply, and a memory and an input-output interface communicatively connected to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method disclosed in any one of the preceding embodiments; the input/output interface can comprise a display, a keyboard, a mouse and a USB interface, and is used for inputting and outputting data; the power supply is used for providing power for the electronic device.
Those skilled in the art will appreciate that: all or part of the steps for implementing the above method embodiments may be implemented by hardware related to program instructions, and the foregoing program may be stored in a computer readable storage medium, where the program, when executed, performs steps including the above method embodiments; and the aforementioned storage medium includes: a removable storage device, a read only memory (ReadOnlyMemory, ROM), a magnetic or optical disk, or other various media capable of storing program code.
The above-described integrated units of the invention, when implemented in the form of software functional units and sold or used as stand-alone products, may also be stored in a computer-readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present invention may be embodied in essence or a part contributing to the prior art in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a removable storage device, a ROM, a magnetic disk, or an optical disk.
Example 4
Under the same hardware condition, the existing method for removing and father-son relation tree method is adopted, and the distribution of the test results adopting the method and the test results adopting the method are shown in tables 1,2 and 3:
table 1 fill time record table with removal method
TABLE 2 father-son relationship Tree filling time record Table
TABLE 3 filling time record table for the inventive method
As shown in FIG. 6, taking the S-57 electronic chart "chart 1" for testing as an example, 50 chart data reading and filling tests are respectively carried out by using a removal method (method I), a father-son relationship tree method (method II) and a method (method III) of the invention, and time-consuming curves are recorded, so that the method (method III) of the invention has the lowest time consumption (15-20S for the invention, 30-40S for the father-son relationship tree method and 120-140S for the removal method), is more stable (the time consumption of each test of the invention is closest, the difference is not large) and has better efficiency.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, and alternatives falling within the spirit and principles of the invention.
Claims (7)
1. An S57 electronic chart depth range rapid judging and filling method is characterized in that a sea area polygon is described as a polygon with N inner boundaries and one outer boundary, N is greater than or equal to 0, wherein N=0 is an isolated sea area polygon, and N is greater than 0 is a non-isolated sea area polygon; the method comprises the following steps:
s100 traversing the determined sea area polygon set of the S57 electronic chart to obtain an isolated sea area polygon set (B) 1 ，B 2 ，B 3 ，...，B m ) And a collection of non-isolated sea-domain polygons; b (B) m Is the m-th isolated sea area polygon;
s200, sorting from small to large according to the number of inner boundaries to obtain a non-isolated sea area polygon set (A 1 ，A 2 ，A 3 ，...，A n ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the inner boundaries are the same in number, and are ordered from small to large according to the perimeter; a is that n Is the n-th non-isolated sea area polygon;
s300 according to the isolated sea area polygon set (B 1 ，B 2 ，B 3 ，...，B m ) Judging depth points contained in each isolated sea area polygon outer boundary area by the depth point set; obtaining depth value ranges of all the isolated sea area polygons according to the depth points contained in the isolated sea area polygons;
s400 is based on a set of non-isolated sea-area polygons (A 1 ，A 2 ，A 3 ，...，A n ) And (3) sequentially judging A with the rest depth point set 1 ，A 2 ，A 3 ，...，A n The depth points contained in the outer boundary region determine that the depth points in the boundary region are from the rest depth point setDeleting to obtain depth points of all the non-isolated sea area polygons; obtaining a depth value range of the non-isolated sea area polygon according to the depth points of the non-isolated sea area polygon;
s500 according to A n ，A n-1 ，A n-2 ，...，A 1 Covering colors corresponding to the depth value range of the non-isolated sea area polygon layer by layer on the S57 electronic chart;
s600, covering colors corresponding to the depth value range of the isolated sea area polygon on the uppermost layer of the S57 electronic chart.
2. The rapid determination and filling method for S57 electronic chart depth range of claim 1 wherein the set of depth points is a set of sampling points, each depth point including longitude, latitude and depth information.
3. The rapid determination and filling method for depth range of S57 electronic chart according to claim 2, wherein each time it is determined that a depth point has an inclusion relationship with an outer boundary of a polygon in a sea area, the depth point is deleted from the depth point set, and the remaining depth points form a new depth point set, i.e., a remaining depth point set.
4. The rapid determination and filling method for S57 electronic chart depth range according to claim 1, wherein the step S300 comprises:
s310, judging the inclusion relation between the current depth point of the depth point set and the current isolated sea area polygon outer boundary area; if the current depth point is in the outer boundary, storing the current depth point and deleting the current depth point from the depth point set, traversing the pointer to back 1, and judging the next depth point; if the depth point is not within the outer boundary, directly judging the next depth point;
s320, repeating the step S310 to judge the inclusion relation between the next depth point and the outer boundary region of the current isolated sea area polygon until the last depth point judgment is completed, and obtaining a depth point set and a residual depth point set of the current isolated sea area polygon; the residual depth point set is used for judging the inclusion relation of the polygonal outer boundary area of the next isolated sea area;
s330, calculating the depth value range of the current isolated sea area polygon according to the depth point set of the current isolated sea area polygon;
s310, S320, S330 are repeated until a range of depth values for all isolated sea-area polygons is obtained.
5. The rapid determination and filling method for S57 electronic chart depth range according to claim 1, wherein the step S400 includes:
s410 judges the current depth point of the residual depth point set and A t Inclusion relation of outer boundary region, t=1, 2,3,..n; if the current depth point is in the outer boundary, storing the current depth point and deleting the current depth point from the depth point set, traversing the pointer to back 1, and judging the next depth point; if the depth point is not within the outer boundary, directly judging the next depth point;
s420 repeating step S410 to proceed the next depth point and A t Determining the inclusion relation of the outer boundary region until the last depth point determination is completed, and obtaining A t A depth point set and a remaining depth point set; residual depth point set for judgment and A t+1 Inclusion of the outer boundary region;
s430, calculating the depth value range of the current isolated sea area polygon according to the depth point set of the current non-isolated sea area polygon;
repeating steps S410, S420, 430 until A is obtained 1 ，A 2 ，A 3 ，...，A n Is provided.
6. An S57 electronic chart depth range fast decision filling apparatus, comprising:
the sea area polygon classifier is used for dividing a judging sea area polygon set into an isolated sea area polygon set and a non-isolated sea area polygon set, and sorting the non-isolated sea area polygons from small to large according to the number of inner boundaries, wherein the number of the inner boundaries is the same, and sorting the non-isolated sea area polygons from small to large according to the circumference, wherein the sea area polygons are described as polygons with N inner boundaries and one outer boundary, N is greater than or equal to 0, wherein N=0 is an isolated sea area polygon, and N is greater than 0 is a non-isolated sea area polygon;
the isolated sea area polygon depth value calculation module judges the depth point contained in each isolated sea area polygon outer boundary area according to the isolated sea area polygon set and the imported depth point set; obtaining depth value ranges of all the isolated sea area polygons according to the depth points contained in the isolated sea area polygons;
the non-isolated sea area polygon depth value calculation module calculates the depth value according to the non-isolated sea area polygon set (A 1 ，A 2 ，A 3 ，...，A n ) And (3) sequentially judging A with the rest depth point set output by the isolated sea area polygon depth value calculation module 1 ，A 2 ，A 3 ，...，A n The depth points contained in the outer boundary area are deleted from the rest depth point set after each judgment, so that the depth points of all the non-isolated sea area polygons are obtained; obtaining a depth value range of the non-isolated sea area polygon according to the depth points of the non-isolated sea area polygon;
filling the module according to A n ，A n-1 ，A n-2 ，...，A 1 In the order of S57 electronic chart, layer by layer
The cover is filled with colors corresponding to the depth value range of the non-isolated sea area polygon; then, the color corresponding to the depth value range of the isolated sea area polygon is covered on the uppermost layer of the S57 electronic chart.
7. An electronic device comprising at least one processor, and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010498658.5A CN111667552B (en) | 2020-06-04 | 2020-06-04 | S57 electronic chart depth range rapid judging and filling method and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010498658.5A CN111667552B (en) | 2020-06-04 | 2020-06-04 | S57 electronic chart depth range rapid judging and filling method and equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111667552A CN111667552A (en) | 2020-09-15 |
| CN111667552B true CN111667552B (en) | 2023-05-23 |
Family
ID=72385941
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010498658.5A Active CN111667552B (en) | 2020-06-04 | 2020-06-04 | S57 electronic chart depth range rapid judging and filling method and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111667552B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101958872A (en) * | 2010-09-28 | 2011-01-26 | 电子科技大学 | Method for searching best carrier frequency offset correction value |
| CN104182928A (en) * | 2014-08-15 | 2014-12-03 | 成都天奥信息科技有限公司 | Quick polygon fill method of vectorgraph |
| CN105678825A (en) * | 2014-11-17 | 2016-06-15 | 北京艾梦海洋科技有限公司 | Rapid filling method of S57 electronic chart region color |
| CN106296772A (en) * | 2015-05-19 | 2017-01-04 | 中船航海科技有限责任公司 | A kind of Pattern Fill method for electron sea drawing territory |
| KR20190016685A (en) * | 2017-08-09 | 2019-02-19 | 영풍전자(주) | system for generating 3 dimensional electronic nautical chart capable of expressing object using electronic nautical chart coordinates and texture mapping |
| CN109816749A (en) * | 2019-02-14 | 2019-05-28 | 中国测绘科学研究院 | Figure spot map symbol fill method, device, computer equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9727670B2 (en) * | 2013-10-04 | 2017-08-08 | The Boeing Company | Horizon night view simulation |
-
2020
- 2020-06-04 CN CN202010498658.5A patent/CN111667552B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101958872A (en) * | 2010-09-28 | 2011-01-26 | 电子科技大学 | Method for searching best carrier frequency offset correction value |
| CN104182928A (en) * | 2014-08-15 | 2014-12-03 | 成都天奥信息科技有限公司 | Quick polygon fill method of vectorgraph |
| CN105678825A (en) * | 2014-11-17 | 2016-06-15 | 北京艾梦海洋科技有限公司 | Rapid filling method of S57 electronic chart region color |
| CN106296772A (en) * | 2015-05-19 | 2017-01-04 | 中船航海科技有限责任公司 | A kind of Pattern Fill method for electron sea drawing territory |
| KR20190016685A (en) * | 2017-08-09 | 2019-02-19 | 영풍전자(주) | system for generating 3 dimensional electronic nautical chart capable of expressing object using electronic nautical chart coordinates and texture mapping |
| CN109816749A (en) * | 2019-02-14 | 2019-05-28 | 中国测绘科学研究院 | Figure spot map symbol fill method, device, computer equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 种子扫描线填充算法在电子海图制作中的应用;李超等;《船海工程》;20100630;第39卷(第3期);169-171 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111667552A (en) | 2020-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111027294B (en) | Method, device and system for summarizing table | |
| CN113420768A (en) | Core category determination method and device, electronic equipment and storage medium | |
| CN111680506A (en) | External key mapping method and device of database table, electronic equipment and storage medium | |
| JPH11167581A (en) | Information sorting method, device and system | |
| CN111427976B (en) | Road freshness obtaining method and device | |
| CN111125443A (en) | On-line updating method of test question bank based on automatic duplicate removal | |
| CN110490250A (en) | A kind of acquisition methods and device of artificial intelligence training set | |
| CN107609284B (en) | Method for quantitatively evaluating landslide disaster risk | |
| CN111667552B (en) | S57 electronic chart depth range rapid judging and filling method and equipment | |
| CN116126790B (en) | Railway engineering archive archiving method and device, electronic equipment and storage medium | |
| CN114528454B (en) | Method for retrieving and extracting aeromagnetic measurement data | |
| CN111859539A (en) | Finite element automatic attribute and material parameter assigning method based on Tcl or Tk secondary development | |
| CN115546465A (en) | Method, medium and electronic device for positioning element position on interface | |
| CN104408316B (en) | Sino-U.S.'s Geotechnical Engineering classification of soils standard handovers device and method | |
| CN110110280B (en) | Curve integral calculation method, device and equipment for coordinates and storage medium | |
| CN113918471A (en) | Test case processing method and device and computer readable storage medium | |
| CN113111116B (en) | Ocean water environment data integration method of ocean comprehensive database | |
| CN113730918B (en) | Game resource map auditing method and device, storage medium and computer equipment | |
| CN117095216B (en) | Model training method, system, equipment and medium based on countermeasure generation network | |
| CN116975137B (en) | Data format conversion method and device based on application requirements | |
| CN113887567B (en) | Vegetable quality detection method, system, medium and equipment | |
| CN117456291B (en) | Defect classification method and device, electronic equipment and storage medium | |
| CN116448061B (en) | Fixed equal-altitude detection method, system and device for topographic map | |
| CN116303909B (en) | Matching method, equipment and medium for electronic bidding documents and clauses | |
| CN114637845A (en) | Model testing method, device, equipment and storage medium |
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 |