Login / Signup

Finite packing and covering by congruent convex domains.

Károly J. Böröczky
Published in: Discret. Comput. Geom. (2003)
Keyphrases
  • real world
  • finite dimensional
  • application domains
  • case study
  • convex hull
  • convex programming
  • databases
  • learning algorithm
  • linear programming
  • complex domains
  • continuous domains
  • convex constraints