On Some Proximity Problems of Colored Sets

ISCAS OpenIR

	On Some Proximity Problems of Colored Sets
	Fan, Cheng-Lin; Luo, Jun; Wang, Wen-Cheng; Zhong, Fa-Rong; Zhu, Binhai
	2014
发表期刊	JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
ISSN	1000-9000
卷号	29 期号:5 页码:879-886
摘要	The maximum diameter color-spanning set problem (MaxDCS) is defined as follows: given n points with m colors, select m points with m distinct colors such that the diameter of the set of chosen points is maximized. In this paper, we design an optimal O(n log n) time algorithm using rotating calipers for MaxDCS in the plane. Our algorithm can also be used to solve the maximum diameter problem of imprecise points modeled as polygons. We also give an optimal algorithm for the all farthest foreign neighbor problem (AFFN) in the plane, and propose algorithms to answer the farthest foreign neighbor query (FFNQ) of colored sets in two- and three-dimensional space. Furthermore, we study the problem of computing the closest pair of color-spanning set (CPCS) in d-dimensional space, and remove the log m factor in the best known time bound if d is a constant.; The maximum diameter color-spanning set problem (MaxDCS) is defined as follows: given n points with m colors, select m points with m distinct colors such that the diameter of the set of chosen points is maximized. In this paper, we design an optimal O(n log n) time algorithm using rotating calipers for MaxDCS in the plane. Our algorithm can also be used to solve the maximum diameter problem of imprecise points modeled as polygons. We also give an optimal algorithm for the all farthest foreign neighbor problem (AFFN) in the plane, and propose algorithms to answer the farthest foreign neighbor query (FFNQ) of colored sets in two- and three-dimensional space. Furthermore, we study the problem of computing the closest pair of color-spanning set (CPCS) in d-dimensional space, and remove the log m factor in the best known time bound if d is a constant.
收录类别	SCI
关键词	Computational Geometry Colored Set Algorithm Maximum Diameter Color-spanning Set Problem
部门归属	[Fan, Cheng-Lin; Luo, Jun] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China. [Luo, Jun] Huawei Noahs Ark Lab, Shatin, Hong Kong, Peoples R China. [Wang, Wen-Cheng] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China. [Zhong, Fa-Rong] Zhejiang Normal Univ, Coll Math Phys & Informat Technol, Jinhua 321004, Peoples R China. [Zhu, Binhai] Montana State Univ, Dept Comp Sci, Bozeman, MT 59717 USA.
语种	英语
WOS记录号	WOS:000342412700013
引用统计	被引频次：5[WOS] [WOS记录] [WOS相关记录]
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16823
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Fan, Cheng-Lin,Luo, Jun,Wang, Wen-Cheng,et al. On Some Proximity Problems of Colored Sets[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2014,29(5):879-886.
APA	Fan, Cheng-Lin,Luo, Jun,Wang, Wen-Cheng,Zhong, Fa-Rong,&Zhu, Binhai.(2014).On Some Proximity Problems of Colored Sets.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,29(5),879-886.
MLA	Fan, Cheng-Lin,et al."On Some Proximity Problems of Colored Sets".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 29.5(2014):879-886.