Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Comment: Algorithms for computing relative neighbourhood graph

Comment: Algorithms for computing relative neighbourhood graph

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

http://iet.metastore.ingenta.com/content/journals/10.1049/el_19800611
Loading

Related content

content/journals/10.1049/el_19800611
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
See Also
This article has the following associated article(s):
Algorithms for computation of relative neighbourhood graph
Replies
The following responses have been recieved for this comment:
Reply: Algorithms for computing relative neighbourhood graph
This is a required field
Please enter a valid email address