On the complexity of the middle curve problem

01/28/2020
by   Maike Buchin, et al.
0

For a set of curves, Ahn et al. introduced the notion of a middle curve and gave algorithms computing these with run time exponential in the number of curves. Here we study the computational complexity of this problem: we show that it is NP-complete and give approximation algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/03/2020

Approximating (k,ℓ)-Median Clustering for Polygonal Curves

In 2015, Driemel, Krivošija and Sohler introduced the (k,ℓ)-median probl...
research
09/16/2020

Approximating the packedness of polygonal curves

In 2012 Driemel et al. <cit.> introduced the concept of c-packed curves ...
research
09/02/2020

Isotopic Arrangement of Simple Curves: an Exact Numerical Approach based on Subdivision

This paper presents the first purely numerical (i.e., non-algebraic) sub...
research
06/13/2012

The Computational Complexity of Sensitivity Analysis and Parameter Tuning

While known algorithms for sensitivity analysis and parameter tuning in ...
research
09/04/2017

Computing Storyline Visualizations with Few Block Crossings

Storyline visualizations show the structure of a story, by depicting the...
research
11/02/2017

On the complexity of optimal homotopies

In this article, we provide new structural results and algorithms for th...
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...

Please sign up or login with your details

Forgot password? Click here to reset