In the Area Labeling Problem one is after placing the label of a geographic area. Given the outer boundary of the area and an optional set of holes. The goal is to find a label position such that the label spans the area and is conform to its shape. The most recent research in this field from Barrault in 2001 proposes an algorithm to compute label placements based on curved support lines. His solution has some drawbacks as he is evaluating many very similar solutions. Furthermore he needs to restrict the search space due to performance issues and therefore might miss interesting solutions. We propose a solution that evaluates the search space more broadly and much more efficient. To achieve this we compute a skeleton of the polygon. The skeleton is pruned such that edges close to the boundary polygon are removed. In the so pruned skeleton we choose a set of candidate paths to be longest distinct subpaths of the graph. Based on these candidates the label support lines are computed and the label positions evaluated. Keywords: Area lettering \and Automated label placement \and Digital cartography \and Geographic information sciences \and Geometric Optimization.

中文翻译：

---

近实时计算弯曲区域标签

区域标注问题之一是在放置地理区域的标签之后。给定区域的外边界和一组可选的孔。目标是找到一个标签位置，使标签跨越该区域并符合其形状。Barrault 在 2001 年在该领域的最新研究提出了一种基于弯曲支撑线计算标签放置的算法。他的解决方案有一些缺点，因为他正在评估许多非常相似的解决方案。此外，由于性能问题，他需要限制搜索空间，因此可能会错过有趣的解决方案。我们提出了一种更广泛、更有效地评估搜索空间的解决方案。为了实现这一点，我们计算了多边形的骨架。骨架被修剪，以便去除靠近边界多边形的边。在如此修剪的骨架中，我们选择一组候选路径作为图的最长不同子路径。基于这些候选，计算标签支持线并评估标签位置。关键词：区域刻字\和自动标签放置\和数字制图\和地理信息科学\和几何优化。