A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs-Reference-Cited by-同舟云学术

A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Published:2022-08-29 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st International Conference on Parallel Processing
language:
Short-container-title:

Author:

Prokopenko Andrey¹,Sao Piyush¹,Lebrun-Grandie Damien¹

Affiliation:

1. Oak Ridge National Laboratory, United States of America

Funder

U.S. Department of Energy

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3545008.3546185

Reference28 articles.

1. 2018. Next Generation Simulation (NGSIM) Vehicle Trajectories and Supporting Data. Available online: https://catalog.data.gov/dataset/next-generation-simulation-ngsim-vehicle-trajectories-and-supporting-data. Accessed: 2021-03-06. 2018. Next Generation Simulation (NGSIM) Vehicle Trajectories and Supporting Data. Available online: https://catalog.data.gov/dataset/next-generation-simulation-ngsim-vehicle-trajectories-and-supporting-data. Accessed: 2021-03-06.

2. Ciprian Apetrei . 2014. Fast and Simple Agglomerative LBVH Construction . In Computer Graphics and Visual Computing (CGVC) , Rita Borgo and Wen Tang (Eds.). The Eurographics Association . https://doi.org/10.2312/cgvc. 2014 1206 ZSCC : NoCitationData [s0]. 10.2312/cgvc.20141206 Ciprian Apetrei. 2014. Fast and Simple Agglomerative LBVH Construction. In Computer Graphics and Visual Computing (CGVC), Rita Borgo and Wen Tang (Eds.). The Eurographics Association. https://doi.org/10.2312/cgvc.20141206 ZSCC: NoCitationData[s0].

3. Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces;Friedman Bentley;IEEE Trans. Comput. C-27, 2,1978

4. Otakar Borůvka . 1926. O jistém problému minimálním. Práce Mor. Prırodved. Spol. v Brne (Acta Societ. Scienc. Natur. Moravicae) 3, 3 ( 1926 ), 37–58. Otakar Borůvka. 1926. O jistém problému minimálním. Práce Mor. Prırodved. Spol. v Brne (Acta Societ. Scienc. Natur. Moravicae) 3, 3 (1926), 37–58.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU;Proceedings of the 53rd International Conference on Parallel Processing;2024-08-12

2. Fast and Memory-Efficient Approximate Minimum Spanning Tree Generation for Large Datasets;Arabian Journal for Science and Engineering;2024-06-21

3. A novel cluster validity index based on augmented non-shared nearest neighbors;Expert Systems with Applications;2023-08