The Complexity of MaxMin Length Triangulation
Computational Geometry
2012-08-02 v1 Data Structures and Algorithms
Abstract
In 1991, Edelsbrunner and Tan gave an O(n^2) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin Length triangulation is an NP-complete problem. The proof implies that (unless P=NP), there is no polynomial-time approximation algorithm that can approximate the problem within any polynomial factor.
Cite
@article{arxiv.1208.0202,
title = {The Complexity of MaxMin Length Triangulation},
author = {Sándor P. Fekete},
journal= {arXiv preprint arXiv:1208.0202},
year = {2012}
}
Comments
7 pages, 3 figures