A fixed parameter algorithm for optimal convex partitions
From MaRDI portal
Publication:1002101
DOI10.1016/j.jda.2008.07.002zbMath1154.90571OpenAlexW2082092907MaRDI QIDQ1002101
Publication date: 23 February 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2008.07.002
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum weight triangulation problem with few inner points
- The traveling salesman problem with few inner points
- FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
- A heuristic triangulation algorithm
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Parameterized and Exact Computation
- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
- Algorithms and Computation
- Minimum convex partition of a constrained point set