Search for dissertations about: "Magdalene Grantson Borgelt"
Found 2 swedish dissertations containing the words Magdalene Grantson Borgelt.
-
1. Fixed parameter algorithms and other results for convex patitions
Abstract : It is known that the minimum edge length convex partition MWCP of polygons with holes (an example of a PSLG) is NP-hard. Partitioning polygons with holes into the minimum number of convex polygons MNCP is also known to be NP-hard. READ MORE
-
2. Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results
Abstract : In this thesis I study two-dimensional geometric optimization problems for which it is difficult to find efficient, exact, deterministic algorithms. All known solutions to these problems require time that is exponential in the total size of the input. READ MORE