Abstract
Given three points in the plane, we construct the plane geometric network of smallest geometric dilation that connects them. The geometric dilation of a plane network is defined as the maximum dilation (distance along the network divided by Euclidean distance) between any two points on its edges. We show that the optimum network is either a line segment, a Steiner tree, or a curve consisting of two straight edges and a segment of a logarithmic spiral.
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.
