论文标题
计算近似时间的弯曲区域标签
Computing Curved Area Labels in Near-Real Time
论文作者
论文摘要
在区域标记问题中，一个是在放置地理区域的标签之后。给定该区域的外边界和一组可选的孔。目的是找到标签位置，使标签跨越该区域并符合其形状。 2001年Barrault的这一领域的最新研究提出了一种基于弯曲支持线的标签位置的算法。当他评估许多非常相似的解决方案时，他的解决方案有一些缺点。此外，由于性能问题，他需要限制搜索空间，因此可能会错过有趣的解决方案。 我们提出了一种解决方案，该解决方案可以更广泛地评估搜索空间。为此，我们计算多边形的骨骼。修剪骨骼以使靠近边界多边形的边缘被移除。在如此修剪的骨骼中，我们选择一组候选路径是该图的最长不同的子路径。基于这些候选者，计算标签支持线并评估标签位置。 关键字：区域字体\和自动标签位置\和数字制图\以及地理信息科学\和几何优化。
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.
