Skip to content

Author

Linda Kleist

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Triangle Covers of Polygons: Approximation Algorithms and Complexity

We study the geometric set cover problems of covering and partitioning a polygon into a minimum number of triangles. While the decision version of the covering problem is known to be APX-hard and $\exists\mathbb R$-complete (even for polygons without holes and vertices in general position), the computational complexity...

Linda Kleist, Lena Scherzer · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.