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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
27
click to vote
CAGD
2008
favorite
Email
discuss
report
124
views
more
CAGD 2008
»
All triangulations are reachable via sequences of edge-flips: an elementary proof
13 years 11 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