Searching for a Compressed Polyline with a Minimum Number of Vertices

TL;DR

This paper presents an approximate method for simplifying polylines by reducing vertices to the minimum within a specified tolerance, improving storage and processing efficiency.

Contribution

It introduces a novel approximate algorithm to find the minimal-vertex polyline within a given tolerance, addressing limitations of existing methods.

Findings

The proposed method effectively reduces vertices while maintaining shape fidelity.

It outperforms traditional simplification techniques in minimizing vertices.

The approach is applicable to various practical polyline simplification tasks.

Abstract

There are many practical applications that require simplification of polylines. Some of the goals are to reduce the amount of information necessary to store, improve processing time, or simplify editing. The simplification is usually done by removing some of the vertices, making the resultant polyline go through a subset of the source polyline vertices. However, such approaches do not necessarily produce a new polyline with the minimum number of vertices. The approximate solution to find a polyline, within a specified tolerance, with the minimum number of vertices is described in this paper.