New algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model
文献类型：会议论文
| 作者 | Wenqi Ju; Jun Luo |
| 出版日期 | 2009 |
| 会议名称 | 21st Annual Canadian Conference on ComputationalGeometry, CCCG 2009 |
| 英文摘要 | In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based onthe parallel line segment model. The running time of our algorithms for maximum perimeter problem is O(n4) which improve over the previous results of O(n 5) in [12]. For maxi- mum are problem with different size of parallel line segments [12] gives O(n3) algorithms. We give O(n log n)algorithms with the assumption that all parallel line segments have the same size |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/2661]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2009 |
| 推荐引用方式 GB/T 7714 | Wenqi Ju,Jun Luo. New algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model[C]. 见:21st Annual Canadian Conference on ComputationalGeometry, CCCG 2009. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。