Thumbnail
Access Restriction
Subscribed

Author Narasimhan, Giri ♦ Zachariasen, Martin
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2001
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Abstract Let $\textit{S}$ be a set of $\textit{n}$ points $inℜ^{d}.$ We present an algorithm that uses thewell-separated pair decomposition and computes the minimum spanningtree of $\textit{S}$ under any $L_{p}$ or polyhedralmetric. A theoretical analysis shows that it has an expectedrunning time of $\textit{O(n}$ log $\textit{n})$ for uniform pointdistributions; this is verified experimentally. Extensiveexperimental results show that this approach is practical. Under avariety of input distributions, the resulting implementation isrobust and performs well for points in higher dimensionalspace.
ISSN 10846654
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2001-12-01
Publisher Place New York
e-ISSN 10846654
Journal Journal of Experimental Algorithmics (JEA)
Volume Number 6


Open content in new tab

   Open content in new tab
Source: ACM Digital Library