No label defined (Q4454265)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2052620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2052620 |
Statements
8 March 2004
0 references
span
0 references
simple closed curve
0 references
parametrizations with initial condition
0 references
greedy algorithm
0 references
0.7526111602783203
0 references
In order to compute the span of a simple closed curve \(K\) it is sufficient to choose among parametrizations of degree 1 of \(K\) a pair of parametrizations such that the distance between them, measured by the infimum of distances between corresponding values, is greater than or equal to that for any other pair. It is not sufficient to restrict considerations to parametrizations with the best initial conditions at a glance in which the distance between initial values equals the diameter of \(K\). This is shown by an example presented by an interesting picture. For the entire collection see [Zbl 1005.00053].
0 references
