Sign in
On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space.
Jyrki Katajainen
Published in:
BIT (1983)
Keyphrases
</>
worst case
euclidean space
np hard
computational complexity
optimal solution
convex hull
minimal spanning tree
similarity measure
objective function
low dimensional
expectation maximization
distance function
euclidean distance
closed form
metric space
shape analysis