1994
DOI: 10.1007/bf01189576
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic approximation of convex curves

Abstract: Abstract. L. Fejes Tóth gave asymptotic formulae as n → ∞ for the distance between a smooth convex disc and its best approximating inscribed or circumscribed polygons with at most n vertices, where the distance is in the sense of the symmetric difference metric. In this paper these formulae are extended by specifying the second terms of the asymptotic expansions. Tools are from affine differential geometry.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
13
0

Year Published

1998
1998
2012
2012

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 15 publications
(14 citation statements)
references
References 10 publications
1
13
0
Order By: Relevance
“…Given a convex curve γ , one wants to approximate it by circumscribed polygons using area as the distance between the curve and an approximating polygon; this problem makes sense in the Euclidean, hyperbolic and spherical geometries. Formula (2) provides an asymptotic expansion for the distance between γ and its best approximating n-gon; in the Euclidean case, the term a 1 was found by Fejes Toth [35,36] (see [20] for a complete proof, [18] for the value of the term a 2 and [7,8] for surveys on approximating convex bodies by polytops). The approach via interpolating Hamiltonians provides a novel view point in the approximation theory of smooth convex curves by polygons.…”
Section: Remarkmentioning
confidence: 99%
“…Given a convex curve γ , one wants to approximate it by circumscribed polygons using area as the distance between the curve and an approximating polygon; this problem makes sense in the Euclidean, hyperbolic and spherical geometries. Formula (2) provides an asymptotic expansion for the distance between γ and its best approximating n-gon; in the Euclidean case, the term a 1 was found by Fejes Toth [35,36] (see [20] for a complete proof, [18] for the value of the term a 2 and [7,8] for surveys on approximating convex bodies by polytops). The approach via interpolating Hamiltonians provides a novel view point in the approximation theory of smooth convex curves by polygons.…”
Section: Remarkmentioning
confidence: 99%
“…The next proposition is a consequence of (8) (consider the cases x − p ≤ α and x − p ≥ α separately): (22) For any ξ > 0 there is > 0 such that for all sufficiently large n we have the following: for each p ∈ bd C and x ∈ H p with x − p ≥ /n…”
Section: Facets and Dirichlet-voronoi Cellsmentioning
confidence: 99%
“…For d = 2 Ludwig [22] specified the second term of an asymptotic series development of δ V (C, P c (n) ). The complete series was given by Tabachnikov [27] in the form of a result on periodic trajectories of the "dual" or "exterior" billiard determined by C.…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation
“…There it was also shown that for a smooth convex disc K, the vertices of any sequence of best approximating inscribed polygons are uniformly distributed in bd K with respect to affine length. For sequences of best approximating circumscribed polygons it is shown there that the points where the sides of the polygons touch K are uniformly distributed in bd K with respect to affine length (see also [12]). That this also holds for general convex discs with positive affine length, follows from the next theorem, since the vertices of best approximating inscribed polygons lie on bd K and the sides of best approximating circumscribed polygons touch bd K.…”
Section: Theorem 4 For Everymentioning
confidence: 99%