US 10,832,463 B2 · Efficient label insertion and collision handling

Abstract

Techniques are described for efficient label insertion and collision handling. A bounding geometry for a label to be graphically displayed on a display screen as part of an electronic map is determined, wherein the bounding geometry comprises a circle. The bounding geometry is inserted into a grid index, wherein the grid index represents a viewport of the electronic map. Disjoint regions of the grid index intersected by the bounding geometry are identified, wherein each disjoint region represents a different portion of the viewport. For each intersected disjoint region, it is identified whether there is at least one collision between the bounding geometry and one or more existing bounding geometries in the disjoint region; and responsive to identifying whether there is at least one collision in the intersected disjoint region, a target opacity of the label is set.

Claims20

Dependent claims

A computer-implemented method comprising:

determining a bounding geometry for a label as part of an electronic map;
inserting the determined bounding geometry into a grid index, wherein the grid index represents a viewport of the electronic map;
identifying disjoint regions of the grid index intersected by the determined bounding geometry, wherein different disjoint regions represent different portions of the viewport;
for one or more intersected disjoint regions:
identifying a position of the determined bounding geometry within the intersected disjoint region;
identifying positions of one or more existing bounding geometries in the disjoint region;
and
determining whether the identified position of the determined bounding geometry and the identified positions of at least one of the one or more existing bounding geometries overlap;
and
responsive to identifying that the determined bounding geometry overlaps at least one of the one or more existing bounding geometries, setting a target opacity of the label.

7 more elements

A non-transitory computer-readable storage medium storing executable instructions that, when executed by a processor, cause the processor to perform steps comprising:

determining a bounding geometry for a label as part of an electronic map;
inserting the determined bounding geometry into a grid index, wherein the grid index represents a viewport of the electronic map;
identifying disjoint regions of the grid index intersected by the determined bounding geometry, wherein different disjoint regions represent different portions of the viewport;
for one or more intersected disjoint regions:
identifying a position of the determined bounding geometry within the intersected disjoint region;
identifying positions of one or more existing bounding geometries in the disjoint region;
and
determining whether the identified position of the determined bounding geometry and the identified positions of at least one of the one or more existing bounding geometries overlap;
and
responsive to determining that the determined bounding geometry overlaps at least one of the one or more existing bounding geometries, setting a target opacity of the label.

7 more elements

Dependencies are inferred from the claim text.

Efficient label insertion and collision handling

Life of this patent

Efficient label insertion and collision handling

Life of this patent

Abstract

Claims20