A note on data structures for maintaining bipartitions

Arkin, 1998, Decision trees for geometric objects, Int. J. Computational Geometry and Applications, 8, 343, 10.1142/S0218195998000175 Belleville, 1993, Probing polygons minimally is hard, Comput. Geom. Theory Appl., 2, 255, 10.1016/0925-7721(93)90022-X M.A. Bender, S. Sethia, S.S. Skiena, Data structures for maintaining set partitions, in: Proceedings of the Seventh Scandinavian Workshop on Algorithm Theory (SWAT), 2000, pp. 83–96 Bender, 2004, Data structures for maintaining set partitions, Random Structures and Algorithms, 25, 43, 10.1002/rsa.20025 Breiman, 1984 Chou, 1991, Optimal partitioning for classification and regression trees, IEEE Transactions on Pattern Analysis and Machine Intelligence, 13, 340, 10.1109/34.88569 Cormen, 1990 R. Freimer, J. Mitchell, C. Piatko, On the complexity of shattering using arrangements, in: Proceedings Canadian Conference in Computational Geometry (CCCG), 1990 Garey, 1972, Optimal binary identification procedures, SIAM J. Appl. Math., 23, 173, 10.1137/0123019 Lengauer, 1990 Moret, 1982, Decision trees and diagrams, Computing Surveys, 593, 10.1145/356893.356898 Safavian, 1991, A survey of decision tree classifier methodology, IEEE Transactions on Systems, Man, and Cybernetics, 21, 660, 10.1109/21.97458 G. Sazaklis, E. Arkin, J. Mitchell, S. Skiena, Probe trees for touching character recognition. in: Proceedings International Conference on Imaging Science, Systems and Technology (CISST), 1998, pp. 282–289 G. Sazaklis, E. Arkin, J. Mitchell, S. Skiena, Geometric decision trees for optical character recognition, in: Proceedings 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 490–492 Skiena, 1992, Interactive reconstruction via probing, IEEE Proceedings, 80, 1364, 10.1109/5.163406 Tarjan, 1975, Efficiency of a good but not linear set union algorithm, Journal of the ACM, 22, 215, 10.1145/321879.321884