Abstract
We show that a point set of cardinality n in the plane cannot be the vertex set of more than O(59 n n −6) straight-edge triangulations of its convex hull. This improves the previous upper bound of 276.75 n+ O(log( n)) .
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.
