Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions

DOI10.1145/945394.945400zbMath1365.68446OpenAlexW2056578260MaRDI QIDQ5269369

Giri Narasimhan, Martin Zachariasen

Publication date: 15 June 2017

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/945394.945400

zbMATH Keywords

geometric minimum spanning trees

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions