Locating an axis-parallel rectangle on a Manhattan plane
- 108 Downloads
In this paper we consider the problem of locating an axis-parallel rectangle in the plane such that the sum of distances between the rectangle and a finite point set is minimized, where the distance is measured by the Manhattan norm ℓ 1. In this way we solve an extension of the Weber problem to extensive facility location. As a model, our problem is appropriate for position sensing of rectangular objects.
KeywordsWeber problem Minisum Dimensional facility Polyhedral norms
Mathematics Subject Classification (2000)90B85 97N50 65D10 90C26
We wish to thank two anonymous referees for their helpful comments. An improved complexity bound on the algorithms given is due to a suggestion by Professor Arie Tamir, and we are also very thankful for that.
- Grimson W (1991) Object recognition by computer. The MIT Press, Cambridge Google Scholar
- Korneenko N, Martini H (1990) Approximating finite weighted point sets by hyperplanes. In: SWAT’90: proceedings of the 2nd Scandinavian workshop on algorithm theory, pp 276–286 Google Scholar
- Körner M, Brimberg J, Juel H, Schöbel A (2009) General minisum circle location. In: Proceedings of the 21th Canadian conference on computational geometry, pp 111–114 Google Scholar
- Love R, Morris J, Wesolowsky G (1988) Facilities location—models & methods. North-Holland, Amsterdam Google Scholar
- Wallack A, Canny J, Manocha D (1993) Object localization using crossbeam sensing. In: IEEE international conference on robotics and automation Google Scholar
- Weber A (1909) Über den Standort der Industrien. Tübingen (in German) Google Scholar