Digital Map Label Placement Engine Using Band Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing digital map technologies face challenges in displaying numerous labels on a map without overlap, particularly in densely populated areas, leading to inefficiencies in label placement and rendering.
Innovation Solution
A label placement engine implements a heuristic algorithm that partitions the map into parallel bands, orders labels, and iteratively selects non-overlapping labels using a virtual scan line, ensuring efficient placement without overlap, with a processing complexity of O(n log n).
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If numerous labels are displayed on a digital map simultaneously, then the amount of information displayed increases, but label overlap occurs making it difficult to read
Solution Approach 1:
The patent segments the map viewport into multiple horizontal bands and processes labels in each band separately. This segmentation allows the system to manage and select labels in discrete sections, preventing overlap between labels in the same band while enabling more total labels to be displayed across all bands.
Solution Approach 2:
The patent introduces a new dimension by adding vertical spacing constraints between labels in addition to horizontal positioning. By considering both horizontal and vertical dimensions simultaneously through the banding approach, the system can place more labels without overlap.
2Manufacturing precision
If a complex algorithm is used to select non-overlapping labels, then label placement accuracy improves, but processing time increases
Solution Approach 1:
The patent divides the complex label placement problem into smaller sub-problems by processing each horizontal band independently. This segmentation reduces the computational complexity from considering all labels together to considering only labels within each band, achieving O(n log n) processing time while maintaining placement accuracy.
Solution Approach 2:
The patent performs preliminary ordering of labels within each band before the actual selection process. By pre-sorting labels based on their horizontal positions and identifying potential overlaps in advance, the algorithm reduces the computational work needed during the final selection phase, improving overall processing efficiency.
Data Source
AI summary
To place labels on a digital map, indications of dimensions and positions for candidate labels for placement within a bounded region of a digital map are received. The bounded region is partitioned into bands parallel to an axis. For each of the bands, a respective subset of the candidate labels is identified, such that such that each label in the subset is at least partially disposed in the band. Non-overlapping labels are iteratively selected from the subset based at least on one of the edges of the labels in the subset perpendicular to the axis. A result set if generated using the respective selections of non-overlapping labels for the bands. The labels in the result set are placed on the digital map.