中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
On Some Proximity Problems of Colored Sets
Author: Fan, Cheng-Lin ; Luo, Jun ; Wang, Wen-Cheng ; Zhong, Fa-Rong ; Zhu, Binhai
Keyword: computational geometry ; colored set ; algorithm ; maximum diameter color-spanning set problem
Source: JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
Issued Date: 2014
Volume: 29, Issue:5, Pages:879-886
Indexed Type: SCI
Department: [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.
Abstract: 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.
English Abstract: 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.
Language: 英语
WOS ID: WOS:000342412700013
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16823
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
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-01-01,29(5):879-886.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Fan, Cheng-Lin]'s Articles
[Luo, Jun]'s Articles
[Wang, Wen-Cheng]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Fan, Cheng-Lin]‘s Articles
[Luo, Jun]‘s Articles
[Wang, Wen-Cheng]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace