Gray codes for non-crossing partitions and dissections of a convex polygon.
Clemens HuemerFerran HurtadoMarc NoyElsa Omaña-PulidoPublished in: Discret. Appl. Math. (2009)
Keyphrases
- convex hull
- minkowski sum
- convex polyhedra
- convex sets
- error correction
- convex optimization
- clustering algorithm
- image denoising
- linear programming
- piecewise linear
- database
- convex relaxation
- convex programming
- digital convexity
- image restoration
- equivalence classes
- error correcting codes
- space partitioning
- simple polygon
- learning algorithm
- convexity properties
- neural network