How to take short cuts (Q1199128): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rectifiable sets and the traveling salesman problem / rank | |||
Normal rank |
Latest revision as of 16:11, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How to take short cuts |
scientific article |
Statements
How to take short cuts (English)
0 references
16 January 1993
0 references
Let \(S\) be a rectifiable curve in Euclidean plane. The authors describe a geometric construction for adding short cuts so that every two points of \(S\) can be linked by a path along the union of \(S\) and the added short cuts. The construction guarantees that the length of the path is always at most the Euclidean distance of the linked points times a constant depending only on \(S\). The construction is provided for a polygon \(P\) approximating \(S\) and is based on the Voronoi polygons of the edges of \(P\). This approach supplies the not necessarily computable construction given by \textit{P. Jones} [Invent. Math. 102, No. 1, 1-15 (1990; Zbl 0731.30018)].
0 references
path
0 references
polygon
0 references
rectifiable curve
0 references
short cut
0 references
Voronoi polygon
0 references