Largest area convex hull of axis-aligned squares Squares Based on Imprecise Data
文献类型：会议论文
| 作者 | Ovidiu Daescu; Wenqi Ju; Jun Luo; Binhai Zhu |
| 出版日期 | 2011 |
| 会议名称 | 17th Annual International Computing and Combinatorics Conference, COCOON 2011 |
| 英文摘要 | Data collected from real world are often imprecise. A few algorithms were proposed recently to compute the convex hull of maximum area when the axis-aligned squares model is used to represent imprecise input data. If squares are non-overlapping and of different sizes, the time complexity of the best known algorithm is O(n7). If squares are allowed to overlap but have the same size, the time complexity of the best known algorithm is O(n 5). In this paper, we improve both bounds by a quadratic factor, i.e., to O(n5) and O(n3), respectively |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/3605]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2011 |
| 推荐引用方式 GB/T 7714 | Ovidiu Daescu,Wenqi Ju,Jun Luo,et al. Largest area convex hull of axis-aligned squares Squares Based on Imprecise Data[C]. 见:17th Annual International Computing and Combinatorics Conference, COCOON 2011. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。