On the Problem of Steiner

Author:

Melzak Z.A.

Abstract

There is a well-known elementary problem:(S3) Given a triangle T with the vertices a1, a2, a3, to find in the plane of T the point p which minimize s the sum of the distances |pa1| + |pa2| + |pa3|.p, called the Steiner point of T, is unique: if an angle of T is ≥ 2π/3 then p is its vertex, otherwise p lies inside T and the sides of T subtend at p the angle 2π/3. In the latter case p is called the S-point of T, and it can be found by the following simple construction: let a12 be the third vertex of the equilateral triangle whose other two vertices are a1 and a2, and whose interior does not overlap that of T, let C be the circle through a1, a2 a12; then p is the intersection of C and the straight segment a12a3. It is easily proved that any one of the three ellipses through p with two of the vertices of T as foci is tangent at p to the circle through p about the third vertex of T.

Publisher

Canadian Mathematical Society

Subject

General Mathematics

Cited by 180 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. On Uniqueness in Steiner Problem;International Mathematics Research Notices;2024-02-21

2. Steiner Tree Problems;Encyclopedia of Optimization;2024

3. A Lagrangian Program Detecting the Weighted Fermat-Steiner-Fréchet Multitree for a Fréchet N-multisimplex in Euclidean N-space;Springer Proceedings in Mathematics & Statistics;2024

4. A new heuristic for the Euclidean Steiner Tree Problem in $${\mathbb {R}}^n$$;TOP;2022-09-06

5. Method for constructing cost-effective networks by mimicking human walking track superposition;Journal of Asian Architecture and Building Engineering;2022-04-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3