Skip to main content
Log in

Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Given a function y = f(x) in one variable, we consider the problem of computing the single-peaked (unimodal) curve y =φ(x) minimizing the L2-distance between them. If the input function f is a histogram with O(n) steps or a piecewise linear function with O(n) linear pieces, we design algorithms for computing φ in linear time. We also give an algorithm to approximate f with a function consisting of the minimum number of unimodal pieces under the condition that each unimodal piece is within a fixed L2-distance from the corresponding portion of f.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Jinhee Chun, Kunihiko Sadakane or Takeshi Tokuyama.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chun, J., Sadakane, K. & Tokuyama, T. Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Algorithmica 44, 103–115 (2006). https://doi.org/10.1007/s00453-005-1201-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-005-1201-y

Navigation