Convex Polygons are Cover-Decomposable.

Dömötör Pálvölgyi Géza Tóth

Published in: Discret. Comput. Geom. (2010)

Keyphrases

minkowski sum
digital convexity
convex hull
convex polyhedra
cell complexes
convex optimization
database
piecewise linear
risk minimization
markov networks
real time
data sets
databases
information retrieval
feature selection
np complete