{"title":"On computing Fréchet distance of two paths on a convex polyhedron","authors":"A. Maheshwari, Jiehua Yi","doi":"10.22215/etd/2004-06003","DOIUrl":null,"url":null,"abstract":"We present a polynomial time algorithm for computing Frechet distance between two simple paths on the surface of a convex polyhedron.","PeriodicalId":243365,"journal":{"name":"European Workshop on Computational Geometry","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Workshop on Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22215/etd/2004-06003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24
Abstract
We present a polynomial time algorithm for computing Frechet distance between two simple paths on the surface of a convex polyhedron.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
