A New GRG Formulation: Circle and Area from Binary Radial Modules

A New GRG Formulation: Circle and Area from Binary Radial Modules

Jun 16, 2026

A GRG Formulation: Circle and Area from a Binary Radial Framework

Generative Radial Geometry describes circular measures through a finite binary radial framework. Its working quantities are a radius, a full Turn, a binary resolution, and local chord–tangent constructions.

About the Current GRG Formulation

This page presents the documented binary radial formulation, with geometric definitions and an explicit verification of its measurement kernels. Earlier approaches, including Original Projection and previous Turns formulations, remain part of the research history.

The geometric construction, kernel accuracy, and computational efficiency are separate subjects. The analysis below establishes accuracy for regular symmetric sectors. It does not establish a performance advantage or prescribe an implementation.

The weighted area proposal is documented in A Symmetric GRG Kernel for Area. The geometric ratio notation and proofs below are an analytical clarification of the documented triangles and kernels.

Binary Turns and Resolution

A full rotation is one Turn. Resolve it into equal sectors. The nondegenerate chord–tangent formulas on this page require at least four sectors.

$$
N=2^b,\qquad b\ge2,\qquad R>0.
$$
$$
t_b=\frac1N,\qquad \text{half-sector width}=\frac1{2N}.
$$

One Symmetric Radial Sector

Let a be the distance from the centre to the internal chord, h half that chord, and e half the external tangent side. The tangent is perpendicular to the central radius. The two boundary rays intersect both the circle and this tangent.

$$
a^2+h^2=R^2,\qquad e=R\frac ha.
$$
Symmetric binary radial sector with chord and tangent side A circle with a symmetric radial sector. The internal chord lies between two points on the circle. The external tangent side lies on the tangent line perpendicular to the central radius. O R tᵦ tangent line external tangent side upper sector boundary lower sector boundary internal chord
Figure 1 — Symmetric sector: internal chord, central radius, and external tangent side.

Define dimensionless ratios from these constructed lengths:

$$
c_b=\frac aR,\qquad s_b=\frac hR,\qquad q_b=\frac ha.
$$
$$
c_b^2+s_b^2=1,\qquad q_b=\frac{s_b}{c_b},\qquad c_b=\frac1{\sqrt{1+q_b^2}}.
$$

These symbols denote geometric ratios. They do not specify a trigonometric software routine.

Circumference Kernels

$$
L_i=2h,\qquad L_t=2e.
$$

The arithmetic balance and the classical Snell–Huygens weighted balance give:

$$
\begin{aligned}C_m&=\frac N2(L_i+L_t)=NR(s_b+q_b),\\C_{SH}&=\frac N3(2L_i+L_t)=\frac{2NR}{3}(2s_b+q_b).\end{aligned}
$$

The weighting is a known local arc approximation. This formulation uses it as a kernel within the binary radial framework; the weighting itself is not claimed as an original GRG result.

Area Elements and Kernels

The internal triangle has base 2h and height a. The external triangle has base 2e and height R.

$$
\begin{aligned}I_b&=ah=R^2c_bs_b=R^2\frac{q_b}{1+q_b^2},\\E_b&=Re=R^2q_b.\end{aligned}
$$
$$
A_{\mathrm{in}}=NI_b,\qquad A_{\mathrm{out}}=NE_b.
$$

The arithmetic area estimate and the proposed internal–external weighting are:

$$
\begin{aligned}A_m&=\frac N2(I_b+E_b),\\A_w&=\frac N3(I_b+2E_b).\end{aligned}
$$
$$
A_w=\frac{NR^2}{3}\left(\frac{q_b}{1+q_b^2}+2q_b\right).
$$

Geometric Refinement Bound

The following identity is used to verify regular equal-sector bisection. It is a geometric consequence, not an attribution of a particular numerical algorithm to GRG.

At four sectors the half-sector triangle has equal legs, so q₂ = 1. Bisecting its direction gives the following ratio, obtained by normalising the boundary direction and adding it to the central unit direction:

$$
q_{b+1}=\frac{q_b}{1+\sqrt{1+q_b^2}}.
$$

The denominator is at least two. Induction therefore gives:

$$
0\lt q_b\le 2^{2-b}=\frac4N.
$$

This proves the scale bound needed for the global error estimates. It uses the regular bisection geometry; it does not require a precomputed full-Turn length or area.

Kernel Accuracy: Analytical Verification

Define the local integral below solely as an analytical reference for the exact sector measures. It is not an input to the measurement kernels.

$$
F(q)=\int_0^q\frac{dt}{1+t^2}.
$$

Parameterising the circular boundary by its slope gives exact sector arc length 2RF(q) and exact sector area R²F(q). Thus the fixed full-Turn reference measures satisfy:

$$
C_T(R)=2NRF(q_b),\qquad A_T(R)=NR^2F(q_b).
$$
$$
F(q)=q-\frac{q^3}{3}+\frac{q^5}{5}+O(q^7).
$$

Substitution into the circumference kernels yields:

$$
\begin{aligned}C_m-C_T&=NR\left(\frac{q_b^3}{6}-\frac{q_b^5}{40}+O(q_b^7)\right),\\C_{SH}-C_T&=NR\left(\frac{q_b^5}{10}+O(q_b^7)\right).\end{aligned}
$$

For area:

$$
\begin{aligned}A_m-A_T&=NR^2\left(-\frac{q_b^3}{6}+\frac{3q_b^5}{10}+O(q_b^7)\right),\\A_w-A_T&=NR^2\left(\frac{2q_b^5}{15}+O(q_b^7)\right).\end{aligned}
$$

The area weighting cancels the cubic local residual. Combining these expansions with the geometric scale bound proves, for fixed radius and exact arithmetic:

$$
\begin{aligned}C_m-C_T&=O(N^{-2}),& C_{SH}-C_T&=O(N^{-4}),\\A_m-A_T&=O(N^{-2}),& A_w-A_T&=O(N^{-4}).\end{aligned}
$$

These are asymptotic error statements, not claims of exact equality at finite resolution or guarantees about floating-point performance.

Area Bounds

The geometric inner and outer triangles bound each exact sector. The two balanced area estimates provide a tighter bracket as well:

$$
A_{\mathrm{in}}\le A_m\le A_T\le A_w\le A_{\mathrm{out}}.
$$

For a direct verification, write the normalised kernels as M(q) and W(q). Both differences vanish at zero, and:

$$
\begin{aligned}\frac{d}{dq}\bigl(F(q)-M(q)\bigr)&=\frac{q^2(1-q^2)}{2(1+q^2)^2},\\\frac{d}{dq}\bigl(W(q)-F(q)\bigr)&=\frac{2q^4}{3(1+q^2)^2}.\end{aligned}
$$

Both derivatives are nonnegative for 0 ≤ q ≤ 1, which covers the sectors considered here. Consequently the bracket follows for every b ≥ 2, rather than only for tested resolutions.

Refinement and Quarter-Step Sampling

$$
N_{b+1}=2N_b,\qquad t_{b+1}=\frac{t_b}{2},\qquad \Delta u=\frac{t_b}{4}=\frac1{4N}.
$$

The related area article specifies quarter-step sampling within a module. The verification above concerns the complete sector triangles. An implementation using internal samples must specify how those samples evaluate the same elements; the sampling parameter alone does not define an additional area kernel.

Binary refinement of a radial circle Three circles divided into increasing binary sector counts, showing refinement from coarse radial modules to a smoother circular construction. b = 2, N = 4 b = 3, N = 8 b = 4, N = 16
Figure 2 — Binary sector refinement at N = 4, 8, and 16.

Computational Efficiency and Research Scope

Binary resolution is compatible with binary angular indices and power-of-two scaling. A performance advantage for the complete calculation must nevertheless be measured.

A reproducible comparison must use equal accuracy targets, include generation or retrieval of the local measures, account for precomputation and memory, and specify arithmetic precision, rounding, hardware, and execution time. Stability in fixed-point arithmetic requires a separate error analysis.

The results established here concern the documented regular chord–tangent geometry and its kernels. Historical originality and implementation efficiency are separate investigations.

Exactness at the Chosen Scale (GRG)

Exactness at the Chosen Scale (GRG)

Oct 19, 2025

Exactness at the Chosen Scale (GRG)

Summary.
Generative Radial Geometry (GRG) builds shapes ring-by-ring on a discrete support (pixels, steps, layers, gear teeth). In this setting, cell counts can be exact for the specified discrete object. Continuous area, Euclidean perimeter and angular measures require separate definitions and error analysis. Geometric approximation and numerical rounding must be distinguished from exact counting.

Why this matters

  • No drift: Each added ring contributes exactly its intended count; errors do not accumulate as shapes grow.
  • Implementation-first: The geometry matches how hardware and software actually operate on lattices, layers, and stepper motions.
  • Predictable outcomes: Offsets, masks, and toolpaths behave consistently across radii and angles.
  • Continuity bridge: As the scale refines, discrete measures converge to their continuous counterparts.

Setting and basic definitions

  • Chosen scale (s): the unit of discreteness (pixel size, machining step, layer height).
  • Discrete domain (Ls): a lattice at scale s (e.g., a square grid) with unit cell measure 1.
  • Radial generation rule (Gs): a constructive procedure that grows shapes by rings while enforcing symmetry (e.g., 4/8-fold on a square grid), monotone radius (rings do not cross), and arc closure (discrete arcs close exactly at intended angles).
  • Radial object (D(r; s)): the union of rings generated from the center up to discrete radius r.
  • Operational measures:
    Area μs(D) = number of cells in D; Perimeter Ps(D) as counts of admissible boundary steps; Angle count Θs as discrete angular increments used to build and close arcs.

Core properties

  1. Ring additivity (no drift).
    For each integer step in radius:
    $$\mu_s\!\left(D(r{+}1; s)\right) - \mu_s\!\left(D(r; s)\right) \;=\; \lvert A_{r+1} \rvert,$$
    where \(A_{r+1}\) is the ring generated at radius \(r{+}1\). This identity holds by construction for all r.
  2. Arc closure.
    Discrete arcs generated with \(G_s\) close exactly at their intended angular multiples. Looping paths return to the origin without residual.
  3. Symmetry and monotonicity.
    The rule preserves lattice symmetries and grows rings without self-intersections, ensuring stable counts for all radii.
  4. Convergence to the continuous limit.
    As \(s \to 0\):
    $$\mu_s(D)\,s^{2} \;\longrightarrow\; \text{continuous area}$$
    $$P_s(D)\cdot s \;\longrightarrow\; \text{continuous perimeter}$$
    $$\Theta_s \;\longrightarrow\; \text{continuous angle}$$
    π appears here as the analytic reference (e.g., \( \pi r^{2} \), \( 2\pi r \)).
Measuring Shape

Measuring Shape

Oct 12, 2025

Generative Radial Geometry (GRG): measuring shape to change perspective

This page presents concise formulas and proofs showing how GRG replaces constants like $\pi$ with shape measures (circles, hemispheres, ellipses, polygons) and with unit-sum quadratures. The goal is twofold: measurement precision and operational advantage (stability, variance/error reduction, traceability), even in asymmetric scenarios.

1) Principle

In GRG, many occurrences of $2\pi$, $4\pi$ or $\pi$ are not “mysteries” but the area/volume of a shape in the natural domain (e.g., directions, frequencies). By changing the measure on that domain (circular units: turn, hemi, sphere) the constant is absorbed and the integral becomes a normalized average.

2) Core theorems

Theorem 1 — Circular measure equivalence

Let $S^1$ be the unit circle of directions with arc-length measure $\lambda$ so that $\lambda(S^1)=2\pi$. Define the normalized measure $\mu=\lambda/(2\pi)$ with $\mu(S^1)=1$. Then for all $g\in L^1(S^1)$:

$$ \int_{S^1} g \, d\lambda \;=\; 2\pi \int_{S^1} g \, d\mu . $$

Proof. By definition of $\mu$. For $S^2$ the same holds with $\lambda(S^2)=4\pi$ and for the hemisphere with $2\pi$.

Theorem 2 — Anisotropic measure (no symmetry required)

Let $\rho(\theta)\ge 0$ with $\int \rho(\theta)\,d\theta = 1$ be an angular density (possibly non-uniform). Define the weighted measure $d\nu(\theta):=\rho(\theta)\,d\theta$. For all $g\in L^1$:

$$ \int g(\theta)\,\rho(\theta)\,d\theta \;=\; \mathbb{E}_{\theta\sim \rho}\!\big[g(\theta)\big]. $$

Interpretation. The “shape” of the domain is deformed according to $\rho$. Precision comes from encoding asymmetry in the measure, not from any pre-existing symmetry.

Theorem 3 — Radial quadratures with unit-sum weights

There exist sets of directions $\{\hat u_k\}_{k=1}^{N}\subset S^2$ and weights $w_k>0$ with $\sum_k w_k = 1$ such that, for every $g$ in a target family (e.g., polynomials in $\mu=\cos\theta$ up to degree $t$, or spherical harmonics up to degree $t$):

$$ \int_{S^2} g(\hat u)\, d\Omega \;=\; \sum_{k=1}^{N} w_k\, g(\hat u_k). $$

Note. Such cubatures (e.g., spherical t-designs or refined symmetric polyhedra) give controllable accuracy with $N=O(t^2)$.

3) Operational propositions: “removing $\pi$”

Proposition A — Fourier pair in turns (Hz), no $2\pi$

With frequency in cycles/s (Hz) and phase in turns, the Fourier pair

$$ X(f)=\int_{-\infty}^{\infty} x(t)\,e^{-i\,2 f t}\,dt , $$
$$ x(t)=\int_{-\infty}^{\infty} X(f)\,e^{+i\,2 f t}\,df . $$

is equivalent to the classical pair with $\omega=2\pi f$. Proof. Substitute $\omega=2\pi f$ and $d\omega=2\pi\,df$.

Proposition B — RC integral: rad/s vs Hz

$$ \int_{0}^{\infty} \frac{d\omega}{1+(\omega\tau)^2} \;=\; \frac{\pi}{2\,\tau} $$
$$ \Longleftrightarrow\quad \int_{0}^{\infty} \frac{df}{1+(2\pi f \tau)^2} \;=\; \frac{1}{4\,\tau} . $$

Proof. Use $\omega=2\pi f$. The constant $\pi$ is a unit-conversion factor.

4) Demonstrative examples (non–“pure geometry”, explicit shapes)

4.1 Radiometry (Lambert): the number is the area of a disk

For a perfectly diffuse surface,

$$ E \;=\; L \int_{\text{hemisphere}} \cos\theta \, d\Omega . $$

In spherical coordinates $d\Omega=\sin\theta\, d\theta\, d\varphi$, $\varphi\in[0,2\pi)$, $\theta\in[0,\tfrac{\pi}{2}]$. Then

$$ \int_{\text{hemisphere}} \cos\theta \, d\Omega \;=\; \int_0^{2\pi}\! d\varphi \int_0^{\pi/2}\! \cos\theta \sin\theta\, d\theta \;=\; 2\pi \cdot \tfrac{1}{2} \;=\; \pi . $$

Hence $E=\pi L$. With the “hemi” measure (hemisphere $=1$) the average is $\langle \cos\theta\rangle_{\text{hemi}} = \tfrac{1}{2}$ and, expressed per-hemi, $E_{\text{hemi}} = L \cdot \tfrac{1}{2}$. With the projected “Lambert” measure $d\Sigma = \tfrac{\cos\theta}{\pi}\, d\Omega$ (unit disk area), $\int d\Sigma=1$ and therefore $E = L$. In all cases the constant is a shape measure.

4.2 Signals/Control (RC): angle as shape

With the substitution $\omega\tau = \tan\theta$, the integral

$$ \int_0^\infty \frac{d\omega}{1+(\omega\tau)^2} $$

becomes a measure of an angle on the unit circle (arc from $0$ to $\tfrac{\pi}{2}$), which explains $\tfrac{\pi}{2}$. In “turn/Hz” units that angle is $\tfrac{1}{4}$, giving $\tfrac{1}{4\tau}$. Same content, different shape and measure.

4.3 Statistics (Cauchy as a projection of the circle)

If $\Theta \sim \operatorname{Unif}(-\tfrac{\pi}{2},\tfrac{\pi}{2})$ and $X=\gamma \tan\Theta$, then

$$ f_X(x) \;=\; \frac{1}{\pi \gamma}\,\frac{1}{1+(x/\gamma)^2} . $$

Interpretation: $X$ is the tangent projection of a point uniformly distributed on a circle. In “turn” units, let $\Phi \sim \operatorname{Unif}(-\tfrac{1}{4},\tfrac{1}{4})$ and $\Theta = 2\pi \Phi$; with respect to the turn-normalized angular measure (total length $=1$) the normalization constant is absorbed. Converting back to radians restores $1/(\pi\gamma)$.

5) Asymmetry: elliptical metrics and weighted measures

For anisotropic phenomena introduce an elliptical metric $M\succ 0$ and define $r_M(x)=\sqrt{x^\top M x}$. The “balls” of $r_M$ are ellipses, and many constants are absorbed by switching to $M$-radial coordinates. Any directional density $\rho(\theta)$ defines $d\nu=\rho\,d\theta$: integration becomes a unit-sum average without invoking symmetry.

6) Precise discrete re-determination (quadratures)

Design sets $\{(\hat u_k,w_k)\}$ with $\sum_k w_k=1$ that integrate exactly a useful family (e.g., $\{1,\cos\theta,\sin\theta,\cos2\theta,\sin2\theta\}$ for low-order anisotropic BRDFs, or spherical harmonics up to degree $t$). This yields a precise discrete scheme: constants like “$4\pi$” or “$2\pi$” become simply “sum of weights = 1”.

7) Practical conversions (GRG ↔ classical form)

Domain Classical form GRG form Observation
Radiometry (Lambert) $E=\pi L$ $E=L$ with unit projected measure $\pi$ = area of the projected disk
Signals (RC) $\displaystyle \int \frac{d\omega}{1+(\omega\tau)^2}=\frac{\pi}{2\tau}$ $\displaystyle \int \frac{df}{1+(2\pi f\tau)^2}=\frac{1}{4\tau}$ $\pi$ = rad↔turn conversion
Statistics (Cauchy) $\frac{1}{\pi\gamma}\frac{1}{1+(x/\gamma)^2}$ $\frac{1}{\gamma}\frac{1}{1+(x/\gamma)^2}$ with angle in turns $\pi$ = length of the angular domain
Fields/Fluxes $4\pi$ factors on $S^2$ Average over sphere with $\sum w_k=1$ $4\pi$ = area of the unit sphere

8) Measurable benefits

  • Numerical stability: fewer fixed large/small factors, better conditioning.
  • Variance reduction: with anisotropic $\rho$, MC error shrinks where it matters.
  • Traceability: results come pre-normalized (averages on 1); conversion back to standards is multiplication by $2\pi$ or $4\pi$.

9) Validation protocol (A/B)

  1. Select 3 cases (Lambert, RC, Cauchy/Maxwell).
  2. Define the GRG measure (turn/hemi/sphere or weighted $\rho$) and the quadratures (degree $t$).
  3. Compare to the classical baseline at equal budget (samples/time).
  4. Metrics: relative error, variance, conservation (energy/flux), stability along pipelines.
  5. Success threshold: ≥50% lower cost at equal error or ≤½ the error at equal cost in ≥2 out of 3 cases.

10) Conclusion

“Removing $\pi$” is not rhetoric: it is the outcome of measuring the domain in the right shape. GRG provides a measurement language (circular units and unit-sum quadratures) that yields cleaner formulas and, crucially, quantifiable benefits. This is a change of perspective that delivers progress: measurable improvement, not stubbornness.

Paradigm Shift

Paradigm Shift

Oct 11, 2025

A Constructive View of Radial Geometry

Generative Radial Geometry studies measures through explicitly defined radial constructions. Its current reference is a finite binary sector framework with internal chord and external tangent elements.

Start with Definitions

Choose the radius, a full Turn, and a sector resolution. Define the geometric elements before choosing a kernel or discussing accuracy.

Separate Three Questions

  • Construction: which elements and operations define the object?
  • Measurement: which kernel produces the finite estimate?
  • Verification: under which assumptions do bounds and convergence hold?

Current Results

Read the current formulation and analytical verification. The results concern regular symmetric sectors in exact arithmetic. Computational efficiency and extensions require separate evidence.

Research History

Earlier projection, Cartesian trapezoidal, and Turns approaches remain documented. They should be compared within their own scope. This page replaces the earlier slogan-based presentation with a statement of the constructive method and its verification requirements.

Critical FAQ

Critical FAQ

Sep 14, 2025

Critical FAQ — Generative Radial Geometry (GRG)

This FAQ clarifies how GRG treats circular geometry using turns (period-1 angles) and chords in a discrete, inside-out manner. Classical constants reappear as limits; they are not assumed as inputs.

What does “without π” really mean?

We do not claim a “π-less Euclidean geometry.” In GRG, π is not imported as a primitive; it emerges from a refinement process. At finite $N$, lengths and areas are computed with algebra (products and radicals) using turns and chords—no radians or pre-baked trig tables are required. In the limit, the classical constants reappear exactly.

Notation: let $s(u)$ denote the sine in turns, i.e. $s(u)=\sin(2\pi u)$. The chord corresponding to a step of $1/N$ turns on a circle of radius $R$ is

$$ s_N(R)\;=\;2R\,s\!\Bigl(\tfrac{1}{2N}\Bigr)\;=\;2R\,\sin\!\Bigl(\tfrac{\pi}{N}\Bigr). $$

Then the inscribed $N$-gon perimeter $P_N$ and area $A_N$ are

$$ P_N(R) \;=\; N\,s_N(R), \qquad A_N(R) \;=\; \frac{N}{4}\,s_N(R)\,\sqrt{\,4R^2 - s_N(R)^{2}\,}. $$

Consequently, π is determined by the limits

$$ \pi \;=\; \lim_{N\to\infty}\frac{P_N(R)}{2R} \;=\; \lim_{N\to\infty}\frac{A_N(R)}{R^{2}}. $$

Numerical sanity check (unit circle): $A_4=2.000$, $A_{12}=3.000$, $A_{128}\approx 3.1403$ — monotone convergence with error $O(N^{-2})$.

Isn’t this just numerical integration with a different skin?

  • Radial partition: pieces are internal chords/projections (not rectangular strips), naturally adapted to circular/elliptic symmetry.
  • Closed forms at finite $N$: for many $N$ (notably dyadics) you get nested radicals from geometric bisections—exact symbolic values, not only floats.
  • Monotone bounds & rate: inscribed/circumscribed constructions give clean bounds; the error decays like $O(N^{-2})$.
  • One grammar, many shapes: the same operators scale from rough to fine and extend to circles, ellipses, and spheres without changing the language.

So what is actually new?

The novelty is methodological and pedagogical: a single, discrete, inside-out grammar (turns, chords, projections) that does not import π/radians/trig as primitives, yet recovers them in the limit. Archimedean ideas are acknowledged; GRG reframes them for modern discrete computation and teaching.

Why do some diagrams mention “90°” if GRG uses turns?

Turns ($u\in[0,1)$) are the formal unit. Occasional “90°” labels are didactic visual cues for a quarter turn. All definitions and formulas are stated in turns and internal measures.

Pedagogical & computational takeaways

  • Conceptual clarity: learners see π emerge from an internal process rather than being assumed.
  • Computational simplicity: increase only $N$ to refine accuracy; same grammar from coarse to fine.
  • Extensibility: the approach transfers to ellipses and spheres with minimal changes to the operators.

Rate vs. step (dyadics)

With dyadic refinement $N=2^{b}$ (where $b$ is the number of bisections/bits), the turn step and the error scale as

$$ \Delta u \;=\; \frac{1}{N} \;=\; 2^{-b} $$
$$ \text{err}(P_N),\ \text{err}(A_N)\;=\;O\!\big((\Delta u)^2\big)\;=\;O\!\big(2^{-2b}\big). $$

Interactive: inscribed polygon and convergence

Use the slider to vary $N$ on the unit circle ($R=1$). For an inscribed $N$-gon, both $P_N$ and $A_N$ are monotone increasing and stay below the true values ($2\pi$ and $\pi$).


12
Inscribed N-gon and chord on the unit circle A circle of radius 1 with an inscribed regular polygon of N sides; a highlighted chord shows s_N.
Inscribed $N$-gon; chord $s_N=2\sin(\pi/N)$. Increase $N$ to see $P_N\!\nearrow 2\pi$ and $A_N\!\nearrow \pi$.

Computed (unit circle): $s_N=\;$—, $P_N=\;$—, $A_N=\;$—. Relative errors: $\tfrac{2\pi-P_N}{2\pi}=\;$—, $\tfrac{\pi-A_N}{\pi}=\;$—.

Dyadic refinement note: with $b\in\mathbb{N}_{\ge 0}$, $N=2^{b}$ gives especially clean nested-radical evaluations; quarter sampling uses $\Delta u=\tfrac{1}{4N}=2^{-b-2}$.

Floating metallic ring casting mismatched shadows on digital planes (perspective can mislead)

Paradigm Shift — Core Framing

GRG invites a change of lens: do not chase π; see the circle. Compute with the geometry directly (turns, dyadic refinement, additive projections). Where π appears, read it as a signature of circular symmetry — not a prerequisite for calculation.

Myths & Facts

  • Myth: “You must use π to define or measure a circle.”
    Fact: GRG generates and measures the circle via a radial sweep with additive projections. π is a shadow of circular symmetry, not the ingredient.
  • Myth: “Discrete means coarse.”
    Fact: In GRG, discrete means targeted precision. You choose the resolution appropriate to purpose; refine dyadically when needed.
  • Myth: “Turns are just degrees renamed.”
    Fact: Turns compose cleanly with dyadic refinement and quarter-turn sampling, matching how GRG computes.

Short Answers (for the critical reader)

Q1. If π shows up in unrelated places (Wallis, ζ(2), Euler), what does GRG say?

Where π appears, a circular/rotational structure is at work — sometimes implicitly. GRG computes from the cause (the circle), then reads π as the signature of that structure, not as a required input.

Q2. How does GRG handle accuracy without limits or π-digits?

By resolution. You pick dyadic refinement and recompute; the method is stable and uniform across refinements. Precision is a knob, not an infinite chase.

Q3. Why “turns” first?

Because one full rotation is 1, halves and quarters are exact dyadic fractions, and sampling on a quarter-turn aligns with GRG’s construction.

Turns & Dyadic (at a glance)

$$ b \in \mathbb{N}_{\ge 0}, \quad N = 2^{\,b}, \quad \Delta u = 2^{-\,b-2}\ \text{(quarter-turn sampling)}. $$

Increase b to double the resolution — same procedure, tighter result.

Go deeper

Perspective marker Circle and two shadows indicating change of perspective. See the Paradigm Shift

Prefer a quick recap of objections? Read the myths above, then continue with the full Critical FAQ below.

GRG — Objective Evaluation & FAQ

Generative Radial Geometry (GRG): reproducible results, comparisons with classical geometry, and clear answers to common objections.

  • Discrete-first construction
  • Product-only 2D
  • Turns (fractions of a full turn)

Principle: verifiable radial constructions

In GRG the radius is the generative object. Circumference and area emerge from radial sums over discrete turns. No claim of infallibility: for finite N the error is controlled; in the limit we recover classical values.

Ellipse — circumference error (log scale) Line chart of error vs N on a logarithmic vertical axis, using inline SVG with no external libraries.
Figure — Ellipse circumference error; expected order ≈ 2.

⬇️ CSV 🔗 Notebook

Sphere — surface area error (log scale) Line chart of error vs N on a logarithmic vertical axis for sphere area via latitude rings (midpoint).
Figure — Sphere surface area error; expected order ≈ 2.

⬇️ CSV 🔗 Notebook

Circle — exactness at finite N

For a circle of radius R, radial sums for circumference and area are (machine-)exact for any N: the integrand is constant, so rectangle/trapezoid rules reproduce the exact integral.

⬇️ Circle circumference CSV ⬇️ Area (circle/ellipse) CSV

Methods (concise, rigorous)

  • 2D area: A \approx \tfrac{1}{2}\sum \rho(\theta_k)^2\,\Delta\theta.
  • Perimeter: L \approx \sum \sqrt{\rho_k^2 + \big(\tfrac{\Delta\rho}{\Delta\theta}\big)_k^2}\,\Delta\theta.
  • Sphere: A \approx \sum 2\pi R^2 \sin(\phi_j)\,\Delta\phi (midpoint).
  • Order: O(N^{-2}) for periodic C^2 integrands (trapezoids/midpoints).
$$ \text{Turns-first:}\quad b \in \mathbb{N}_{\ge 0},\quad N = 2^{\,b},\quad \Delta u = 2^{-b-2} $$

Frequently Asked Questions

“Are you just approximating π in another way?”

Yes, but with a constructive and controlled method: some quantities (circle) are exact at finite N; for smooth periodic integrands the error decays as O(N^{-2}). π reappears as a property, not as an input.

“What is the error order?”

With the trapezoidal rule on a uniform periodic grid and a C^2 integrand, we get O(N^{-2}). See charts and CSVs.

“Does it work in 3D?”

For the sphere, midpoint latitude-ring summation converges to 4\pi R^2 with order ≈ 2. Generic surfaces require metric extensions.

“When should I avoid GRG?”

Non–star-convex shapes and complex surfaces may need multi-valued \rho(\theta) or alternative parameterizations; classical/hybrid methods can be preferable there.

“Where are the code and data?”

This demo links the CSVs of our experiments. For public replication, attach a repository (e.g., Zenodo DOI) and a notebook that regenerates all figures.

Datasets & CSVs

© Generative Radial Geometry — Demo page for objective assessment and addressing concerns.

Publications

Publications

Sep 13, 2025

Publications and Research References

This page identifies documented GRG material and distinguishes it from publication plans. Website articles are research documentation; they are not, by themselves, evidence of peer review.

Current Formulation

External Research Records

GRG community on Zenodo and Stefano Ferragina’s ORCID record provide entry points to external records. A community link or an ORCID identifier is not a DOI for this formulation.

Citation

For a website citation, use the author, exact article title, article URL, access date, and the version being discussed. Use a publication DOI only when its landing page has been checked against the actual work and version.

Publication Status

Previous manuscript lists and citation templates have been withdrawn from this page as unverified placeholders. Manuscripts, datasets, and software releases will be listed with their actual status and persistent links after verification.