On piecewise linear approximation of planar Jordan curves (Q1891049): Difference between revisions

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.