Comment: Algorithms for computing relative neighbourhood graph

Research output: Contribution to journalArticle

Abstract

Until recently no algorithm existed for computing the relative neighbourhood graph of n points on the plane in less than O(n2) worst-case time. Urquhart recently presented an O(n log n) algorithm for solving this problem. In this letter it is shown that Urquhart's algorithm does not always work and hence finding an O(n log n) algorithm remains an open problem.

Original languageEnglish (US)
Number of pages1
JournalElectronics Letters
Volume16
Issue number22
DOIs
StatePublished - Oct 23 1980

Keywords

  • Algorithms
  • Graph theory
  • Pattern recognition

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Comment : Algorithms for computing relative neighbourhood graph. / Toussaint, Godfried.

In: Electronics Letters, Vol. 16, No. 22, 23.10.1980.

Research output: Contribution to journalArticle

@article{5d210c5f91c842fd8a031388c3e2c05b,
title = "Comment: Algorithms for computing relative neighbourhood graph",
abstract = "Until recently no algorithm existed for computing the relative neighbourhood graph of n points on the plane in less than O(n2) worst-case time. Urquhart recently presented an O(n log n) algorithm for solving this problem. In this letter it is shown that Urquhart's algorithm does not always work and hence finding an O(n log n) algorithm remains an open problem.",
keywords = "Algorithms, Graph theory, Pattern recognition",
author = "Godfried Toussaint",
year = "1980",
month = "10",
day = "23",
doi = "10.1049/el:19800611",
language = "English (US)",
volume = "16",
journal = "Electronics Letters",
issn = "0013-5194",
publisher = "Institution of Engineering and Technology",
number = "22",

}

TY - JOUR

T1 - Comment

T2 - Algorithms for computing relative neighbourhood graph

AU - Toussaint, Godfried

PY - 1980/10/23

Y1 - 1980/10/23

N2 - Until recently no algorithm existed for computing the relative neighbourhood graph of n points on the plane in less than O(n2) worst-case time. Urquhart recently presented an O(n log n) algorithm for solving this problem. In this letter it is shown that Urquhart's algorithm does not always work and hence finding an O(n log n) algorithm remains an open problem.

AB - Until recently no algorithm existed for computing the relative neighbourhood graph of n points on the plane in less than O(n2) worst-case time. Urquhart recently presented an O(n log n) algorithm for solving this problem. In this letter it is shown that Urquhart's algorithm does not always work and hence finding an O(n log n) algorithm remains an open problem.

KW - Algorithms

KW - Graph theory

KW - Pattern recognition

UR - http://www.scopus.com/inward/record.url?scp=85012591507&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85012591507&partnerID=8YFLogxK

U2 - 10.1049/el:19800611

DO - 10.1049/el:19800611

M3 - Article

VL - 16

JO - Electronics Letters

JF - Electronics Letters

SN - 0013-5194

IS - 22

ER -