Efficient minimum spanning tree construction with Delaynay triangulation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- A sweepline algorithm for Voronoi diagrams
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
- Low-degree minimum spanning trees
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- On computing all north-east nearest neighbors in the \(L_ 1\) metric
- Priority Search Trees
Cited in
(5)- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)
- \(1\)-line minimum rectilinear Steiner trees and related problems
- Efficient minimum spanning tree algorithms on the reconfigurable mesh
- scientific article; zbMATH DE number 6873974 (Why is no real title available?)
- The saga of minimum spanning trees
This page was built for publication: Efficient minimum spanning tree construction with Delaynay triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847389)
