Location of Repository

Speeding up Simplification of Polygonal Curves using Nested Approximations

By Pierre-françois Marteau and Gildas Ménier

Abstract

Abstract: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used between any two successive level

Topics: the problem can be informally stated as follows, given a digitized curve X of N ≥ 2 ordered
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.371.7253
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://hal.archives-ouvertes.f... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.