On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces

DOI10.1007/BF02239166zbMATH Open0723.68104MaRDI QIDQ757098FDOQ757098

Authors: Tung-Hsin Su, R. C. Chang 

Publication date: 1991

Published in: Computing (Search for Journal in Brave)

Recommendations

• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• A linear expected-time algorithm for computing planar relative neighbourhood graphs
• Relative neighborhood graphs in three dimensions
• scientific article; zbMATH DE number 742948
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation

zbMATH Keywords

inversiongeographical neighborhood graphrelative neighborhood graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The relative neighbourhood graph of a finite planar set
• Title not available (Why is that?)
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Two algorithms for constructing a Delaunay triangulation
• Multidimensional Searching Problems
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• Title not available (Why is that?)
• How to search in history
• Computing relative neighbourhood graphs in the plane
• The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
• A linear expected-time algorithm for computing planar relative neighbourhood graphs
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space

Cited In (13)

• The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation
• Relative neighborhood graphs in three dimensions
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
• Variants of k-regular nearest neighbor graph and their construction
• Construction of the nearest neighbor embracing graph of a point set
• Computing relative neighbourhood graphs in the plane
• An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• A divide-and-conquer algorithm for constructing relative neighborhood graph
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• Computing Euclidean bottleneck matchings in higher dimensions
• Fast algorithms for computing \(\beta\)-skeletons and their relatives.
• Title not available (Why is that?)

This page was built for publication: On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces

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