On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees

  • Kolja Junginger
  • Ioannis Mantas
  • Evanthia PapadopoulouEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11394)


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.


Tree Linear-time algorithm Neighborhood Voronoi diagram 


  1. 1.
    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)MathSciNetCrossRefGoogle Scholar
  2. 2.
    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)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bohler, C., Klein, R., Lingas, A., Liu, C.-H.: Forest-like abstract Voronoi diagrams in linear time. Comput. Geom. 68, 134–145 (2018)MathSciNetCrossRefGoogle Scholar
  4. 4.
    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)MathSciNetCrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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). Scholar
  7. 7.
    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). Scholar
  8. 8.
    Lee, D.-T.: On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput. 100(6), 478–487 (1982)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Papadopoulou, E., Zavershynskyi, M.: The higher-order Voronoi diagram of line segments. Algorithmica 74(1), 415–439 (2016)MathSciNetCrossRefGoogle Scholar
  10. 10.
    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). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Kolja Junginger
    • 1
  • Ioannis Mantas
    • 1
  • Evanthia Papadopoulou
    • 1
    Email author
  1. 1.Faculty of InformaticsUSI Università della Svizzera italianaLuganoSwitzerland

Personalised recommendations