Streaming algorithms for line simplification

Abam, M. A ; Sharif University of Technology | 2007

187 Viewed
  1. Type of Document: Article
  2. DOI: 10.1145/1247069.1247103
  3. Publisher: 2007
  4. Abstract:
  5. We study the following variant of the well-known line-simpli- ficationproblem: we are getting a possibly infinite sequence of points p 0,p1,p2,... in the plane defining a polygonal path, and as wereceive the points we wish to maintain a simplification of the pathseen so far. We study this problem in a streaming setting, where weonly have a limited amount of storage so that we cannot store all thepoints. We analyze the competitive ratio of our algorithms, allowingresource augmentation: we let our algorithm maintain a simplificationwith 2k (internal) points, and compare the error of oursimplification to the error of the optimal simplification with k points. We obtain the algorithms with O(1) competitive ratio forthree cases: convex paths where the error is measured using theHausdorff distance (or Frechet distance), xy-monotone paths where the error is measured using theHausdorff distance (or Frechet distance), and general paths where the error is measured using theFrechet distance. In the first case the algorithm needs O(k) additionalstorage, and in the latter two cases the algorithm needs O(k 2) additional storage. Copyright 2007 ACM
  6. Keywords:
  7. Algorithms ; Error analysis ; Problem solving ; Frechet distance ; Hausdorff distance ; Line simplification ; Streaming algorithm ; Computational geometry
  8. Source: 23rd Annual Symposium on Computational Geometry, SCG'07, Gyeongju, 6 June 2007 through 8 June 2007 ; 2007 , Pages 175-183 ; 1595937056 (ISBN); 9781595937056 (ISBN)
  9. URL: https://dl.acm.org/doi/abs/10.1145/1247069.1247103