Abstract
We study the number of edge flips required to transform any triangulation of an n-vertex spiral polygon into any other. We improve the upper bound from 4n−6 to 3n−9 flips and show a lower bound of 2n−8 flips. Instead of using a single canonical triangulation as the intermediate point in the transformation between two triangulations, we use a family of closely-connected triangulations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
