Integer point sets minimizing average pairwise L[subscript 1] distance: What is the optimal shape of a town?
Name
Demaine_Integer point.pdf
Size
294.31 KB
Format
Adobe PDF
Checksum (MD5)
676aec47e6e304a056741fb6e8dec76e
Author(s)
Demaine, Erik D.
Fekete, Sandor P.
Rote, Günter
Schweer, Nils
Schymura, Daria
Zelke, Mariano
Alternative Title
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
Date Issued
September 2010
Journal
Computational Geometry: Theory and Applications
Publisher
Elsevier B.V.
Citation
Demaine, Erik D. et al. “Integer Point Sets Minimizing Average Pairwise L1 Distance: What Is the Optimal Shape of a Town?” Computational Geometry 44.2 (2011) : 82-94.
Version
Author's final manuscript
Abstract
An n-town, n[is an element of]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 solution is known. We show that optimal n-towns can be computed in O(n[superscript 7.5]) time. This is also practically useful, as it allows us to compute optimal solutions up to n=80.
Description
Special issue of selected papers from the 21st Annual Canadian Conference on Computational Geometry
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.comgeo.2010.09.004
