  In three-dimensional geographical scenes, adding labels with leader lines to
point features can significantly improve their visibility. Leadered labels have
a large degree of freedom in position con-figuration, but existing methods are
mostly based on limited position candidate models, which not only fail to
effectively utilize the map space but also make it difficult to consider the
relative relationships between labels. Therefore, we conceptualize the dynamic
configuration process of computing label positions as akin to solving a map
displacement problem. We use a triangulated graph to delineate spatial
relationships among labels and calculate the forces exerted on labels
considering the constraints associated with point feature labels. Then we use
the Beams Displacement Method to iteratively calculate new positions for the
labels. Our experimental outcomes demonstrate that this method effectively
mitigates label overlay issues while maintaining minimal average directional
deviation between adjacent labels. Furthermore, this method is adaptable to
various types of leader line labels. Meanwhile, we also discuss the block
processing strategy to improve the efficiency of label configuration and
analyze the impact of different proximity graphs.
