arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1009.5628cs.CGcs.DS
收藏

最小化平均成对L1-Distance的点集:什么是城镇的最佳形状?

Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town?

Erik D. Demaine, Sandor P. Fekete, Guenter Rote, Nils Schweer, Daria Schymura, Mariano Zelke

摘要:

一个n城镇,对于一个自然数n,是一组n个建筑物,每个建筑物在一个二维整数网格上占据一个不同的位置。如果我们沿着轴线平行的街道网格测量两座建筑物之间的距离,那么如果所有成对曼哈顿距离之和最小化,则n城镇具有最佳形状。这个问题已经研究了城市,即,极大n的极限情况。对于城市,已知最佳形状可以由微分方程描述,对于微分方程没有已知的闭合形式。我们证明了最优n-城镇可以在O(n^7.5)时间内计算。这在实际中也很有用,因为它允许我们计算n=80的最优解。

英文摘要:

An n-town, for a natural number n, is a group of n buildings, each occupying a distinct position on a 2-dimensional integer grid. If we measure the distance between two buildings along the axis-parallel street grid, then an n-town has optimal shape if the sum of all pairwise Manhattan distances is minimized. This problem has been studied for cities, i.e., the limiting case of very large n. For cities, it is known that the optimal shape can be described by a differential equation, for which no closed-form is known. We show that optimal n-towns can be computed in O(n^7.5) time. This is also practically useful, as it allows us to compute optimal solutions up to n=80.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑