On the Minimum Consistent Subset Problem
- 448 Downloads
The first subexponential-time algorithm for the consistent subset problem.
An \(O(n\log n)\)-time algorithm that finds a consistent subset of size two in two-colored point sets (if such a subset exists). Towards our proof of this running time we present a deterministic \(O(n \log n)\)-time algorithm for computing a variant of the compact Voronoi diagram; this improves the previously claimed expected running time.
An \(O(n\log ^2 n)\)-time algorithm that finds a minimum consistent subset in two-colored point sets where one color class contains exactly one point; this improves the previous best known \(O(n^2)\) running time which is due to Wilfong (SoCG 1991).
An O(n)-time algorithm for the consistent subset problem on collinear points that are given from left to right; this improves the previous best known \(O(n^2)\) running time.
A non-trivial \(O(n^6)\)-time dynamic programming algorithm for the consistent subset problem on points arranged on two parallel lines.
To obtain these results, we combine tools from paraboloid lifting, planar separators, additively-weighted Voronoi diagrams with respect to convex distance functions, point location in farthest-point Voronoi diagrams, range trees, minimum covering of a circle with arcs, and several geometric transformations.
KeywordsConsistent subset Colored points Planar separator Voronoi diagram Paraboloid lifting Range tree Circle covering
This work initiated at the Sixth Annual Workshop on Geometry and Graphs, March 11–16, 2018, at the Bellairs Research Institute of McGill University, Barbados. The authors are grateful to the organizers and to the participants of this workshop.
Ahmad Biniaz was supported by NSERC Postdoctoral Fellowship. Sergio Cabello was supported by the Slovenian Research Agency, program P1-0297 and projects J1-8130, J1-8155. Paz Carmi was supported by grant 2016116 from the United States – Israel Binational Science Foundation. Jean-Lou De Carufel, Anil Maheshwari, and Michiel Smid were supported by NSERC. Saeed Mehrabi was supported by NSERC and by Carleton-Fields Postdoctoral Fellowship.
- 1.Banerjee, S., Bhore, S., Chitnis, R.: Algorithms and hardness results for nearest neighbor problems in bicolored point sets. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 80–93. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-77404-6_7CrossRefGoogle Scholar
- 3.Bhattacharya, B., Bishnu, A., Cheong, O., Das, S., Karmakar, A., Snoeyink, J.: Computation of non-dominated points using compact Voronoi diagrams. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 82–93. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11440-3_8CrossRefzbMATHGoogle Scholar
- 4.Biniaz, A., Cabello, S., Carmi, P., De Carufel, J.-L., Maheshwari, A., Mehrabi, S., Smid, M.: On the minimum consistent subset problem (2018). http://arxiv.org/abs/1810.09232
- 10.Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 865–877. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48350-3_72. Full version in arXiv:1504.05476CrossRefzbMATHGoogle Scholar
- 11.Masuyama, S., Ibaraki, T., Hasegawa, T.: Computational complexity of the \(m\)-center problems in the plane. Trans. Inst. Electron. Commun. Eng. Jpn. Section E E64(2), 57–64 (1981)Google Scholar