Abstract

We prove the following fact for arbitrary finite point sets $$S$$S in the plane. Either, S is a subset of one of the well-known sets of points whose triangulation is unique and has dilation 1. Or there exists a number $$\Delta (S) > 1$$Δ(S)>1 such that each finite plane graph containing $$S$$S among its vertices has dilation $$\ge \Delta (S)$$?Δ(S).

Full Text
Paper version not known

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 call

Disclaimer: 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.