On piecewise linear approximation of planar Jordan curves (Q1891049)
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 758555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On piecewise linear approximation of planar Jordan curves |
scientific article; zbMATH DE number 758555 |
Statements
On piecewise linear approximation of planar Jordan curves (English)
0 references
24 October 1995
0 references
Authors' conclusion: The existence and uniqueness of a shortest polygonal path in a compact planar set bounded by two polygonal planar Jordan curves is investigated. The shortest polygonal path in a polygonally bounded planar set is referred to as minimum perimeter polygon. Further, the convergence of a sequence of minimum perimeter polygons to a rectifiable planar Jordan curve is shown. An application of the minimum perimeter polygon to the piecewise linear approximation of boundaries of planar compact Jordan sets by a gridding technique is described. A numerical example is presented.
0 references
polygonal approximation
0 references
polygonal planar Jordan curves
0 references
shortest polygonal path
0 references
polygonally bounded planar set
0 references
minimum perimeter polygon
0 references
convergence
0 references
piecewise linear approximation
0 references
numerical example
0 references
0.7861343622207642
0 references
0.7775296568870544
0 references
0.7704571485519409
0 references
0.7639453411102295
0 references
