On piecewise linear approximation of planar Jordan curves (Q1891049): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0377-0427(94)90040-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1968978149 / rank | |||
Normal rank |
Latest revision as of 11:11, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On piecewise linear approximation of planar Jordan curves |
scientific article |
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