The DOI matches its Crossref record.
On the Problem of Steiner
Open accessAbstract
There is a well-known elementary problem: (S 3) Given a triangle T with the vertices a 1, a 2, a 3, to find in the plane of T the point p which minimize s the sum of the distances |pa 1| + |pa 2| + |pa 3|. 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 a 12 be the third vertex of the equilateral triangle whose other two vertices are a 1 and a 2, and whose interior does not overlap that of T, let C be the circle through a 1, a 2 a 12; then p is the intersection of C and the straight segment a 12 a 3. 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Gilbert, E. N., & Pollak, H. O. (1968) · SIAM Journal on Applied Mathematics · doi:10.1137/0116001 · Cited by 690
Metadata
- Authors
- Melzak, Z. A.
- Venue
- Canadian Mathematical Bulletin
- Publisher
- Canadian Mathematical Society
- Published
- 1961-05
- Volume
- 4
- Issue
- 2
- Pages
- 143-148
- ISSN
- 0008-4395 (ISSN-L)
- 1496-4287
- OpenAlex
- W1990488643
- Cited by
- 281
- References
- 0
- FWCI
- 0.77
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Problem of Steiner. https://app.cochat.ai/papers/10.4153/cmb-1961-016-2
- The paper
- Melzak, Z. A. (1961). On the Problem of Steiner. Canadian Mathematical Bulletin. https://doi.org/10.4153/cmb-1961-016-2
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.