折线束的简化
Simplification of Polyline Bundles
摘要:
我们提出并研究了一个推广到著名的问题的简化。这里给出的不是单个折线,而是一组$\ell$多段线,它们可能共享一些线段和折弯点。我们的目标是最小化简化束中的弯曲点的数量,相对于一定的误差容限$δ$(测量Fréchet距离),但在额外的约束下,共享部分必须被简化一致。我们表明,在一个因素$n^{1/3 - \varepsilon}$内,任何$\varepsilon > 0$,其中$n$是在弯曲点的数目的弯曲束简化是NP-难的近似。这种不可近似性甚至适用于仅包含$\ell=2$多段线的实例。然而,我们确定的灵敏度的解决方案的选择$δ$的原因,这种强大的不可逼近性。特别是,我们证明,如果我们允许$δ$被超过的$2$在我们的解决方案的一个因素,我们可以找到一个简化的不超过$O(\log (\ell + n)) \cdot OPT$弯曲点在polytime,为我们提供了一个有效的双标准近似的束。作为进一步的结果,我们显示固定参数的易处理性的共享弯曲点的数量。
英文摘要:
We propose and study a generalization to the well-known problem of polyline simplification. Instead of a single polyline, we are given a set of $\ell$ polylines possibly sharing some line segments and bend points. Our goal is to minimize the number of bend points in the simplified bundle with respect to some error tolerance $δ$ (measuring Fréchet distance) but under the additional constraint that shared parts have to be simplified consistently. We show that polyline bundle simplification is NP-hard to approximate within a factor $n^{1/3 - \varepsilon}$ for any $\varepsilon > 0$ where $n$ is the number of bend points in the polyline bundle. This inapproximability even applies to instances with only $\ell=2$ polylines. However, we identify the sensitivity of the solution to the choice of $δ$ as a reason for this strong inapproximability. In particular, we prove that if we allow $δ$ to be exceeded by a factor of $2$ in our solution, we can find a simplified polyline bundle with no more than $O(\log (\ell + n)) \cdot OPT$ bend points in polytime, providing us with an efficient bi-criteria approximation. As a further result, we show fixed-parameter tractability in the number of shared bend points.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。