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

DOI10.1007/BF02239166MaRDI QIDQ757098zbMATH OpenFDO

Authors Tung-Hsin Su, R. C. Chang

Publication date 1991

Published in Computing (Search for Journal in Brave)

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

zbMATH Keywords

geographical neighborhood graphinversionrelative neighborhood graph

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(13)

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

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)