Approximating p-Mean Curve of Large Data-Sets

05/14/2020
by   Sepideh Aghamolaei, et al.
0

Given p, k and a set of polygonal curves P_1,…,P_L, the p-mean curve M of P_1,…,P_L is the curve with at most k vertices that minimizes the L_p norm of the vector of Fréchet distances between each P_i and M. Also, the p-mean curve is the cluster representative (center) of L_p-based clusterings such as k-center, k-medians, and k-means. For p→∞, this problem is known to be NP-hard, with lower bound 2.25-ϵ on its approximation factor for any ϵ>0. By relaxing the number of vertices to O(k), we were able to get constant factor approximation algorithms for p-mean curve with p=O(1) and p→∞, for curves with few changes in their directions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2018

Approximate Curve-Restricted Simplification of Polygonal Curves

In this paper we study curve-restricted min-# simplification of polygona...
research
05/03/2018

Approximating (k,ℓ)-center clustering for curves

The Euclidean k-center problem is a classical problem that has been exte...
research
01/28/2020

On the complexity of the middle curve problem

For a set of curves, Ahn et al. introduced the notion of a middle curve ...
research
11/08/2017

Curve Reconstruction via the Global Statistics of Natural Curves

Reconstructing the missing parts of a curve has been the subject of much...
research
02/21/2019

On the hardness of computing an average curve

We study the complexity of clustering curves under k-median and k-center...
research
04/05/2018

A Survey of Miss-Ratio Curve Construction Techniques

Miss-ratio curve (MRC), or equivalently hit-ratio curve (HRC), construct...
research
03/12/2021

Search of fractal space-filling curves with minimal dilation

We introduce an algorithm for a search of extremal fractal curves in lar...

Please sign up or login with your details

Forgot password? Click here to reset