Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-Overlapping Axis-Aligned Squares
文献类型：会议论文
| 作者 | Wenqi Ju; Jun Luo |
| 出版日期 | 2010 |
| 会议名称 | 4th International Frontiers of Algorithmics Workshop, FAW 2010 |
| 英文摘要 | Given a set of n equal size and non-overlapping axis-aligned squares, we need to choose exactly one point in each square to make the area of a convex hull of the resulting point set as large as possible. Previous algorithm [10] on this problem gives an optimal algorithm with O(n 3) running time. In this paper, we propose an approximation algorithm which runs in O(nlogn) time and gives a convex hull with area larger than the area of the optimal convex hull minus the area of one square. 漏 2010 Springer-Verlag Berlin Heidelberg |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/3135]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2010 |
| 推荐引用方式 GB/T 7714 | Wenqi Ju,Jun Luo. Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-Overlapping Axis-Aligned Squares[C]. 见:4th International Frontiers of Algorithmics Workshop, FAW 2010. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。