A divide-and-conquer algorithm for constructing relative neighborhood graph

Nen-Fu Huang

doi:10.1007/BF02017341

Back

A divide-and-conquer algorithm for constructing relative neighborhood graph

Journal article

Peer reviewed

A divide-and-conquer algorithm for constructing relative neighborhood graph

Nen-Fu Huang

BIT, Vol.30(2), pp.196-206

06/1990

DOI: https://doi.org/10.1007/BF02017341

Abstract

Computational geometry,Divide-and-Conquer algorithm,F.2.2,Relative Neighborhood Graph

An O(n log n) divide-and-conquer algorithm for finding the relative neighborhood graph RNG(V) of a set V of n points in Euclidean space is presented. If implemented in parallel, its time complexity is O(n) and it requires O(log n) processors. © 1990 BIT Foundations.

Metrics

1 Record Views

Details

Title: A divide-and-conquer algorithm for constructing relative neighborhood graph
Creators - without role: Nen-Fu Huang - Institute of Computer Science , National Tsing Hua University
Publication Details: BIT, Vol.30(2), pp.196-206
Identifiers: 9957768141106774
Academic Unit: Institute of Communications Engineering, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language: English
Resource Type: Journal article

A divide-and-conquer algorithm for constructing relative neighborhood graph

Abstract

Related links

Metrics

Details

National Tsing Hua University Social media