Largest area convex hull of imprecise data based on axis-aligned squares
文献类型：期刊论文
| 作者 | Ju, Wenqi; Luo, Jun; Zhu, Binhai; Daescu, Ovidiu |
| 刊名 | Journal of Combinatorial Optimization
 |
| 出版日期 | 2013 |
| 英文摘要 | In recent years, more and more algorithms related to imprecise data have been proposed. Specifically, some algorithms on computing the maximum area convexhull are designed recently when the imprecise data are modeled as non-overlapping axis-aligned squares or as equal size squares. The time complexity of the best known algorithm based on non-overlapping axis-aligned squares is O(n 7). If the squares have equal size and can overlap, the time complexity of the best known algorithm is O(n 5). In this paper, we improve the former from O(n 7) to O(n 5) and improve the latter from O(n 5) to O(n 2). These results are obtained by exploiting the non-trivial geometric properties of the problems. © 2012 Springer Science+Business Media, LLC.(10 refs) |
| 收录类别 | SCI |
| 原文出处 | http://link.springer.com/article/10.1007/s10878-012-9488-5 |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/5059]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | Journal of Combinatorial Optimization |
| 推荐引用方式 GB/T 7714 | Ju, Wenqi,Luo, Jun,Zhu, Binhai,et al. Largest area convex hull of imprecise data based on axis-aligned squares[J]. Journal of Combinatorial Optimization,2013. |
| APA | Ju, Wenqi,Luo, Jun,Zhu, Binhai,&Daescu, Ovidiu.(2013).Largest area convex hull of imprecise data based on axis-aligned squares.Journal of Combinatorial Optimization. |
| MLA | Ju, Wenqi,et al."Largest area convex hull of imprecise data based on axis-aligned squares".Journal of Combinatorial Optimization (2013). |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。