Advertisement
Published in:
2006 | OriginalPaper | Chapter
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators
Authors : Christian Knauer, Andreas Spillner
Published in: Graph-Theoretic Concepts in Computer Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We present a fixed-parameter algorithm which computes for a set
P
of
n
points in the plane in
$O(2^{c \sqrt{k} \log k} \cdot k \sqrt{k} n^3)$
time a minimum weight triangulation. The parameter
k
is the number of points in
P
that lie in the interior of the convex hull of
P
and
$c = (2 + \sqrt{2})/(\sqrt{3} -- \sqrt{2}) < 11$
.