|Title:||All Triangulations Are Reachable Via Sequences of Edge-Flips: An Elementary Proof
|Authors:||Eliyahu Osherovich and and Alfred M. Bruckstein
|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.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2007/CIS/CIS-2007-02), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CIS technical reports of 2007
To the main CS technical reports page
Computer science department, Technion