48 citations · 101 across the 24 of their papers we have counts for
1 paper · 1 filter
Boris Aronov, Mark de Berg, Otfried Cheong +4
Given a set S of n points in R^D, and an integer k such that 0 <= k < n, we show that a geometric graph with vertex set S, at most n - 1 + k edges, maximum degree five, and dilatio…