Login / Signup

A counterexample to a dynamic algorithm for convex hulls of line arrangements.

Binay K. BhattacharyaHazel EverettGodfried T. Toussaint
Published in: Pattern Recognit. Lett. (1991)
Keyphrases
  • convex hull
  • dynamic programming
  • optimal solution
  • learning algorithm
  • objective function
  • matching algorithm
  • model checking
  • recursive algorithm
  • high dimensional
  • k means
  • simulated annealing
  • primal dual