Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions.

Andrzej Lingas Valeriu Soltan

Published in: Theory Comput. Syst. (1998)

Keyphrases

convex hull
minkowski sum
min cut
minimum length
convex optimization
convex sets
image segmentation
piecewise linear
globally optimal
facet defining
genetic algorithm
simple polygon
global optimality
global minimum
energy minimization
graph cuts
np hard
feature space
case study