An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees

Cited in

(27)

On computing all north-east nearest neighbors in the \(L_ 1\) metric
Efficient algorithms for agglomerative hierarchical clustering methods
A faster divide-and-conquer algorithm for constructing Delaunay triangulations
Fast heuristic algorithms for rectilinear Steiner trees
An integrated approach to routing and via minimization
The rectilinear Steiner arborescence problem
A heuristic for Euclidean and rectilinear Steiner problems
Stacks, queues, and deques with order-statistic operations
A fast and simple Steiner routing heuristic
The Steiner tree problem in orientation metrics
Efficient minimum spanning tree construction with Delaynay triangulation
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
Computing a minimum-width cubic and hypercubic shell
An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
A scheme for computing minimum covers within simple regions
The geometry of Minkowski spaces -- a survey. II.
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
A Scheme for Computing Minimum Covers within Simple Regions
Approximation algorithms for buy-at-bulk geometric network design
The 1-Steiner-Minimal-Tree problem in Minkowski-spaces
Voronoi diagrams and their uses
Voronoi diagrams in the moscow metric
Finding the largest area axis-parallel rectangle in a polygon
An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
On the maximum empty rectangle problem
Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions

This page was built for publication: An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees

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