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.
@article{arxiv.2001.10298,
title = {On the complexity of the middle curve problem},
author = {Maike Buchin and Nicole Funk and Amer Krivošija},
journal= {arXiv preprint arXiv:2001.10298},
year = {2020}
}