Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n.

Dania El-Khechen Thomas Fevens John Iacono

Published in: CCCG (2006)

Keyphrases

convex optimization
piecewise linear
partitioning algorithm
quadratic function
globally optimal
convex relaxation
constrained minimization
neural network
database systems
probabilistic model
convex sets
finite dimensional