Aperture-Angle and Hausdorff-Approximation of Convex Figures
نویسندگان
چکیده
منابع مشابه
Hausdorff approximation of 3D convex polytopes
Let P be a convex polytope in R, d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm selects k < n vertices of P whose convex hull is the approximating polytope. The rate of approximation, in the Hausdorff distance sense, is best possible in the worst case. An analogous algorithm, where the role of vertices is...
متن کاملAsymptotic Approximation of Convex Curves; the Hausdorff Metric Case
where κ(t) is the curvature of C given as a function of the arclength t and l the length of C. See also McClure and Vitale [7] and for asymptotic formulae for approximation with respect to the Hausdorff metric in higher dimensions R. Schneider [8],[9] and P.M. Gruber [5]. In this article we extend the asymptotic formulae (1) by deriving the second terms in the asymptotic expansions of δ(C,P i n...
متن کاملApproximation of Convex Figures by Pairs of Rectangles
We consider the problem of approximating a convex gure in the plane by a pair r R of homothetic that is similar and parallel rectangles with r C R We show the existence of such a pair where the sides of the outer rectangle are at most twice as long as the sides of the inner rectangle thereby solving a problem posed by P olya and Szeg o If the n vertices of a convex polygon C are given as a sort...
متن کاملHausdorff dimension and Diophantine approximation
In the present survey paper, we explain how the theory of Hausdorff dimension and Hausdorff measure is used to answer certain questions in Diophantine approximation. The final section is devoted to a discussion around the Diophantine properties of the points lying in the middle third Cantor set.
متن کاملAperture angle optimization problems
Let P and Q be two disjoint convex polygons in the plane with m and n vertices, respectively. Given a point x in P, the aperture angle of x with respect to Q is deened as the angle subtended by the cone that contains Q, has apex at x, and has its two rays emanating from x tangent to Q. We present algorithms with complexities O(n logm) and O(n+m) for computing the maximum aperture angle with res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2007
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-007-9039-5