Abstract
We study the problems of (approximately) representing a functional curve in 2-D by a set of curves with fewer peaks. Let f be an input nonnegative piecewise linear functional curve of size n. We consider the following problems. (1) Uphill-downhill pair representation (UDPR): Find two nonnegative piecewise linear curves, one nondecreasing and one nonincreasing, such that their sum approximately represents f. (2) Unimodal representation (UR): Find a set of k nonnegative unimodal (single-peak) curves such that their sum approximately represents f. (3) Fewer-peak representation (FPR): Find a nonnegative piecewise linear curve with at most k peaks that approximately represents f. For each problem, we consider two versions. For UDPR, we study the feasibility version and the min-ε version. For each of the UR and FPR problems, we study the min-k version and the min-ε version. Little work has been done previously on these problems. We solve all problems (except the UR min-ε) in optimal O(n) time, and the UR min-ε version in O(n + mlogm) time, where m < n is the number of peaks of f. Our algorithms are based on new geometric observations and interesting techniques.
This research was supported in part by NSF under Grants CCF-0515203 and CCF-0916606.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Chun, J., Sadakane, K., Tokuyama, T.: Linear time algorithm for approximating a curve by a single-peaked curve. Algorithmica 44(2), 103–115 (2006)
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)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Implementation and evaluation of decision trees with range and region splitting. Constraints 2, 401–427 (1997)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining with optimized two-dimensional association. ACM Trans. Database Systems 26, 179–213 (2001)
Gabow, H.N., Bentley, J., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. of the 16th Annual ACM Symposium on Theory of Computing (STOC), pp. 135–143 (1984)
Goodrich, M.: Efficient piecewise-linear function approximation using the uniform metric. In: Proc. of the 10th Annual ACM Symposium on Computational Geometry, pp. 322–331 (1994)
Guha, S., Shim, K.: A note on linear time algorithms for maximum error histograms. IEEE Transactions on Knowledge and Data Engineering 19(7), 993–997 (2007)
Stout, Q.F.: Unimodal regression via prefix isotonic regression. Computational Statistics & Data Analysis 53(2), 289–297 (2008)
Varadarajan, K.: Approximating monotone polygonal curves using the uniform metric. In: Proc. of the 12th Annual ACM Symposium on Computational Geometry, pp. 311–318 (1996)
Wang, C., Luan, S., Tang, G., Chen, D.Z., Earl, M.A., Yu, C.X.: Arc-modulated radiation therapy (AMRT): A single-arc form of intensity-modulated arc therapy. Physics in Medicine and Biology 53(22), 6291–6303 (2008)
Webb, S.: The Physics of Three-Dimensional Radiation Therapy. Institute of Physics Publishing, Bristol (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, D.Z., Wang, C., Wang, H. (2010). Representing a Functional Curve by Curves with Fewer Peaks. In: Kaplan, H. (eds) Algorithm Theory - SWAT 2010. SWAT 2010. Lecture Notes in Computer Science, vol 6139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-13731-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13730-3
Online ISBN: 978-3-642-13731-0
eBook Packages: Computer ScienceComputer Science (R0)