On the asymptotic growth rate of some spanning trees embedded in ${\mathbb R}^d$

Pedro Machado Manhães de Castro (1) , Olivier Devillers (1)

1 GEOMETRICA - Geometric computing

We show that, for an Euclidean minimal k-insertion tree (EMITk), if the weight w of an edge e is its Euclidean length to the power of α, the sum on all edges of EMITk of their weights w(e) is O(n * k−α/d) in the worst case, where d is the dimension, for d ≥ 2 and 0 < α < d. We also analyze the expected size of EMITk and some stars, when points are evenly distributed inside the unit ball, for any α > 0.

Domaines: Géométrie algorithmique [cs.CG]

Pedro Machado Manhães de Castro, Olivier Devillers. On the asymptotic growth rate of some spanning trees embedded in ${\mathbb R}^d$. Operations Research Letters, 2011, 39, pp.44-48. ⟨10.1016/j.orl.2010.10.005⟩. ⟨hal-00991081⟩