Author:
Chen Danny Z.,Wang Chao,Wang Haitao
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Barequet, G., Chen, D.Z., Daescu, O., Goodrich, M., Snoeyink, J.: Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica 33(2), 150–167 (2002)
2. Chun, J., Sadakane, K., Tokuyama, T.: Linear time algorithm for approximating a curve by a single-peaked curve. Algorithmica 44(2), 103–115 (2006)
3. Chun, J., Sadakane, K., Tokuyama, T., Yuki, M.: Peak-reducing fitting of a curve under the L
p
metric. Interdisciplinary Information Sciences 11(2), 191–198 (2005)
4. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
5. Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Implementation and evaluation of decision trees with range and region splitting. Constraints 2, 401–427 (1997)