simplifying 3d polygonal chains under the discrete fréchet distance

	simplifying 3d polygonal chains under the discrete fréchet distance
	Bereg Sergey; Jiang Minghui; Wang Wencheng; Yang Boting; Zhu Binhai
	2008
会议名称	8th Latin American TheoreticalINformatics Symposium, LATIN 2008
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	630-641
会议日期	37353
会议地点	Buzios, Brazil
收录类别	EI
出版地	Germany
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,
摘要	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
关键词	Algorithms Computational Complexity Mathematical Models Polynomials Problem Solving
主办者	Microsoft; UOL; IFIP; HP; Yahoo
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/10472
专题	基础软件与系统重点实验室
推荐引用方式 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.