| 题名: | simplifying 3d polygonal chains under the discrete fréchet distance |
| 作者: | Bereg Sergey
; Jiang Minghui
; Wang Wencheng
; Yang Boting
; Zhu Binhai
|
| 会议文集: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| 会议名称: | 8th Latin American TheoreticalINformatics Symposium, LATIN 2008
|
| 会议日期: | 37353
|
| 出版日期: | 2008
|
| 会议地点: | Buzios, Brazil
|
| 关键词: | Algorithms
; Computational complexity
; Mathematical models
; Polynomials
; Problem solving
|
| 出版地: | Germany
|
| 收录类别: | EI
|
| ISSN: | 3029743
|
| ISBN: | 3540787720
|
| 部门归属: | (1) Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, United States; (2) Department of Computer Science, Utah State University, Logan, UT 84322-4205, United States; (3) Institute of Software, Chinese Academy of Sciences,
|
| 主办者: | Microsoft; UOL; IFIP; HP; Yahoo
|
| 英文摘要: | A well-known measure to characterize the similarity of two polygonal chains is the famous Fre´chet distance. In this paper, for the first time, we consider the problem of simplifying 3D polygonal chains under the discrete Fre´chet distance. We |
| 内容类型: | 会议论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/10472
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| simplifying 3d polygonal chains under the discrete fréchet distance.pdf（510KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Bereg Sergey,Jiang Minghui,Wang Wencheng,et al. simplifying 3d polygonal chains under the discrete fréchet distance[C]. 见:8th Latin American TheoreticalINformatics Symposium, LATIN 2008. Buzios, Brazil. 37353.
|
|
|
