Institutional Repository
| simplifying 3d polygonal chains under the discrete fréchet distance | |
| Bereg Sergey; Jiang Minghui; Wang Wencheng; Yang Boting; Zhu Binhai | |
| 2008 | |
| Conference Name | 8th Latin American TheoreticalINformatics Symposium, LATIN 2008 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 630-641 |
| Conference Date | 37353 |
| Conference Place | Buzios, Brazil |
| Indexed Type | EI |
| Publish Place | Germany |
| ISSN | 3029743 |
| ISBN | 3540787720 |
| Department | (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, |
| English Abstract | 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 |
| Keyword | Algorithms Computational Complexity Mathematical Models Polynomials Problem Solving |
| Sponsorship | Microsoft; UOL; IFIP; HP; Yahoo |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/10472 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Bereg Sergey,Jiang Minghui,Wang Wencheng,et al. simplifying 3d polygonal chains under the discrete fréchet distance[C]. Germany,2008:630-641. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| simplifying 3d polyg（510KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment