Loading...
Path simplification under difference area measure
Daneshpajouh, S ; Sharif University of Technology
283
Viewed
- Type of Document: Article
- DOI: 10.1109/CSICC.2009.5349405
- Abstract:
- In this paper, we consider path simplification problem under difference area (diff-area) measure. Diff-area measure is defined as AA(Q) AB(Q) , where AA(Q) is the area under Q and above P and AB(Q) is the area above Q and under P (sec Figure 1). Bose et al. [1] presented an approximation algorithm for finding a simplificd path with at most k verticcs that minimizes the cliff-area measure which only works on i-monotone paths. The constraint of being i-monotone is restrictive in some applications like tracking bird migration paths or map boundary simplification. Here, we extend the method of Rosc et al. [1] and present algorithms with the same time complexities as theirs for gcneral paths. ©2009 IEEE
- Keywords:
- Bird migration ; Monotone paths ; Time complexity ; Approximation algorithms
- Source: 2009 14th International CSI Computer Conference, CSICC 2009, 20 October 2009 through 21 October 2009, Tehran ; 2009 , Pages 276-279 ; 9781424442621 (ISBN)
- URL: http://ieeexplore.ieee.org/document/5349405