COMPUTING THE K-RELATIVE NEIGHBORHOOD GRAPHS IN EUCLIDEAN PLANE

Full metadata record

DC Field	Value	Language
dc.contributor.author	SU, TH	en_US
dc.contributor.author	CHANG, RC	en_US
dc.date.accessioned	2014-12-08T15:05:22Z	-
dc.date.available	2014-12-08T15:05:22Z	-
dc.date.issued	1991	en_US
dc.identifier.issn	0031-3203	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3900	-
dc.identifier.uri	http://dx.doi.org/10.1016/0031-3203(91)90065-D	en_US
dc.description.abstract	In this paper, we will propose an O(n5/3log 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.	en_US
dc.language.iso	en_US	en_US
dc.subject	COMPUTATIONAL GEOMETRY	en_US
dc.subject	PATTERN RECOGNITION	en_US
dc.subject	RELATIVE NEIGHBORHOOD GRAPH	en_US
dc.subject	GEOGRAPHICAL NEIGHBORHOOD GRAPH	en_US
dc.subject	BOTTLENECK MATCHING	en_US
dc.title	COMPUTING THE K-RELATIVE NEIGHBORHOOD GRAPHS IN EUCLIDEAN PLANE	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/0031-3203(91)90065-D	en_US
dc.identifier.journal	PATTERN RECOGNITION	en_US
dc.citation.volume	24	en_US
dc.citation.issue	3	en_US
dc.citation.spage	231	en_US
dc.citation.epage	239	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
dc.contributor.department	Institute of Computer Science and Engineering	en_US
dc.identifier.wosnumber	WOS:A1991FD48300006	-
dc.citation.woscount	7	-
Appears in Collections:	Articles