Abstract
We present a generalization of a combinatorial result from Aggarwal, Guibas, Saxe and Shor [1] on selecting a fraction of leaves, with pairwise disjoint neighborhoods, in a tree embedded in the plane. This result has been used by linear-time algorithms to compute certain tree-like Voronoi diagrams, such as the Voronoi diagram of points in convex position. Our generalization allows that only a fraction of the tree leaves is considered: Given is a plane tree T of n leaves, m of which have been marked. Each marked leaf is associated with a neighborhood (a subtree of T) and any topologically consecutive marked leaves have disjoint neighborhoods. We show how to select in linear time a constant fraction of the marked leaves that have pairwise disjoint neighborhoods.
Research supported in part by the Swiss National Science Foundation, project SNF 200021E-154387.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aggarwal, A., Guibas, L., Saxe, J., Shor, P.: A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discret. Comput. Geom. 4, 591–604 (1989)
Bohler, C., Cheilaris, P., Klein, R., Liu, C.H., Papadopoulou, E., Zavershynskyi, M.: On the complexity of higher order abstract Voronoi diagrams. Comput. Geom.: Theory Appl. 48(8), 539–551 (2015)
Bohler, C., Klein, R., Lingas, A., Liu, C.-H.: Forest-like abstract Voronoi diagrams in linear time. Comput. Geom. 68, 134–145 (2018)
Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discret. Comput. Geom. 21(3), 405–420 (1999)
Junginger, K., Papadopoulou, E.: Deletion in abstract Voronoi diagrams in expected linear time. In: Proceedings of 34th International Symposium on Computational Geometry (SoCG), LIPIcs, vol. 99, pp. 50:1–50:14 (2018)
Khramtcova, E., Papadopoulou, E.: An expected linear-time algorithm for the farthest-segment Voronoi diagram. arXiv:1411.2816v3 [cs.CG] (2017). Preliminary Version in Proceedings of 26th International Symposium on Algorithms and Computation (ISAAC), LNCS, vol. 9472, pp. 404–414. Springer, Heidelberg (2015).https://doi.org/10.1007/978-3-662-48971-0_35
Klein, R., Lingas, A.: Hamiltonian abstract Voronoi diagrams in linear time. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol. 834, pp. 11–19. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58325-4_161
Lee, D.-T.: On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput. 100(6), 478–487 (1982)
Papadopoulou, E., Zavershynskyi, M.: The higher-order Voronoi diagram of line segments. Algorithmica 74(1), 415–439 (2016)
So, A.M.-C., Ye, Y.: On solving coverage problems in a wireless sensor network using Voronoi diagrams. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 584–593. Springer, Heidelberg (2005). https://doi.org/10.1007/11600930_58
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Junginger, K., Mantas, I., Papadopoulou, E. (2019). On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees. In: Pal, S., Vijayakumar, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2019. Lecture Notes in Computer Science(), vol 11394. Springer, Cham. https://doi.org/10.1007/978-3-030-11509-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-11509-8_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11508-1
Online ISBN: 978-3-030-11509-8
eBook Packages: Computer ScienceComputer Science (R0)