Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
101
click to vote
CAGD
2008
124
views
more
CAGD 2008
»
All triangulations are reachable via sequences of edge-flips: an elementary proof
15 years 2 months ago
Download
www.cs.technion.ac.il
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.
Eliyahu Osherovich, Alfred M. Bruckstein
Real-time Traffic
CAGD 2008
|
Diagonal Flip Operation
|
Possible Triangulations
|
Simple Proof
|
claim paper
Post Info
More Details (n/a)
Added
09 Dec 2010
Updated
09 Dec 2010
Type
Journal
Year
2008
Where
CAGD
Authors
Eliyahu Osherovich, Alfred M. Bruckstein
Comments
(0)
Researcher Info
CAGD 1998 Study Group
Computer Vision