In this paper, we present efficient algorithms for updating the labeling of a set of n points after the presence of a random obstacle that appears on the map repeatedly. We update the labeling so that the given obstacle does not appear in any of the labels, the new labeling is valid, and the labels are as large as possible (called the optimal labeling). Each point is assumed to have an axis-parallel, square-shaped label of unit size, attached exclusively to that point in the middle of one of its edges. We consider two models: (1) the 2PM model, where each label is attached to its feature only on the middle of one of its horizontal edges, and (2) the r4PM model, where each label is attached to its feature on the middle of either one of its horizontal or vertical edges (known in advance). We assume that a sequence of point-shaped obstacles appear on the map on random locations. Three settings are considered for the behavior of the obstacle: (1) the obstacle is removed afterwards, (2) it remains on the map, and (3) it receives a similar label and remains on the map. Only two operations are permitted on the labels: flipping one or more labels, and/or resizing all labels. In the first setting, we suggest a data structure of O(n) space and O(n lg n) time in the 2PM model, and of O(n 2) time in the r4PM model, so that the updated labeling can be constructed for any obstacle position in O(lg n + k) time, where k is the minimum number of operations needed. For the second and third problems, we suggest an O(n) space and O(n lg n) time data structure that can place each obstacle (possibly with a label) on the map in O(lg n + k) time, if k label flips are sufficient to make room to place the new obstacle. Otherwise, two O(n) time algorithms are suggested when a relabeling of all points is required.

No abstract

We consider an incremental optimal label placement in a closed-2PM map containing points each attached with a label. Labels are assumed to be axis-parallel square-shaped and have to be pairwise disjoint with maximum possible length each attached to its corresponding point on one of its horizontal edges. Such a labeling is denoted as optimal labeling. Our goal is to efficiently generate a new optimal labeling for all points after each new point being inserted in the map. Inserting each point may require several labels to flip or all labels to shrink. We present an algorithm that generates each new optimal labeling in O(lg n + k) time where k is the number of required label flips, if there is no need to shrink the label lengths, or in O(n) time when we have to shrink the labels and flip some of them. The algorithm uses O(n) space in both cases. This is a new result on this problem.