In this paper we study curve-restricted min-\# simplification of polygonal curves, in which the vertices of the simplified curve can be placed at any place on the input curve, provided that they respect the order along the input curve. For local directed Hausdorff distance from the input to the simplified curve  , we present an approximation algorithm that computes a curve whose number of vertices is at most twice the number of the vertices of the curve-restricted simplification with the minimum number of vertices .
The goal in the min-\# curve simplification problem is to reduce the number of the vertices of a polygonal curve without changing its shape significantly. We study curve-restricted min-\# simplification of polygonal curves, in which the vertices of the simplified curve can be placed on any point of the input curve, provided that they respect the order along that curve. For local directed Hausdorff distance from the input to the simplified curve in \mathbb{R , we present an approximation algorithm that computes a curve whose number of links is at most twice the minimum possible .
R
In this paper we
The goal in the min-\# curve simplification problem is to reduce the number of the vertices of a polygonal curve without changing its shape significantly. We
R
at any place on
on any point of
R
the input
that
A
in \mathbb{R
R
vertices
links
R
number of the vertices of the curve-restricted simplification with the minimum number of vertices
minimum possible