Polygonal approximation from inside #
For a planar convex body K with the origin in its interior and any r > 1, a sufficiently
fine uniform angle system produces an inscribed polygon P with
r⁻¹ • K ⊆ P ⊆ K.
The construction uses the uniform angles θ j = j * (2π / M), so the cyclic order of the
vertices is immediate. The inclusion r⁻¹ • K ⊆ P follows from two elementary facts:
r⁻¹ • Kis at distance at least(1 - r⁻¹) * ρfrom the complement ofK, whereball 0 ρ ⊆ K;- a ray hitting a chord whose endpoints have radius at least
Lmeets it at radius at leastL * cos (δ / 2), whereδis the angle subtended by the chord.
The uniform angle system with M directions.
Equations
Instances For
@[simp]
theorem
HumanVerification.CauchyCrofton.mem_convexHull_triangle_of_norm_le
{α γ t : ℝ}
(hαt : α ≤ t)
(htγ : t ≤ γ)
(hlt : γ - α < Real.pi)
{a b L s : ℝ}
(hL : 0 < L)
(ha : L ≤ a)
(hb : L ≤ b)
(hs : 0 ≤ s)
(hsle : s ≤ L * Real.cos ((γ - α) / 2))
:
s • NRR.Geometry.circleVec t ∈ (convexHull ℝ) {0, a • NRR.Geometry.circleVec α, b • NRR.Geometry.circleVec γ}
Chord estimate. A point of the plane whose direction lies in the angular sector
[α, γ] and whose norm is at most L * cos ((γ - α)/2) lies in the triangle spanned by the
origin and two points of radius at least L in the directions α and γ.