A quadratic time algorithm for the minmax length triangulation
SIAM Journal on Computing
Quasi-greedy triangulations approximating the minimum weight triangulation
Journal of Algorithms
Maximum weight triangulation and graph drawing
Information Processing Letters
A lower bound for &bgr;-skeleton belonging to minimum weight triangulations
Computational Geometry: Theory and Applications
On ß-skeleton as a subgraph of the minimum weight triangulation
Theoretical Computer Science
On Computing and Drawing Maxmin-Height Covering Triangulation
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A quasi-polynomial time approximation scheme for minimum weight triangulation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
Algorithms for optimal area triangulations of a convex polygon
Computational Geometry: Theory and Applications
| Hi-index | 0.89 |
We consider the following planar max-min length triangulation problem: given a set of n points in the Euclidean plane, find a triangulation such that the length of the shortest edge in the triangulation is maximized. In this paper, a linear time algorithm is proposed for computing the max-min length triangulation of a set of points in convex position. In addition, an O(nlogn) time algorithm is proposed for computing the max-min length k-set triangulation of a set of points in convex position, where we are to compute a set of k vertices such that the max-min length triangulation on them is minimized over all possible k-set. We further show that the graph version of max-min length triangulation is NP-complete, and some common heuristics such as greedy algorithm are in general not able to give a bounded-ratio approximation to the max-min length triangulation.