An electronic chart office local topology incremental checking method

Abstract

The present application relates to a kind of electronic chart local topology increment check method, belong to marine surveying and mapping technical field.The topology data structure including point, curve, combination curve and surface four kinds of topological units is constructed, and corresponding topological linkage controller is configured for each topological unit, realize local topological cascade update under editing operation.After completing geometry or element change, system automatically extracts affected topological geometry and its associated element object, according to object type from full set of rules dynamically filters out relevant check rule subset, only to change area executes targeted quality check.After check is completed, the result is merged and deduplicated, eliminate the repeated error report caused by common edge, homologous problem, finally output simplified, accurate check result.The present application realizes the change from "full check" to "increment check", significantly reduces the calculation range and resource consumption, improves the efficiency and accuracy of electronic chart quality control.

Description

Technical Field

[0001] This invention belongs to the field of marine surveying and mapping technology, and in particular to a method for checking the local topological increment of electronic nautical charts. Background Technology

[0002] Incremental updates of vector map data are currently an effective method for rapid map data updates. As one of the key technologies for incremental updates of vector map data, local topology algorithms can effectively solve the efficiency problems caused by updating topological information in the data update process, which is of great significance for rapid map data updates. Based on local topology algorithms, further incremental checks on the changed content are needed to ensure the accuracy and integrity of the data.

[0003] In map topology, spatial geometry is often abstracted into geometric simplexes and geometric complexes. A geometric simplex refers to a single, connected, and homogeneous geometric object in space; a geometric complex is a set of separate geometric simplexes, where the boundary of each simplex can be expressed as a union of other geometric simplexes with lower dimensions within the set. In two-dimensional space, spatial geometry can be divided into three types of geometric simplexes based on their dimension: points, curves, and surfaces. Based on different spatial geometric organization methods and constraints, five topological levels can be defined: 1. Level 1. Unconstrained, consisting of a set of independent points and curves: curves have no reference points (no boundaries), points and curves may repeat; a region is represented by a closed curve. This level can be simply referred to as "topologically unrestricted".

[0004] 2. Level 2a. Consists of a set of point and curve simplexes conforming to the following constraints: Each curve must reference a start point and an end point (which may be the same); curves must not self-intersect; the region is represented by a closed curve, and the start and end points are common points; for regions with holes, all internal boundaries must be completely contained within the external boundaries, and internal boundaries cannot intersect with other internal or external boundaries. Internal boundaries may be tangent to other internal or external boundaries (i.e., at a single point); the outer boundary of the surface must be clockwise (the surface is to the right of the curve), and the direction of the curve must be positive; the inner boundary of the surface must be counterclockwise (the surface is to the right of the curve), and the direction of the curve must be negative. This level can be simply referred to as "point chain topology".

[0005] 3. Level 2b. Consists of a set of point and curve simplexes that meet the following constraints: In addition to Level 2a, the following constraints are added: Each set of simplexes must form a geometric complex; curves cannot self-intersect if no points at their intersections are referenced; multiple coincident geometries are not allowed. This level can be simply referred to as "planar topology".

[0006] 4. Level 3a. Consists of a set of points, curves, and surface simplexes that comply with the following constraints: Level 2a constraints apply.

[0007] 5. Level 3b. Consists of a set of point, curve, and surface simplexes that conform to the following constraints: Building upon Levels 2a and 2b, the following constraints are added: surfaces must be mutually exclusive, and they must provide a complete spatial cover. This level may be simply referred to as "complete topology".

[0008] In the 1980s and 90s, when digital mapping was still in its infancy, many applications adopted data models with topological constraints to reduce storage space. A typical example is the Coverage data model in ESRI's ArcInfo software, which is essentially a "complete topology." Due to the huge success of ArcInfo software in its global rollout, the Coverage data model was widely recognized and used for a long time, and most people equated "topology" with the Coverage data model. However, building a Coverage data model requires maintaining and updating very complex topological relationship tables, such as "face-face," "face-edge," and "edge-edge" relationship tables, making it very difficult to build a robust and practical topology editing software. In the 21st century, ArcInfo has been upgraded to ArcMap, which no longer supports the Coverage data model. It no longer requires explicitly defining and maintaining complex topological relationship tables. Instead, it adopts an object-oriented data model and predefined topology rules to achieve "instant" topology consistency checks at the feature object level, that is, to achieve logical consistency rather than physical spatial geometry consistency, or to achieve topology editing by building temporary "point-edge" topology relationships.

[0009] Nautical charts are a type of map that follows the shape of the land. Figure 1While possessing general theoretical frameworks, electronic nautical charts (ENATs) also have specific conventions and exhibit significant international characteristics. Their development is guided and influenced by international hydrographic organizations. For example, current ENAT data exchange formats must conform to the S-57 standard, with a topology level of 2a; while the next-generation ENAT exchange format must conform to the S-101 standard, with a topology level of 3a. The topology level of ENAT data differs from Coverage and also from the road traffic topology (a degraded 2a level) in the land mapping field. Furthermore, topological consistency at the physical spatial geometric level is still required. Therefore, neither ArcInfo nor ArcMap currently supports the standardized production of ENATs. Globally, achieving ENAT topology editing and synchronized updates is a challenging task. Currently, only a very few ENAT production software programs possess this capability, such as Caris and dKart. However, these software programs are specifically designed for ENATs; while they have partial topology editing capabilities, they cannot perform incremental checks on changes, requiring a complete re-check of the data. Summary of the Invention

[0010] The purpose of this invention is to overcome the shortcomings of the prior art and propose a local topology incremental verification method for electronic nautical charts. This method realizes incremental topology verification of electronic nautical charts, greatly reduces the detection range and computational load, and improves the efficiency and accuracy of electronic nautical chart quality verification.

[0011] The technical problem solved by this invention is achieved through the following technical solution: A method for local topology increment verification of electronic nautical charts includes the following steps: Step 1: Construct the corresponding topological data structure according to the different geometric types of the elements; Step 2: Based on the geometric type of the topology data structure, construct the corresponding topology linkage controller, and further construct topology units through the geometry and topology linkage controller; Step 3: Activate the topology editing function, select to add, delete or modify the geometry of a certain feature, and send an editing event notification to the topology unit corresponding to that geometry; Step 4: After completing the topology editing operation, update the topology unit corresponding to the currently edited geometry and send a linkage update event notification to the associated topology units; Step 5: Based on the linkage update event notification, continue to update the topology unit that has received the notification, and continue to send update events to other topology units associated with the current topology unit, cascading the notification layer by layer, and finally realize the linkage update of the topology. Step 6: Since the object of the topology increment check is the changed topology geometry and its associated feature objects, extract the changed topology geometry and its associated feature objects from the update record in Step 5. Step 7: To implement topology incremental check, filter the associated check rules from the full set of rules; Step 8: Perform checks on the changed topology geometry and feature objects in sequence; Step 9: Merge and deduplicate the check results and output them.

[0012] Furthermore, the topological data structure in step 1 includes four types of topological geometry: points, curves, composite curves, and surfaces. The relationships between these topological geometries are as follows: curves are composed of control points, excluding endpoints; surfaces are composed of several curves or composite curves; there is a one-to-many relationship between composite curves and curves, and also a one-to-many relationship between surfaces and composite curves or curves; endpoints participate in the formation of curves as topological units.

[0013] Moreover, the specific implementation method of step 2 is as follows: each topological unit is composed of topological geometry and topological linkage controller. The geometry can be spatial geometric instances such as points, curves, composite curves or surfaces. The topological linkage controller is further subdivided into four types of linkage controllers: point, curve, composite curve and surface, according to the different geometry types. Each topological unit will call the corresponding topological linkage controller according to its different geometry types.

[0014] Furthermore, the topology linkage controller in step 2 includes an event receiving module, an event processing module, and an event transmission module, which are connected sequentially. The event receiving module is used to receive messages generated by the topology editing operation; the event processing module is used to perform specific spatial geometric position modification, topology structure update, and data persistence business logic on the topology units according to different event types; and the event transmission module is used to transmit the events generated during the editing process sequentially according to the association relationship and order of the topology units, so as to achieve the purpose of cascading update only for local topology units within the association range.

[0015] Furthermore, the topology linkage update in step 5 includes upward linkage, parallel linkage, and downward linkage. Upward linkage is used to update and modify topology units that reference the current topology unit and those referenced by higher-level cascaded units; parallel linkage is used to update and modify topology units at the same level that are associated with it; and downward linkage is used to update and modify topology units that are referenced by the current topology unit and those referenced by lower-level cascaded units.

[0016] Furthermore, step 7 includes the following steps: Step 7.1: Retrieve rules based on the current geometry or current feature object; Step 7.2: Determine whether the check content defined by the rules is related to the current change, including: feature type judgment, geometric type judgment, attribute keyword judgment, and spatial / association relationship judgment; Step 7.3: Determine whether the rules retrieved for the current object have been checked. If yes, skip; otherwise, continue. Step 7.4: Generate rule subset: Filter out all rules related to the current change object to form a minimal, high-priority "check rule subset".

[0017] Furthermore, step 8 includes the following steps: Step 8.1: Based on the current changed geometry / feature object, read each check rule in the rule subset one by one, and determine its scope according to the rule definition; Step 8.2, Execute rule checks: ① First, check if the set of changed features is empty. If it is empty, an error occurs, indicating that the geometric object of the changed geometry is not associated with any features. If it is not empty, execute subsequent checks. ② For geometry rules, traverse all changed curve objects. ③ For attribute rules, traverse the set of changed features and verify the integrity of its attributes. ④ For spatial relationship rules, determine whether the constraints are met. Step 8.3: After each rule is checked, all detected errors are written to the error result record. After all rules have been traversed, the process outputs a complete set of error results, providing raw data for subsequent result merging and deduplication.

[0018] Furthermore, step 9 includes the following steps: Step 9.1: First, merge the newly added and the original error results to construct a full set of errors representing the current data quality integrity status; Step 9.2: Perform multi-level deduplication to eliminate duplicate error entries. ① Merge identical error records; ② Merge similar errors caused by shared edges in different geometric objects or feature objects; ③ Merge errors triggered by different rules but pointing to the same problem; ④ Merge other error cases; Step 9.3: After deduplication is completed, the final check result set is generated.

[0019] The advantages and positive effects of this invention are: This invention addresses the inefficiency and difficulty in supporting precise quality control caused by repeatedly performing topology checks on the entire dataset during existing electronic chart updates. It proposes a change-driven local topology incremental check mechanism. This method constructs four types of topological geometry—points, curves, combined curves, and surfaces—and configures a corresponding topology linkage controller for each geometry, enabling cascading local topology updates during editing operations. After geometric or feature changes are completed, the system automatically extracts the affected topological geometry and its associated feature objects. Based on object type, it dynamically selects a subset of relevant check rules from the full set of rules, performing targeted quality checks only on the changed areas. After the checks are completed, the results are merged and deduplicated to eliminate duplicate error reports caused by shared edges or common sources, ultimately outputting concise and accurate check results. This invention achieves a shift from "full-scale check" to "incremental check," significantly reducing the computational scope and resource consumption, and improving the efficiency and accuracy of electronic chart quality control. Attached Figure Description

[0020] Figure 1 This is a flowchart of the electronic chart local topology increment verification method of the present invention; Figure 2 This is a schematic diagram of the electronic nautical chart topology of the present invention; Figure 3 This is a schematic diagram of the electronic nautical chart spatial object model of the present invention; Figure 4 This is a schematic diagram of the electronic chart topology linkage controller of the present invention; Figure 5 This is a flowchart of the screening and verification rules for this invention; Figure 6 This is a flowchart of the deduplication process for the verification results of this invention; Figure 7 This is an illustration of the LandArea element before deletion in this invention; Figure 8 This is a diagram showing the LandArea element after deletion according to the present invention; Figure 9 This is the interface for displaying the verification results of this invention. Detailed Implementation

[0021] The present invention will be further described in detail below with reference to the accompanying drawings.

[0022] A method for checking the local topology increment of electronic nautical charts, such as Figure 1 As shown, it includes the following steps: Step 1: Load the electronic nautical chart dataset and construct the corresponding topological data structure according to the different geometric types of the elements.

[0023] like Figure 2As shown, the topological data structure in step 1 includes four types of topological geometry: points, curves, composite curves, and surfaces. The relationships between the topological geometry are as follows: curves are composed of control points, excluding endpoints; surfaces are composed of several curves or composite curves; there is a one-to-many relationship between composite curves and curves, and there is also a one-to-many relationship between surfaces and composite curves or curves; endpoints participate in the formation of curves as topological units.

[0024] Step 2: Based on the geometric type of the topology data structure, construct the corresponding topology linkage controller, and further construct the topology unit through the geometry and topology linkage controller.

[0025] The specific implementation method of step 2 is as follows: Figure 3 As shown, each topological unit consists of topological geometry and topological linkage controllers. The geometry can be spatial geometric instances such as points, curves, composite curves, or surfaces. The topological linkage controllers are further subdivided into four types based on the geometry type: point, curve, composite curve, and surface linkage controllers. Each topological unit will call the corresponding topological linkage controller according to its geometry type.

[0026] like Figure 4 As shown, the topology linkage controller in step 2 includes an event receiving module, an event processing module, and an event transmission module, which are connected sequentially. The event receiving module is used to receive messages generated by the topology editing operation; the event processing module is used to perform specific spatial geometric position modification, topology structure update, and data persistence business logic on the topology unit according to different event types; the event transmission module is used to transmit the events generated during the editing process sequentially according to the association relationship and order of the nautical chart topology unit, so as to achieve the purpose of cascading update only for local topology units within the association range.

[0027] Step 3: Activate the topology editing function, select to add, delete or modify the geometry of a certain feature, and send an editing event notification to the topology unit corresponding to that geometry.

[0028] Step 4: After completing the topology editing operation, update the topology unit corresponding to the currently edited geometry and send a linkage update event notification to the associated topology units.

[0029] Step 5: Based on the linkage update event notification, continue to update the topology unit that has received the notification, and continue to send update events to other topology units associated with the current topology unit, cascading the notification layer by layer, and finally realize the linkage update of the topology.

[0030] Step 5 involves topology linkage updates, which include upward linkage, parallel linkage, and downward linkage. Upward linkage is used to update and modify topology units that reference the current topology unit and those referenced in higher-level cascades. Parallel linkage is used to update and modify topology units at the same level that are associated with the current topology unit. Downward linkage is used to update and modify topology units that are referenced by the current topology unit and those referenced in lower-level cascades.

[0031] Step 6: Since the object of the topology increment check is the changed topology geometry and its associated feature objects, extract the changed topology geometry and its associated feature objects from the update record in Step 5.

[0032] Step 7: To implement topology incremental check, filter the associated check rules from the full set of rules.

[0033] like Figure 5 As shown, step 7 includes the following steps: Step 7.1: Retrieve rules based on the current geometry or current feature object; Step 7.2: Determine whether the check content defined by the rules is related to the current change, including: feature type judgment, geometric type judgment, attribute keyword judgment, and spatial / association relationship judgment; Step 7.3: Determine whether the rules retrieved for the current object have been checked. If yes, skip; otherwise, continue. Step 7.4: Generate rule subset: Filter out all rules related to the current change object to form a minimal, high-priority "check rule subset".

[0034] Step 8: Perform checks on the changed topology geometry and feature objects in sequence.

[0035] Step 8 includes the following steps: Step 8.1: Based on the current changed geometry / feature object, read each check rule in the rule subset one by one, and determine its scope according to the rule definition; Step 8.2, Execute rule checks: ① First, check if the set of changed features is empty. If it is empty, an error occurs, indicating that the geometric object of the changed geometry is not associated with any features. If it is not empty, execute subsequent checks. ② For geometry rules, traverse all changed curve objects. ③ For attribute rules, traverse the set of changed features and verify the integrity of its attributes. ④ For spatial relationship rules, determine whether the constraints are met. Step 8.3: After each rule is checked, all detected errors are written to the error result record. After all rules have been traversed, the process outputs a complete set of error results, providing raw data for subsequent result merging and deduplication.

[0036] Step 9: Merge and deduplicate the check results and output them.

[0037] like Figure 6 As shown, step 9 includes the following steps: Step 9.1: First, merge the newly added and the original error results to construct a full set of errors representing the current data quality integrity status; Step 9.2: Perform multi-level deduplication to eliminate duplicate error entries. ① Merge identical error records; ② Merge similar errors caused by shared edges in different geometric objects or feature objects; ③ Merge errors triggered by different rules but pointing to the same problem; ④ Merge other error cases; Step 9.3: After deduplication is completed, the final check result set is generated.

[0038] The application of this invention is illustrated by taking a local modification of a land area in the depth region as an example.

[0039] There is a land area feature in the depth region, which shares an outer boundary with the sea-rock line feature. In this case, delete the land area feature and check the current dataset. The specific steps are as follows: Step 1: Load the electronic nautical chart dataset and construct the corresponding topological data structure according to the different geometric types of the elements.

[0040] like Figure 7 As shown, 101C1004TEST1.000 is loaded into the nautical chart dataset, and a topology data structure is built in memory.

[0041] Step 2: Based on the geometric type of the topology data structure, construct the corresponding topology linkage controller, and further construct the topology unit through the geometry and topology linkage controller.

[0042] In this case, land area No. 2019 is composed of surface No. 501. Both surface No. 501 and coastline No. 2020 are composed of composite curve No. 375. Composite curve No. 375 is composed of curve No. 1091. Curve No. 1091 references endpoint No. 1582.

[0043] Step 3: Activate the topology editing function, select to add, delete or modify the geometry of a certain feature, and send an editing event notification to the topology unit corresponding to that geometry.

[0044] Remove the land area element from document number 2019.

[0045] Step 4: After completing the topology editing operation, update the topology unit corresponding to the currently edited geometry and send a linkage update event notification to the associated topology units.

[0046] After deleting the land area element No. 2019, a notification for a linked update event will be issued, and the process will proceed to the next step.

[0047] Step 5, as follows Figure 8As shown, based on the linkage update event notification, the topology unit that has received the notification continues to be updated, and update events continue to be sent to other topology units associated with the current topology unit, cascading notifications layer by layer, and finally realizing topology linkage update.

[0048] After deleting land feature No. 2019, surface No. 501, which constitutes this feature, is directly deleted because it is not referenced by other geometry or features above. The edit event continues to propagate down to composite curve No. 375. Since it is still referenced by coastline No. 2020, no processing is done and the event does not continue to propagate down.

[0049] Step 6: Extract the changed topological geometry and its associated feature objects from the update record in Step 5.

[0050] Through topological linkage updates, it can be determined that the following surfaces are affected by this edit: surface 501, combined curve 375, curve 1091, endpoint 1582, land area 2019, and coastline 2020.

[0051] Step 7: Filter and modify the topological geometry and the check rules associated with its elements.

[0052] The check rules that match these objects are selected separately. For example, the check rules that match the curved surface include “S-101 3a-5”, “S-101 3a-9”, “S-101 3a-10”, etc. The check rules that match the coastline elements include “S-101 Appendix A 5.3.1”, “S-101 Appendix A 8.1”, “S-101 Appendix A 8.6.2”, etc.

[0053] Taking the inspection rule "S-101 Appendix A 5.3.1" as an example, its script is as follows: <edits> <edit RevisionNumber="1" EditedBy="SuperMap" Date="20240416" Comment="add Test From IHO" / > < / edits> <test id="S101_Dev2051"> <rules> <and> <sourcefeature Feature="Coastline" / > <not> <sharesspatial> <sourcefeature Feature="LandArea" / > < / sharesspatial> < / not> < / and> < / rules> <reference> S-101 Annex A 5.3.1< / reference> <severity> E< / severity> The "Rules" tag in the script indicates that the rule will filter out "Coastline" features that do not share spatial geometry with "LandArea" features.

[0054] Step 8: Perform checks on the changed topology geometry and feature objects respectively.

[0055] The affected surfaces 501, 375 (combined curve), 1091, 1582 (endpoint), 2019 (land area), and 2020 (coastline) were checked. When checking coastline 2020, the only land area feature previously overlapping its outer contour had been deleted, resulting in no land area overlapping with it. Therefore, coastline 2020 was output to the check result set as a violation of the "S-101 Appendix A 5.3.1" check rule. Apart from this, no other check items detected any anomalies.

[0056] Step 9: Merge and deduplicate the check results and output them.

[0057] Rule "S-101 Appendix A 5.3.1" corresponds to the number "S101_Dev2051". After the verification is completed, all verification results will be displayed in a list format in the "Verification Results" panel. For example... Figure 9 As shown, there are a total of 4 features in the currently checked dataset that trigger the check rule "S101_Dev2051". Clicking on any one of the map will locate the corresponding erroneous geometry or feature, and the specific check rule details will be displayed in the "Check Results" panel.

[0058] It should be emphasized that the embodiments described in this invention are illustrative rather than limiting. Therefore, this invention includes, but is not limited to, the embodiments described in the specific implementation. Any other implementations derived by those skilled in the art based on the technical solutions of this invention are also within the scope of protection of this invention.< / test>

Claims

1. A method for checking local topology increments in electronic nautical charts, characterized in that: Includes the following steps: Step 1: Load the electronic nautical chart dataset and construct the corresponding topological data structure according to the different geometric types of the elements; Step 2: Based on the geometric type of the topology data structure, construct the corresponding topology linkage controller, and further construct topology units through the geometry and topology linkage controller; Step 3: Activate the topology editing function, select to add, delete or modify the geometry of a certain feature, and send an editing event notification to the topology unit corresponding to that geometry; Step 4: After completing the topology editing operation, update the topology unit corresponding to the currently edited geometry and send a linkage update event notification to the associated topology units; Step 5: Based on the linkage update event notification, continue to update the topology unit that has received the notification, and continue to send update events to other topology units associated with the current topology unit, cascading the notification layer by layer, and finally realize the linkage update of the topology. Step 6: Since the object of the topology increment check is the changed topology geometry and its associated feature objects, extract the changed topology geometry and its associated feature objects from the update record in Step 5. Step 7: To perform topology incremental checks, filter the check rules that are associated with the changed topology geometry and its elements from the full set of rules; Step 8: Perform checks on the changed topology geometry and feature objects in sequence; Step 9: Merge and deduplicate the check results and output them.

2. The method for checking the local topology increment of electronic nautical charts according to claim 1, characterized in that: The topological data structure in step 1 includes four types of topological geometry: points, curves, composite curves, and surfaces. The relationships between the topological geometries are as follows: curves are composed of control points, excluding endpoints; surfaces are composed of several curves or composite curves; there is a one-to-many relationship between composite curves and curves, and there is also a one-to-many relationship between surfaces and composite curves or curves; endpoints participate in the formation of curves as topological units.

3. The method for checking the local topology increment of electronic nautical charts according to claim 1, characterized in that: The specific implementation method of step 2 is as follows: each topological unit is composed of topological geometry and topological linkage controller. The geometry can be spatial geometric instances such as points, curves, composite curves or surfaces. The topological linkage controller is further subdivided into four types of linkage controllers: point, curve, composite curve and surface, according to the different geometry types. Each topological unit will call the corresponding topological linkage controller according to its different geometry types.

4. The method for checking the local topology increment of electronic nautical charts according to claim 1, characterized in that: In step 2, the topology linkage controller includes an event receiving module, an event processing module, and an event transmission module, which are connected sequentially. The event receiving module receives messages generated by the topology editing operation; the event processing module performs specific spatial geometric position modification, topology structure update, and data persistence business logic on the topology units according to different event types; and the event transmission module transmits the events generated during the editing process sequentially according to the association relationship and order of the topology units, so as to achieve the purpose of cascading updates only on local topology units within the associated range.

5. The method for checking the local topology increment of electronic nautical charts according to claim 1, characterized in that: The topology linkage update in step 5 includes upward linkage, parallel linkage, and downward linkage. Upward linkage is used to update and modify topology units that reference the current topology unit and those referenced by higher-level cascaded units. Parallel linkage is used to update and modify topology units at the same level that are associated with it. Downward linkage is used to update and modify topology units that are referenced by the current topology unit and those referenced by lower-level cascaded units.

6. The method for checking the local topology increment of an electronic nautical chart according to claim 1, characterized in that: Step 7 includes the following steps: Step 7.1: Retrieve rules based on the current geometry or current feature object; Step 7.2: Determine whether the check content defined by the rules is related to the current change, including: feature type judgment, geometric type judgment, attribute keyword judgment, and spatial / association relationship judgment; Step 7.3: Determine whether the rules retrieved for the current object have been checked. If yes, skip; otherwise, continue. Step 7.4: Generate rule subset: Filter out all rules related to the current change object to form a minimal, high-priority "check rule subset".

7. The method for checking local topology increments in electronic nautical charts according to claim 1, characterized in that: Step 8 includes the following steps: Step 8.1: Based on the current changed geometry / feature object, read each check rule in the rule subset one by one, and determine its scope according to the rule definition; Step 8.2, Execute rule checks: ① First, check if the set of changed features is empty. If it is empty, an error occurs, indicating that the geometric object of the changed geometry is not associated with any features. If it is not empty, execute subsequent checks. ② For geometry rules, traverse all changed curve objects. ③ For attribute rules, traverse the set of changed features and verify the integrity of its attributes. ④ For spatial relationship rules, determine whether the constraints are met. Step 8.3: After each rule is checked, all detected errors are written to the error result record. After all rules have been traversed, the process outputs a complete set of error results, providing raw data for subsequent result merging and deduplication.

8. The method for checking the local topology increment of electronic nautical charts according to claim 1, characterized in that: Step 9 includes the following steps: Step 9.1: First, merge the newly added and the original error results to construct a full set of errors representing the current data quality integrity status; Step 9.2: Perform multi-level deduplication to eliminate duplicate error entries. ① Merge identical error records; ② Merge similar errors caused by shared edges in different geometric objects or feature objects; ③ Merge errors triggered by different rules but pointing to the same problem; ④ Merge other error cases; Step 9.3: After deduplication is completed, the final check result set is generated.

Images