Geometric minimum spanning trees via well-separated pair decompositions

DOI10.1145/945394.945400MaRDI QIDQ5269369zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Minimum spanning trees in d dimensions
• scientific article; zbMATH DE number 1436136
• scientific article; zbMATH DE number 437554
• On constructing minimum spanning trees in \(R_ 1^ k\)
• Minimum Spanning Trees in k-Dimensional Space

Cited in

(6)

• TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES
• scientific article; zbMATH DE number 1436136 (Why is no real title available?)
• Bounded-degree plane geometric spanners in practice
• Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
• Minimum spanning trees in d dimensions
• Well-separated pair decomposition in linear time?

This page was built for publication: Geometric minimum spanning trees via well-separated pair decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269369)