Sciweavers

DCG   2000
Wall of Fame | Most Viewed DCG-2000 Paper
25
Voted
DCG
2000
104views more  DCG 2000»
13 years 6 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source104
2Download preprint from source94
3Download preprint from source90
4Download preprint from source84
5Download preprint from source79
6Download preprint from source76
7Download preprint from source75
8Download preprint from source67
9Download preprint from source59
10Download preprint from source59
11Download preprint from source59
12Download preprint from source57
13Download preprint from source55
14Download preprint from source53
15Download preprint from source45
16Download preprint from source44