A heuristic triangulation algorithm
Journal of Algorithms
Approximation algorithms for geometric problems
Approximation algorithms for NP-hard problems
Quasi-greedy triangulations approximating the minimum weight triangulation
Journal of Algorithms
Minimum convex partition of a constrained point set
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
The Power of Non-Rectilinear Holes
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
The minimum weight triangulation problem with few inner points
Computational Geometry: Theory and Applications
A fixed parameter algorithm for the minimum number convex partition problem
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Minimum weight triangulation by cutting out triangles
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The traveling salesman problem with few inner points
Operations Research Letters
Parameterized Complexity
Computational geometry column 53
ACM SIGACT News
Minimum convex partitions and maximum empty polytopes
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. The algorithm is based on techniques developed for the Minimum Weight Triangulation problem. On a set P of n points the algorithm runs in O(2^kk^4n^3+nlogn) time. The parameter k is the number of points in P lying in the interior of the convex hull of P.