A fixed parameter algorithm for optimal convex partitions

DOI10.1016/j.jda.2008.07.002zbMath1154.90571OpenAlexW2082092907MaRDI QIDQ1002101

Andreas Spillner

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

zbMATH Keywords

fixed-parameter algorithmconvex partition

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Related Items

Solving the minimum convex partition of point sets with integer programming

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