Place the Vertices Anywhere on the Curve and Simplify

Article type: Research Article

Authors: Rudi, Ali Gholami^{; *}

Affiliations: Department of Electrical and Computer Engineering, Babol Noshirvani University of Technology, Babol, Mazandaran, Iran. [email protected]

Correspondence: [*] Address for correspondence: Department of Electrical and Computer Engineering, Babol Noshirvani University of Technology, Babol, Mazandaran, Iran.

Abstract: A polygonal curve is simplified to reduce its number of vertices, while maintaining similarity to its original shape. Numerous results have been published for vertex-restricted simplification, in which the vertices of the simplified curve are a subset of the vertices of the input curve. In curve-restricted simplification, i.e. when the vertices of the simplified curve are allowed to be placed on the edges of the input curve, the number of vertices may be much more reduced. In this paper, we present algorithms for computing curve-restricted simplifications of polygonal curves under the local Hausdorff distance measure.

Keywords: Curve simplification, geometric algorithms, computational geometry

DOI: 10.3233/FI-2021-2041

Journal: Fundamenta Informaticae, vol. 180, no. 3, pp. 275-287, 2021