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
会议日期	37353
会议地点	Buzios, Brazil
关键词	Algorithms Computational complexity Mathematical models Polynomials Problem solving
页码	630-641
英文摘要	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
收录类别	EI
会议主办者	Microsoft; UOL; IFIP; HP; Yahoo
会议录	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议录出版地	Germany
ISSN号	3029743
ISBN号	3540787720
内容类型	会议论文
源URL	[http://124.16.136.157/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]. 见:8th Latin American TheoreticalINformatics Symposium, LATIN 2008. Buzios, Brazil. 37353.