Abstract
Metrics or distance functions generalizing the Euclidean metric (and even \(L_p\)-metrics) have been used in Computational Geometry long ago; for example, convex distance functions appeared in the first Symposium on Computational geometry [2]. Very recently Das et al. [5] studied the 1-center problem under a convex polyhedral distance function where the unit ball of the distance function is a convex polytope. In this paper we develop algorithms for the 2-center problem under a convex polyhedral distance function in \(\mathbb {R}^d,d=2,3\). We show that the 2-center can be computed in \(O(n\log m)\) time for the plane and in \(O(nm\log n)\) time for \(d=3\). We show that the problem of for computing the 2-center in \(\mathbb {R}^3\) has an \(\varOmega (n\log n)\) lower bound.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
To simplify the analysis.
- 2.
This condition can be removed by a perturbation.
References
Arkin, E.M., Hurtado, F., Mitchell, J.S.B., Seara, C., Skiena, S.: Some lower bounds on geometric separability problems. Int. J. Comput. Geom. Appl. 16(1), 1–26 (2006)
Chew, L.P., Drysdale III, R.L.: Voronoi diagrams based on convex distance functions. In: Proceedings of the 1st Annual ACM Symposium Computational Geometry, pp. 235–244 (1985)
Chew, L.P., Kedem, K., Sharir, M., Tagansky, B., Welzl, E.: Voronoi diagrams of lines in 3-space under polyhedral convex distance functions. J. Algorithms 29(2), 238–255 (1998)
Clarkson, K.L.: Linear programming in \(O(n 3^{d^{2}})\) time. Inform. Process. Lett. 22, 21–24 (1986)
Das, S., Nandy, A., Sarvottamananda, S.: Linear time algorithm for 1-center in \(\mathfrak{R}^{d}\) under convex polyhedral distance function. In: Zhu, D., Bereg, S. (eds.) FAW 2016. LNCS, vol. 9711, pp. 41–52. Springer, Heidelberg (2016). doi:10.1007/978-3-319-39817-4_5
Dyer, M.E.: On a multidimensional search technique and its application to the Euclidean one-centre problem. SIAM J. Comput. 15, 725–738 (1986)
Icking, C., Klein, R., Lê, N., Ma, L.: Convex distance functions in 3-space are different. Fundam. Inform. 22(4), 331–352 (1995)
Icking, C., Klein, R., Ma, L., Nickel, S., Weißler, A.: On bisectors for different distance functions. Discret. Appl. Math. 109, 139–161 (2001)
Lee, D.T., Wu, Y.F.: Geometric complexity of some location problems. Algorithmica 1, 193–211 (1986)
Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM 31, 114–127 (1984)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Bereg, S. (2016). On the 2-Center Problem Under Convex Polyhedral Distance Function. In: Chan, TH., Li, M., Wang, L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science(), vol 10043. Springer, Cham. https://doi.org/10.1007/978-3-319-48749-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-48749-6_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48748-9
Online ISBN: 978-3-319-48749-6
eBook Packages: Computer ScienceComputer Science (R0)