Approximate Curve-Restricted Simplification of Polygonal Curves

11/12/2018
by   Ali Gholami Rudi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2018

On Optimal Min-# Curve Simplification Problem

In this paper we consider the classical min--# curve simplification prob...
research
10/28/2017

Fast Fréchet Distance Between Curves With Long Edges

Computing Fréchet distance between two curves takes roughly quadratic ti...
research
05/14/2020

Approximating p-Mean Curve of Large Data-Sets

Given p, k and a set of polygonal curves P_1,…,P_L, the p-mean curve M o...
research
06/07/2018

Progressive Simplification of Polygonal Curves

Simplifying polygonal curves at different levels of detail is an importa...
research
08/27/2019

A simplified L-curve method as error estimator

The L-curve method is a well-known heuristic method for choosing the reg...
research
08/23/2018

StretchDenoise: Parametric Curve Reconstruction with Guarantees by Separating Connectivity from Residual Uncertainty of Samples

We reconstruct a closed denoised curve from an unstructured and highly n...
research
11/28/2013

A local Gaussian filter and adaptive morphology as tools for completing partially discontinuous curves

This paper presents a method for extraction and analysis of curve--type ...

Please sign up or login with your details

Forgot password? Click here to reset