A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem

06/10/2017
by   Sharath Raghvendra, et al.
0

Given a set of n points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum of Euclidean length of its edges. This incredibly challenging problem has been studied for more than four decades and has been only recently shown to be NP-Hard. In this paper we present a novel polynomial-time algorithm that computes a 14-approximation of the minimum weight triangulation -- a constant that is significantly smaller than what has been previously known. In our algorithm, we use grids to partition the edges into levels where shorter edges appear at smaller levels and edges with similar lengths appear at the same level. We then triangulate the point set incrementally by introducing edges in increasing order of their levels. We introduce the edges of any level i+1 in two steps. In the first step, we add edges using a variant of the well-known ring heuristic to generate a partial triangulation Â_i. In the second step, we greedily add non-intersecting level i+1 edges to Â_i in increasing order of their length and obtain a partial triangulation A_ i+1. The ring heuristic is known to yield only an O( n)-approximation even for a convex polygon and the greedy heuristic achieves only a Θ(√(n))-approximation. Therefore, it is surprising that their combination leads to an improved approximation ratio of 14. For the proof, we identify several useful properties of Â_i and combine it with a new Euler characteristic based technique to show that Â_i has more edges than T_i; here T_i is the partial triangulation consisting of level < i edges of some minimum weight triangulation. We then use a simple greedy stays ahead proof strategy to bound the approximation ratio.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2020

The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem

The 2-Opt heuristic is a simple improvement heuristic for the Traveling ...
research
11/09/2021

A PTAS for the horizontal rectangle stabbing problem

We study rectangle stabbing problems in which we are given n axis-aligne...
research
11/28/2018

Computing Vertex-Weighted Multi-Level Steiner Trees

In the classical vertex-weighted Steiner tree problem (VST), one is give...
research
12/06/2020

Solving the Minimum Convex Partition of Point Sets with Integer Programming

The partition of a problem into smaller sub-problems satisfying certain ...
research
06/26/2019

Upper and Lower Bounds on Approximating Weighted Mixed Domination

A mixed dominating set of a graph G = (V, E) is a mixed set D of vertice...
research
10/08/2020

Improved approximation ratios for two Euclidean maximum spanning tree problems

We study the following two maximization problems related to spanning tre...
research
02/05/2019

Dynamic hierarchies in temporal directed networks

The outcome of interactions in many real-world systems can be often expl...

Please sign up or login with your details

Forgot password? Click here to reset