A finite descent method for Steiner's problem of inpolygons with minimal circumference (Q3738935)

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 3972642
Language Label Description Also known as
default for all languages
No label defined
    English
    A finite descent method for Steiner's problem of inpolygons with minimal circumference
    scientific article; zbMATH DE number 3972642

      Statements

      A finite descent method for Steiner's problem of inpolygons with minimal circumference (English)
      0 references
      0 references
      1986
      0 references
      optimal inpolygon
      0 references
      discrete optimization
      0 references
      descent model
      0 references
      convex polygon
      0 references
      minimal circumference
      0 references
      Given a convex polygon \(P_ m\) the author asks for an inscribed polygon with minimal circumference whose vertices are incident to all edges of \(P_ m\). For solving this problem the polygon \(P_ m\) is successively reflected and a path obeying certain side constraints is looked for in this new figure. Since there are only finitely many possibilities for an optimal path the problem can be solved in finite time. Some numerical examples illustrate the approach.
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references