Expected computations on color spanning sets
点击次数：
第一作者：Chao Li
发表时间：2015-01-01
发表刊物：Journal of Combinatorial Optimization
所属单位：数理与信息工程学院
文献类型：期刊
卷号：Vol.29
期号：No.3
页面范围：589-604
ISSN号：1382-6905;1573-2886
关键字：Expected;value;Imprecise;data;Computational;geometry
摘要：Given a set of \(n\) points, each is painted by one of the \(k\) given colors, we want to choose \(k\) points with distinct colors to form a color spanning set. For each color spanning set, we can construct the convex hull and the smallest axis-aligned en
是否译文：否