On selecting a fraction of leaves with disjoint neighborhoods in a plane tree

DOI10.1016/j.dam.2021.02.002OpenAlexW3147417497MaRDI QIDQ2161244

Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.02.002

zbMATH Keywords

binary treeVoronoi diagramlinear-time algorithmconstant fraction of leaves

Mathematics Subject Classification ID

Theory of computing (68Qxx) General convexity (52Axx) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Finding the medial axis of a simple polygon in linear time
• Forest-like abstract Voronoi diagrams in linear time
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Deletion in Abstract Voronoi Diagrams in Expected Linear Time.

This page was built for publication: On selecting a fraction of leaves with disjoint neighborhoods in a plane tree