Abstract
We study a class of geometric optimization problems closely related to the 2-center problem: Given a set S of n pairs of points, assign to each point a color (“red” or “blue”) so that each pair’s points are assigned different colors and a function of the radii of the minimum enclosing balls of the red points and the blue points, respectively, is optimized. In particular, we consider the problems of minimizing the maximum and minimizing the sum of the two radii. For each case, minmax and minsum, we consider distances measured in the L 2 and in the L ∞ metrics. Our problems are motivated by a facility location problem in transportation system design, in which we are given origin/destination pairs of points for desired travel, and our goal is to locate an optimal road/flight segment in order to minimize the travel to/from the endpoints of the segment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: Voronoi diagram for services neighboring a highway. Information Processing Letters 86, 283–288 (2003)
Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica 33(2), 201–226 (2002)
Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Computing Surveys 30(4), 412–458 (1998)
Ahn, H.-K., Alt, H., Asano, T., Bae, S.W., Brass, P., Cheong, O., Knauer, C., Na, H.-S., Shin, C.-S., Wolff, A.: Constructing optimal highways. International Journal of Foundations of Computer Science 20(1), 3–23 (2009)
Alt, H., Scharf, L.: Computing the depth of an arrangement of axis-aligned rectangles in parallel. In: Abstracts 26th European Workshop on Computational Geometry, pp. 33–36 (2010)
Bespamyatnikh, S., Segal, M.: Rectilinear Static and Dynamic Discrete 2-Center Problems. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 276–287. Springer, Heidelberg (1999)
Cardinal, J., Collette, S., Hurtado, F., Langerman, S., Palop, B.: Optimal location of transportation devices. Computational Geometry: Theory and Applications 41, 219–229 (2008)
Cardinal, J., Langerman, S.: Min-max-min geometric facility location problems. In: Abstracts 22nd European Workshop on Computational Geometry, pp. 149–152 (2006)
Díaz-Báñez, J.M., Korman, M., Pérez-Lantero, P., Ventura, I.: Locating a service facility and a rapid transit line. In: Proc. 14th Spanish Meeting on Computational Geometry, pp. 189–192 (2011)
Drezner, Z.: On the rectangular p-center problem. Naval Research Logistics 34(2), 229–234 (1987)
Eppstein, D.: Dynamic three-dimensional linear programming. INFORMS Journal on Computing 4(4), 360–368 (1992)
Eppstein, D.: Faster construction of planar two-centers. In: Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 131–138 (1997)
Korman, M., Tokuyama, T.: Optimal Insertion of a Segment Highway in a City Metric. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 611–620. Springer, Heidelberg (2008)
Sheth, K., Islam, T., Kopardekar, P.: Analysis of airspace tube structures. In: 27th Digital Avionics Systems Conference, IEEE/AIAA (October 2008)
Sridhar, B., Grabbe, S., Sheth, K., Bilimoria, K.: Initial study of tube networks for flexible airspace utilization. In: AIAA Guidance, Navigation, and Control Conference, AIAA-2006-6768, Keystone, CO (August 2006)
Yousefi, A., Donohue, G., Sherry, L.: High volume tube shaped sectors (HTS): A network of high-capacity ribbons connecting congested city pairs. In: 23rd Digital Avionics Systems Conference, IEEE/AIAA, Salt Lake City, UT (2004)
Zadeh, A., Yousefi, A., Tafazzoli, A.A.: Dynamic allocation and benefit assessment of NextGen flow corridors. In: 4th International Conference on Research in Air Transportation, Budapest, Hungary (June 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arkin, E.M. et al. (2012). Bichromatic 2-Center of Pairs of Points. In: Fernández-Baca, D. (eds) LATIN 2012: Theoretical Informatics. LATIN 2012. Lecture Notes in Computer Science, vol 7256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29344-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-29344-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29343-6
Online ISBN: 978-3-642-29344-3
eBook Packages: Computer ScienceComputer Science (R0)