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

Andrzej Lingas Valeriu Soltan

Published in: ISAAC (1996)

Keyphrases

convex hull
minkowski sum
min cut
convex optimization
partitioning algorithm
simple polygon
minimum length
graph cuts
piecewise linear
square error
globally optimal
data sets
energy minimization
level set
convex constraints
linear programming
pairwise
feature space