The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees

Recommendations

An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
Relative neighborhood graphs in three dimensions
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
scientific article; zbMATH DE number 742948
Computing relative neighbourhood graphs in the plane

Cited in

(35)

A low arithmetic-degree algorithm for computing proximity graphs
Coloring certain proximity graphs
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
$\beta$-skeletons for a set of line segments in $\mathbb R^2$
Fast algorithms for computing $\beta$-skeletons and their relatives.
Finding the minimum vertex distance between two disjoint convex polygons in linear time
A divide-and-conquer algorithm for constructing relative neighborhood graph
On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
Complexity, convexity, and unimodality
An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
New sequential and parallel algorithms for computing the $\beta$-spectrum
A linear-time construction of the relative neighborhood graph within a histogram
The relative neighbourhood graph is a part of every $30^\circ $-triangulation
Population-driven urban road evolution dynamic model
Computing relative neighbourhood graphs in the plane
Growing spanning trees in plasmodium machines
A simple linear-time algorithm for computing the ring and MST of unimodal polygons
Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
An O(n log n) plane-sweep algorithm for $L_ 1$ and $L_{\infty}$ Delaunay triangulations
The region approach for computing relative neighbourhood graphs in the $L_ p$ metric
The relative neighborhood graph for mixed feature variables
An algorithm for geometric minimum spanning trees requiring nearly linear expected time
A linear expected-time algorithm for computing planar relative neighbourhood graphs
An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
The expected size of some graphs in computational geometry
scientific article; zbMATH DE number 4080989 (Why is no real title available?)
Optimal and suboptimal robust algorithms for proximity graphs
A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
On the angle restricted nearest neighbor problem
Local solutions for global problems in wireless networks
Computing the relative neighborhood graph in the $L_ 1$ and L//infinity metrics
The $\gamma$-neighborhood graph
scientific article; zbMATH DE number 742948 (Why is no real title available?)
A new distributed topology control algorithm based on optimization of delay and energy in wireless networks
Relative neighborhood graphs in three dimensions

This page was built for publication: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees

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