Login / Signup

The asymptotic enumeration of rooted convex polyhedra.

Edward A. BenderL. Bruce Richmond
Published in: J. Comb. Theory, Ser. B (1984)
Keyphrases
  • convex polyhedra
  • convex hull
  • minimum distance
  • search space
  • minkowski sum
  • lower bound
  • worst case
  • image analysis
  • data sets
  • active learning
  • upper bound
  • binary images