Pages that link to "Item:Q4178506"
From MaRDI portal
The following pages link to An <i>O</i> ( <i>n</i> log <i>n</i> ) Algorithm for Rectilinear Minimal Spanning Trees (Q4178506):
Displaying 24 items.
- Finding the largest area axis-parallel rectangle in a polygon (Q676593) (← links)
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
- On the maximum empty rectangle problem (Q796307) (← links)
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions (Q908209) (← links)
- On computing all north-east nearest neighbors in the \(L_ 1\) metric (Q1055197) (← links)
- Efficient algorithms for agglomerative hierarchical clustering methods (Q1057599) (← links)
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- An integrated approach to routing and via minimization (Q1183405) (← links)
- The rectilinear Steiner arborescence problem (Q1186802) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
- A fast and simple Steiner routing heuristic (Q1276958) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- Efficient minimum spanning tree construction with Delaynay triangulation (Q1847389) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- Computing a minimum-width cubic and hypercubic shell (Q2294346) (← links)
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram (Q2367127) (← links)
- A scheme for computing minimum covers within simple regions (Q2428655) (← links)
- The geometry of Minkowski spaces -- a survey. II. (Q2571082) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- A Scheme for Computing Minimum Covers within Simple Regions (Q3183475) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
