Login / Signup

Efficient lower and upper bounds of the diagonal-flip distance between triangulations.

Jean-Luc BarilJean Marcel Pallo
Published in: Inf. Process. Lett. (2006)
Keyphrases
  • lower and upper bounds
  • lower bound
  • upper bound
  • special case
  • euclidean distance
  • lagrangian relaxation
  • lower bounding
  • linear programming
  • valid inequalities
  • exact and approximate