Abstract
We present a fixed-parameter algorithm which computes for a set P of n points in the plane in O(2c√k log k · k√kn 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+√2)/(√3-√2) < 11. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Knauer, C., & Spillner, A. (2006). A fixed-parameter algorithm for the minimum weight triangulation problem based on small graph separators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4271 LNCS, pp. 49–57). Springer Verlag. https://doi.org/10.1007/11917496_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
