Methods

Methods

Sep 12, 2025

Methods and Their Scope

Current Binary Radial Kernels

The current formulation defines regular equal sectors, local chord–tangent lengths, triangular areas, and weighted kernels. Its proofs concern those definitions.

Earlier Methods

Algorithm Specifications

A runnable method must identify initial values, refinement or direct evaluation, arithmetic format, outputs, and stopping conditions. A geometry identity alone is not a runtime benchmark.

Extensions

Adaptive sampling, general curves, multiple seeds, and three-dimensional constructions require their own definitions and validation. No error order or performance advantage is transferred automatically from the regular-circle proof.

Foundations

Foundations

Sep 12, 2025

Document Status and Current Reference

This page preserves an earlier formulation or research method. Its notation, formulas, and embedded demonstrations belong to that version and should not be treated as the specification of the current binary radial kernels.

Read the current formulation and its analytical verification. Historical performance statements and implementation behaviour require separate validation. Earlier references to circular constants remain in this historical document; they are not inputs to the current geometric kernel definitions.

Mathematical Foundations: Turns Trigonometry & Radial Discretization

Category: Generative Radial Geometry (GRG)

GRG measures angles in turns with period‑1 primitives c(u), s(u) (no π assumed in discrete steps). Constructions proceed on quarters/sectors, summing center‑seeded primitives (chords and radial strips). Below are the core identities used across methods.

Turns Trigonometry (period‑1)

Let a full rotation be one turn. The functions c(u), s(u) are period‑1 and satisfy the usual symmetries and addition rules:

$$ c(u+1)=c(u),\quad s(u+1)=s(u),\quad c(-u)=c(u),\quad s(-u)=-s(u) $$
$$ c(u+v)=c(u)c(v)-s(u)s(v),\qquad s(u+v)=s(u)c(v)+c(u)s(v) $$

Quarter symmetry and parity yield the relations needed for GRG’s inside‑out sums, without introducing π in the discrete formulas.

Chord, Sagitta, and Radial Strip Area

For a unit circle with step Δu between consecutive samples u_L and u_R=u_L+Δu:

$$ \operatorname{chord}(\Delta u)=2\,s\!\left(\tfrac{\Delta u}{2}\right) $$
$$ \operatorname{sagitta}(\Delta u)=1-c\!\left(\tfrac{\Delta u}{2}\right) $$

The area of the center‑seeded strip (triangle O–p(u_L)–p(u_R)) equals half the cross‑product magnitude, i.e. a period‑1 sine of the step:

$$ A_{\text{strip}}(\Delta u)=\tfrac{1}{2}\,\Big(c(u_L)\,s(u_R)-s(u_L)\,c(u_R)\Big) =\tfrac{1}{2}\,s(\Delta u) $$

Discrete Perimeter and Area on a Quarter

With uniform steps Δu=\tfrac{1}{4N} on a quarter (N samples):

$$ P_{\tfrac14}(N;\text{rule})=\sum_{k=1}^{N}\operatorname{chord}(\Delta u),\qquad P(N)=4\,P_{\tfrac14}(N;\text{rule}) $$
$$ A_{\tfrac14}(N)=\sum_{k=1}^{N}\tfrac{1}{2}\,s(\Delta u)=\tfrac{N}{2}\,s\!\left(\tfrac{1}{4N}\right),\qquad A(N)=4\,A_{\tfrac14}(N) $$

Rule choice (midpoint / right‑endpoint / averaged) governs bias for arc length; strip areas use the exact triangle formula per step, remaining π‑free at finite N.

π as an Emergent Limit (turns)

From the full polygon with Δu=1/N:

$$ \pi=\lim_{N\to\infty} N\,s\!\left(\tfrac{1}{2N}\right) $$

Background & Positioning

Category: Generative Radial Geometry (GRG)

Generative Radial Geometry (GRG) builds shapes from the inside via discrete radial scans. Measurements arise by summing chords and radial trapezoids without assuming π in advance. Angles are measured in turns (period‑1), using primitives c(u), s(u) with u \in [0,1). We present GRG as a digital‑native (2025) center‑seeded approach—π‑free and complementary to classical, formula‑first geometry.

Motivation

Classical geometry is top‑down, continuous, formula‑centric. GRG is inside‑out: pick a resolution N, rotate a central ray with step Δu, and accumulate discrete contributions that converge as N grows.

Key Idea (Quarter Aggregation)

Build a quarter from center‑seeded primitives, then use symmetry.

$$\operatorname{chord}(\Delta u)=2\, s\!\left(\tfrac{\Delta u}{2}\right)$$

Quarter arc length follows from summing chords (upper/lower/midpoint/average rules). Area uses radial trapezoids on the quarter, scaled ×4. The one‑step sagitta is

$$\operatorname{sagitta}(\Delta u)=1-c\!\left(\tfrac{\Delta u}{2}\right)$$

π as an Emergent Limit (in turns)

Let the full polygon have N chords with Δu = 1/N. The chord between consecutive samples is 2·s(Δu/2), hence the polygon perimeter is C_N = 2N·s(1/(2N)). Define π (in turns) as half the circumference of the unit circle. Then:

$$\pi \,=\, \lim_{N\to\infty} N\, s\!\left(\tfrac{1}{2N}\right)$$

Dyadic variant: letting N = 2^B, we also have π = lim_{B→∞} 2^{B}·s(2^{-(B+1)}).

What GRG Adds

  • Deterministic control: explicitly choose N, the step Δu, and the rule (midpoint / right‑endpoint / average / radial‑trapezoidal Δu).
  • Turns‑based formalism: period‑1 trigonometry with c(u), s(u); quarter aggregation unifies perimeter and area.
  • Inside‑out convergence: measurements as discrete sums of center‑seeded primitives.

Page Takeaways

  • GRG is a center‑seeded, π‑free discretization framework (2025).
  • Angles are measured in turns with period‑1 primitives c(u), s(u).
  • Quarter aggregation gives simple, reproducible formulas for perimeter and area.