Polygon Splitting with Interior Rings for Spatial Database Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Representing spatial features with interior rings in database systems is challenging due to the complexity and computational expense of storing and manipulating such data, especially in large databases with millions or billions of records.
Innovation Solution
A method is introduced where the interior ring is removed from a polygon, and the polygon is split into two polygons along a determined line without considering the interior ring's location, allowing the interior ring to be applied using a point set difference, and the split polygons are stored in the database system, ensuring they are of an appropriate size for efficient storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If interior rings are stored as part of the polygon structure, then the spatial feature representation is complete and accurate, but the storage complexity and computational expense increase significantly
Solution Approach 1:
The patent segments the polygon by removing interior rings from the main polygon structure and storing them separately. The polygon is split into multiple simpler polygons without interior rings, and the interior rings are stored as independent geometric objects. This segmentation reduces the complexity of storing and manipulating spatial features while preserving the complete geometric representation through separate storage of ring information.
2Manufacturing precision
If polygons with interior rings are stored in their original form, then geometric accuracy is maintained, but storage space and processing time increase for large databases
Solution Approach 1:
The patent divides complex polygons with interior rings into multiple simpler polygons without interior rings. By removing interior rings and applying point set difference operations, the original complex geometry is represented as a collection of simpler polygons, reducing storage requirements while maintaining geometric accuracy through the preservation of vertex and edge information.
Solution Approach 2:
The patent extracts interior rings from the polygon structure and stores them separately. This extraction allows the main polygon to be stored in a simpler format without interior ring complexity, reducing storage requirements. The interior rings are preserved as separate geometric objects that can be recombined or applied using point set difference operations to reconstruct the original geometry when needed.
3Productivity
If interior rings are removed and polygons are split, then storage efficiency improves, but the manipulation process becomes more complex
Solution Approach 1:
The patent performs preliminary actions by removing interior rings and splitting polygons before storage. This preprocessing step converts complex polygons with interior rings into simpler polygons without interior rings, making them more efficient for storage and subsequent manipulation. The interior rings are stored separately and can be recombined using point set difference operations, simplifying the overall data structure while maintaining the ability to reconstruct original geometries.
Data Source
AI summary
A spatial feature is considered for storage in a database system running on a computer. The spatial feature includes a polygon, P. The polygon includes an outer ring, OR, and the area within the outer ring. The polygon includes an interior ring contained within the polygon. The computer removes the interior ring from the polygon. The computer determines a line along which to split the polygon without regard for the location of the inner ring within the polygon. The computer splits the polygon into two polygons, SP1 and SP2, along the line. The computer applies the interior ring to the two split polygons by invoking a point set difference between the interior ring and the two split polygons. The computer stores the split polygons in the database system on the computer.