Computing relative neighbourhood graphs in the plane (Q1082094): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Olli S. Nevalainen / rank
Normal rank
 
Property / author
 
Property / author: Olli S. Nevalainen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0031-3203(86)90012-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013663950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Expected-Time Algorithms for Closest Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average performance analysis of a closest‐pair algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average length of Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing relative neighbourhood graphs in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for constructing a Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay triangulation and the convex hull of n points in expected linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the homogeneous planar Poisson point process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5845761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative neighbourhood graph of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3920971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank

Latest revision as of 16:22, 17 June 2024

scientific article
Language Label Description Also known as
English
Computing relative neighbourhood graphs in the plane
scientific article

    Statements

    Computing relative neighbourhood graphs in the plane (English)
    0 references
    0 references
    0 references
    1986
    0 references
    The paper presents two new algorithms for constructing the relative neighborhood graph (RNG) in two-dimensional Euclidean space. The method is to determine a supergraph for RNG which can be thinned efficiently from the extra edges.
    0 references
    0 references
    graph algorithms
    0 references
    pattern recognition
    0 references
    nearest neighbour search
    0 references
    0 references