All triangulations are reachable via sequences of edge-flips: an elementary proof

  • Authors:

  • E. Osherovich;A. M. Bruckstein

  • Affiliations:

  • Computer Science Department, Technion Haifa, 32000 Israel;Computer Science Department, Technion Haifa, 32000 Israel

  • Venue:
  • Computer Aided Geometric Design
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.