A divide-and-conquer algorithm for constructing relative neighborhood graph

DOI10.1007/BF02017341MaRDI QIDQ911282zbMATH OpenOpenAlexFDO

Authors Nen-Fu Huang

Publication date 1990

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02017341

zbMATH Keywords

computational geometrydivide-and-conquer algorithmrelative neighborhood graph

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing relative neighbourhood graphs in the plane
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
• An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space

Cites work

• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• An O(N log N) minimal spanning tree algorithm for N points in the plane
• Computing relative neighbourhood graphs in the plane
• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
• The relative neighbourhood graph of a finite planar set
• Two algorithms for constructing a Delaunay triangulation
• Two-Dimensional Voronoi Diagrams in the L _p -Metric

Cited in

(4)

• New sequential and parallel algorithms for computing the \(\beta\)-spectrum
• scientific article; zbMATH DE number 4080989 (Why is no real title available?)
• Computing relative neighbourhood graphs in the plane
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space

This page was built for publication: A divide-and-conquer algorithm for constructing relative neighborhood graph

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