Approximating Monotone Polygonal Curves Using the Uniform Metric

@inproceedings{Varadarajan1996ApproximatingMP,
  title={Approximating Monotone Polygonal Curves Using the Uniform Metric},
  author={Kasturi R. Varadarajan},
  booktitle={Symposium on Computational Geometry},
  year={1996}
}
We consider the problem of approximating a monotone polygonal chain C by another polygonal chain C’ whose vertices are constrained to be a subset of the set of vertices of C. The goal is to minimize the number of vertices needed in the approximation C’. We use the uniform metric as the error criterion for the approximation. We consider two problems. (1) Given e ? O, find an approximation, among all approximations whose error is at most e. that has the smallest number of vertices. We give an 0… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-5 of 5 references

On polygonal chain approximation, in Computational Morphology

  • A. Melkman, J. O’Rourke
  • Elsevier Science Publishers,
  • 1988
Highly Influential
7 Excerpts

Polygonal approximations of a curve – formulations and algorithms

  • H. Imai, M. Iri
  • Computational Morphology (Ed. G. T. Toussaint…
  • 1988
Highly Influential
5 Excerpts

Clique partitions

  • T. Feder, R. Motwani
  • graph [27] S. Suri, A linear time algorithm for…
  • 1986
Highly Influential
3 Excerpts