Efficient minimum spanning tree construction with Delaynay triangulation
type: Item
instance of: scholarly article
title: Efficient minimum spanning tree construction with Delaynay triangulation
zbMATH Open document ID: 1046.68116
DOI: 10.1016/S0020-0190(01)00232-0
author: Hai Zhou
author: Narendra Shenoy
author: William Nicholls
published in: Information Processing Letters
publication date: 2003-06-24T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1835259
zbMATH Keywords: spanning graphs
MaRDI profile type: Publication
cites work: A sweepline algorithm for Voronoi diagrams
cites work: An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
cites work: On computing all north-east nearest neighbors in the \(L_ 1\) metric
cites work: An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
cites work: Q4130999
cites work: Priority Search Trees
cites work: Q3992847
cites work: Low-degree minimum spanning trees
cites work: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
full work available at URL: s0020-0190(01)00232-0
OpenAlex ID: W2016523183
description: scientific article; zbMATH DE number 1835259