On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
type: Item
instance of: scholarly article
title: On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
zbMATH Open document ID: 0723.68104
DOI: 10.1007/BF02239166
author: Tung-Hsin Su
author: R. C. Chang
published in: Computing
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4193163
zbMATH Keywords: inversion
zbMATH Keywords: geographical neighborhood graph
zbMATH Keywords: relative neighborhood graph
MaRDI profile type: Publication
cites work: How to search in history
cites work: Multidimensional Searching Problems
cites work: Q4831050
cites work: Q3772828
cites work: Constructing the relative neighborhood graph in 3-dimensional Euclidean space
cites work: The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
cites work: Computing relative neighbourhood graphs in the plane
cites work: A linear expected-time algorithm for computing planar relative neighbourhood graphs
cites work: Two algorithms for constructing a Delaunay triangulation
cites work: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
cites work: The relative neighbourhood graph of a finite planar set
cites work: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
description: scientific article; zbMATH DE number 4193163