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

DOI10.1007/BF02239166zbMath0723.68104MaRDI QIDQ757098

Tung-Hsin Su, Ruei-Chuan Chang

Publication date: 1991

Published in: Computing (Search for Journal in Brave)

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)

Related Items (3)

GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Fast algorithms for computing \(\beta\)-skeletons and their relatives. ⋮ Computing Euclidean bottleneck matchings in higher dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The relative neighbourhood graph of a finite planar set
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• How to search in history
• Two algorithms for constructing a Delaunay triangulation
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Multidimensional Searching Problems

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