On Some Proximity Problems of Colored Sets
文献类型：期刊论文
| 作者 | Fan, Cheng-Lin ; Luo, Jun ; Wang, Wen-Cheng ; Zhong, Fa-Rong ; Zhu, Binhai |
| 刊名 | JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
 |
| 出版日期 | 2014 |
| 卷号 | 29期号:5页码:879-886 |
| 关键词 | computational geometry colored set algorithm maximum diameter color-spanning set problem |
| ISSN号 | 1000-9000 |
| 中文摘要 | 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 |
| 语种 | 英语 |
| WOS记录号 | WOS:000342412700013 |
| 公开日期 | 2014-12-16 |
| 源URL | [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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。