Abstract
In this paper, we will propose an O(n 5 3 log n) algorithm to construct the k-relative neighborhood graph of a n points set in Euclidean plane, for fixed k. Based on this result, the Euclidean bottleneck matching problem can also be solved in the same time complexity. The k-relative neighborhood graph is a generalization of the relative neighborhood graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
