Inside-Out GRG

Inside-Out GRG

GRG — Looking from the Inside: a discrete, π-free language for shapes

Generative Radial Geometry (GRG) — Looking from the Inside

GRG conventions. Angles are measured in turns \(u\in[0,1)\). Radial computations (perimeter and radial area) run on the full turn; the Cartesian area uses the quarter (and then ×4). Trigonometric forms are optional cross-checks, not inputs to the pipeline.

Work-in-progress. GRG is a discrete, π-free way to measure and compare shapes by radial generation. The turning point was this: I looked at the circle from its inside—a point that sends rays outward and measures what they meet. That inside→out switch is small to say and large to practice. The door is open; we will walk through it.

Why GRG matters

  • Discrete by nature: everything runs in finite steps (N)—heights, chords, bands.
  • π-free computation: the pipeline never needs π to run; π appears only when we compare to classical values.
  • Immediate comparability: two shapes at the same resolution are directly comparable with the same grammar.
  • Multi-scale: increase N; the very same procedure refines itself (coarse → fine).
  • GPU-friendly: short loops and sums, ideal for digital geometry, CAD/graphics, and simulation.

Looking from the inside

Not from a grid of squares, not from external coordinates—from a center that emits rays. A shape becomes a radial profile (a finite vector of values) rather than a formula to solve. From there, measurement and comparison happen discretely and immediately.

The joined method (circle)

Perimeter (radial, full turn): split the full turn \(u\in[0,1)\) into \(4N\) equal steps \(\Delta u=1/(4N)\). Join successive GRG border nodes by chords; the quarter view in the figure is for clarity.

Area (Cartesian, quarter): split one radius into \(N\) parts; at each split, drop the perpendicular to the circle (the “height”). Adjacent heights form a trapezoid; summing them tiles the quarter of a disk (the last one degenerates to a triangle). Multiply by 4 for the full disk.

Figure — joined method (circle)

Blue = angular sectors (perimeter, shown on the quarter). Red = single-radius trapezoids (area on the quarter). Dashed red rays start from the height intersections and generally do not coincide with the blue rays.

Figure 1. Quarter circle built from angular sectors (blue) and single-radius trapezoids (red); dashed rays start at height intersections.

Discrete comparability (the practical power)

At the same resolution N, any two shapes share the same grammar (heights, chords). This makes them comparable immediately—π-free inside the computation. We use simple, discrete indices relative to a baseline circle at the same N:

  • Area Index \(a_N\)
  • Perimeter Index \(c_N\)
  • Isoperimetric-like ratio \(q_N=a_N/c_N^2\) (the circle maps to 1 at the same N)
Minimal math — turns-first (π-free, node-based)

Quarter nodes (turns):

\[ \Delta u \;=\; \frac{1}{4N} \] \[ u_k \;=\; k\,\Delta u \quad (k=0,\dots,N) \]

Quarter inscribed perimeter (node distances):

\[ C_{\mathrm{in}}^{(Q)}(N) \;=\; \sum_{k=0}^{N-1} \bigl\|\,P_{k+1}-P_k\,\bigr\| \]

Full inscribed perimeter:

\[ C_{\mathrm{in}}(N) \;=\; 4\,C_{\mathrm{in}}^{(Q)}(N) \]

Radial area (full turn, shoelace on 4N nodes):

\[ A_{\mathrm{in}}(N) \;=\; \frac{1}{2} \sum_{j=0}^{4N-1} \bigl(x_j\,y_{j+1}-x_{j+1}\,y_j\bigr) \]

Cartesian area (quarter, Δx) → ×4:

\[ \Delta x \;=\; \frac{R}{N} \] \[ x_i \;=\; i\,\Delta x \] \[ y_i \;=\; \sqrt{\,R^2 - x_i^{\,2}\,} \] \[ A_{\mathrm{trap}}^{(Q)}(N) \;=\; \sum_{i=1}^{N} \frac{y_{i-1}+y_i}{2}\;\Delta x \] \[ A_{\mathrm{trap}}(N) \;=\; 4\,A_{\mathrm{trap}}^{(Q)}(N) \]

Discrete indices (baseline = circle at the same N):

\[ a_N \;=\; \frac{A_{\text{shape}}(N)}{A_{\text{circle}}(N)} \] \[ c_N \;=\; \frac{C_{\text{shape}}(N)}{C_{\text{circle}}(N)} \] \[ q_N \;=\; \frac{a_N}{c_N^{\,2}} \]
Classical cross-check (optional)

Inscribed perimeter (quarter step in turns):

\[ \Delta u \;=\; \frac{1}{4N} \] \[ s_N \;=\; 2R\,\sin\!\bigl(\pi\,\Delta u\bigr) \] \[ C_{\mathrm{in}}(N) \;=\; 4\,N\,s_N \;=\; 8\,N\,R\,\sin\!\Bigl(\frac{\pi}{4N}\Bigr) \]

Circumscribed perimeter (outer bound):

\[ C_{\mathrm{out}}(N) \;=\; 8\,N\,R\,\tan\!\Bigl(\frac{\pi}{4N}\Bigr) \]

Radial area via triangles (full turn):

\[ A_{\mathrm{tri}}(N) \;=\; 2\,N\,R^{2}\, \sin\!\Bigl(\frac{\pi}{2N}\Bigr) \]

Cartesian area (quarter, Δx) — same as above, then ×4.

Figure — 3D comparator (hemisphere bands)

Clean comparator for surfaces: baseline hemisphere on the left, target surface on the right. Blue = GRG parallels on each latitude; red = bands (average of neighboring circumferences). Below, π-free indices (schematic bars).

Figure 2. Hemisphere bands comparator: left = baseline, right = target. Blue parallels indicate perimeter along latitude; red band shows area via average neighboring circumferences times slant. Bars below sketch π-free indices.

From the circle to the sphere (concept)

We stack latitude bands along the vertical axis and apply the same grammar on each parallel (GRG circumference on the band’s ends, averaged across the slant). Errors shrink fast with balanced vertical and angular splits. The comparator above is designed to show differences band-by-band without clutter.

Applications

  • Graphics/CAD: π-free arc lengths and areas that run fast and parallel.
  • Sampling/tiling on spheres: controllable bands, equal-area approximations.
  • Gear-like and elliptical profiles via directional radial generation.
  • Education: a concrete bridge from discrete geometry to classical values.

Status & invitation

GRG is young and grows with this site. The aim is simple: a practical, comparable, discrete language for shapes and surfaces. If the idea helps, let’s refine proofs, diagrams, and applications together.

GRG Mini app

GRG Mini app

GRG Mini-App

Explore Generative Radial Geometry (GRG): figures are generated from the center at a chosen resolution, without assuming π a priori. Angles are measured in turns \(u\in[0,1)\) with period-1 trig \(c(u)=\cos(2\pi u),\ s(u)=\sin(2\pi u)\).

Controls

N = 24
Circumference is always from equal-angle chords in turns.
Sphere uses octant symmetry (×8) and π-free operators; volume is O(N²).
%
“Internal dominance” compares N to 2N (self-consistency). “Victory” compares to the π-based value (external).

Circle (2D)

Area estimate
—
Area corridor (if applicable)
—
Circumference (chords)
—
Internal Δ (N → 2N), area
—
Internal Δ (N → 2N), circumf.
—
External error vs π-based, area
—
External error vs π-based, circumf.
—
area: — circ: —

Sphere (3D)

Surface (octant fusion ×8)
—
Volume (stacked quarters ×8)
—
Internal Δ (N → 2N), surface
—
Internal Δ (N → 2N), volume
—
External error vs 4πr²
—
External error vs (4/3)πr³
—
surface: — volume: —

How the GRG Mini-App works — Circle & Sphere

What you control

Inputs. Two modules:

  • Circle (2D): choose radius r, subdivisions N and the Area method:
    • Δx Trapezoidal — quarter → ×4 (concave arc, under-tiling, fast O(N⁻²)).
    • Original Projection — midpoint (upper) / right (lower) corridor, quarter → ×4.
    • Radial Sectors (turns) — full turn, equal-angle sectors (inscribed, product form).
    Note: for Δx/Original the slider N refers to the quarter; for Radial it refers to the full turn. Circumference always uses turns with equal-angle chords.
  • Sphere (3D): choose radius R, vertical slices Nz, radial trapezoids for quarter-areas Mr, and quarter-circumference subdivisions Mc.
  • Show traditional comparison toggles all external (vs π) quantities and the grey series in charts.
  • Show π estimates reveals π computed internally (from A/C in 2D; S/V in 3D).
  • Download CSV exports the full range (1…Nmax); Copy link preserves the current settings.

Status badges & thresholds

🟢 Internal dominance The internal change between the current resolution and the doubled one is small relative to the value:

\(\displaystyle \frac{\Delta_{\mathrm{int}}}{\text{value}} \le 0.15\%\).

🏆 Victory vs classical The external error is also small:

\(\displaystyle \frac{\Delta_{\mathrm{ext}}}{\text{value}_\pi} \le 0.10\%\).

Formulas used — Circle (2D)

  • Area (Δx Trapezoidal): quarter sum of trapezoids with uniform \(\Delta x=r/N\) → ×4 (Kahan summation for stability).
  • Area (Original Projection): midpoint (upper) / right (lower) corridor on the quarter → ×4 (Kahan).
  • Area (Radial Sectors, turns): \(A_N=\tfrac{N}{2}r^2\,s(\tfrac{1}{N})\) with \(s(u)=\sin(2\pi u)\).
  • Circumference (turns): equal-angle chords on the full turn: \(C_{N_{\text{full}}}=2N_{\text{full}}\,r\,s(\tfrac{1}{2N_{\text{full}}})\). For Δx/Original we use \(N_{\text{full}}=4N\); for Radial, \(N_{\text{full}}=N\).

Formulas used — Sphere (3D)

  • Surface: octant fusion of quarter-circumferences along meridian (\(\Delta s\)), then ×8.
  • Volume: octant stacking of quarter-areas along \(z\) with trapezoid in \(\Delta z\), then ×8.

What this app demonstrates

GRG reconstructs circle and sphere without assuming π. With angles in turns and quarter/octant symmetries, internal stabilization (dominance) precedes external agreement (victory). Construct first, constants emerge.

GRG Mini-App — 3 righe

GRG Mini-App — 3 righe

Layout a righe: Controls → Circle (2D) → Sphere (3D). Tutti gli slider sono two-way con i numeri; i turns (U) hanno preview live (corde uguali).

Controls

Circle

Angular (turns)

Δu = 1/48 · Δθ = 0.130899694 rad
U multiple of 4 ✓; U = 4·N·k ✓

Sphere

Slider (mirrors)

Circle (2D)

Area (GRG)
0
Corridor width (mid−right)
—
Circumference (chords)
0
Δint A (2N vs N)
—
Δint C (2U vs U)
—
Δext A vs πr²
—
Δext C vs 2πr
—
area: — circ: —
Anteprima: poligono inscritto con U settori uguali (corde uguali).

Sphere (3D)

Surface S (octant fusion ×8)
0
Volume V (stacked quarters ×8)
0
Δint S
—
Δint V
—
Δext S vs 4πR²
—
Δext V vs (4/3)πR³
—
surface: — volume: —
GRG Core (Turns)

GRG Core (Turns)

Earlier Formulation

This page preserves a historical GRG method. Its notation and formulas belong to that version. The current binary radial formulation and verification are available here. Historical computational claims require separate validation.

Core Turns

Angles are measured in turns (fractions of a full rotation). Primary 2D formulas use products only and avoid sexagesimal units and external constants. We write c(u), s(u) for cosine/sine with period 1 in turns (so $c(0)=1$, $s(0)=0$; $c(\tfrac{1}{4})=0$, $s(\tfrac{1}{4})=1$). Equivalently, $c(u)=\cos(2\pi u)$ and $s(u)=\sin(2\pi u)$.

Radial point

$$ P(u) \;=\; \bigl( r\cdot c(u),\; r\cdot s(u) \bigr). $$

Perimeter (equal-angle chords)

$$ C_N \;=\; 2\cdot N \cdot r \cdot s\!\Bigl(\tfrac{1}{2N}\Bigr). $$

Area (equal-angle sectors)

$$ A_N \;=\; \tfrac{1}{2}\cdot N \cdot r^{2} \cdot s\!\Bigl(\tfrac{1}{N}\Bigr). $$

How to use

  • Pick a precision $N$ (e.g., $256$). If you store angles as $k/2^{B}$ turns, choose $N$ that divides $2^{B}$.
  • Dyadic refinement: with $b\in\mathbb{N}_{\ge 0}$, set $N=2^{b}$ so the turn step is $\Delta u=2^{-b}$. Quarter sampling uses $\Delta u=\tfrac{1}{4N}=2^{-b-2}$.
  • Optional check (step-doubling): compare $N$ vs. $2N$ to gauge the remaining gap.

Notes

  • Both $C_N$ and $A_N$ increase with $N$ and converge to the circle values $2\pi r$ and $\pi r^2$; the error typically scales like $O\!\bigl((\Delta u)^2\bigr)=O(N^{-2})$.
  • This block pairs with the Trapezoidal and Original blocks on the Applications pages.

Figure: turns, chord, and sector

Unit circle with radial point P(u), equal-angle step Δu=1/N, chord and sector Circle of radius r with angle u in turns; two rays separated by Δu illustrate the chord s(1/(2N)) and the associated sector s(1/N). u Δu = 1/N P(u) chord O
Radial point $P(u)$, equal-angle step $\Delta u=1/N$, chord $s(\tfrac{1}{2N})$, and sector $s(\tfrac{1}{N})$.

See also

Δx Trapezoidal · Original Projection · Applications / Circle · Applications / Sphere

Formalisation (2025 snapshot). GRG is fully angular: in 2D circumference via equal-angle Δu chords, and area via equal-angle Δu sectors (products only); in 3D, surface/volume are angular sums over meridian bands. No sexagesimal units, no π.

Generative Radial Geometry (GRG) — Formalisation (Turns)

GRG is a constructive, discrete framework based on full-turn angular partitions (turns). All angles are fractions of a full rotation $u\in[0,1)$. We use period-1 trigonometric functions $c(u), s(u)$ with $c(0)=1$, $s(0)=0$, $(c(\tfrac14), s(\tfrac14))=(0,1)$, and standard identities. Primary formulas contain no sexagesimal units and no external constants.

1) Setup and Notation (full turn)

  • Spaces. Plane $\mathbb{R}^2$ and space $\mathbb{R}^3$ with axes $x,y,z$.

  • Circle/Sphere. Center $O$, radius $r>0$. Circle: $x^2+y^2=r^2$. Sphere: $x^2+y^2+z^2=r^2$.

  • Angles. $u\in[0,1)$ turns. Turns-trigonometry: $c(u), s(u)$ with unit identities.

Fig. A — Radial construction over the full turn Axes, circle, and two radii separated by angle u in turns; point P(u) on the circle. u R
Fig. A — Angle $u$ (turns). Radial point $P(u)=(r\,c(u),\,r\,s(u))$.

2) Exact radial nodes (full turn)

For any $u\in[0,1)$:

Radial node

$$ P(u)\;=\;\bigl(r\,c(u),\; r\,s(u)\bigr). $$
Evenly-spaced angles: $u_k=k/N$ over the full turn.

3) 2D operators (products, no sums)

2D Circumference (inscribed regular N-gon)

$$ \boxed{\, C_N \;=\; 2\,N\,r\,s\!\Bigl(\tfrac{1}{2N}\Bigr) \,} $$
Sum of $N$ identical chords → product.

2D Area (N equal-angle sectors)

$$ \boxed{\, A_N \;=\; \tfrac{N}{2}\,r^{2}\,s\!\Bigl(\tfrac{1}{N}\Bigr) \,} $$
Sum of $N$ identical sectors → product.

4) Sphere: meridian bands over a half turn (angular-only)

Meridian parameterization (angles only)

$$ \Delta v=\tfrac{1}{2M}, \qquad v_i=i\,\Delta v, \qquad \rho_i=r\,s(v_i). $$

4.1 Surface (angular sum over bands)

Meridian step (constant) & parallel circumference

$$ h=2\,r\,s\!\Bigl(\tfrac{\Delta v}{2}\Bigr)=2\,r\,s\!\Bigl(\tfrac{1}{4M}\Bigr), \qquad \mathrm{C}_{\mathrm{GRG}}(\rho;L)=2\,L\,\rho\,s\!\Bigl(\tfrac{1}{2L}\Bigr). $$

Surface via trapezoids (bands)

$$ S_{M,L}=h\left[ \tfrac12\,\mathrm{C}_{\mathrm{GRG}}(\rho_0;L) + \sum_{i=1}^{M-1}\mathrm{C}_{\mathrm{GRG}}(\rho_i;L) + \tfrac12\,\mathrm{C}_{\mathrm{GRG}}(\rho_M;L) \right]. $$

Surface — midpoints (often more accurate)

$$ S_{M,L}\;\approx\; h\sum_{i=0}^{M-1}\mathrm{C}_{\mathrm{GRG}}\!\bigl(\rho_{i+\tfrac12};L\bigr), \qquad \rho_{i+\tfrac12}=r\,s\!\bigl(v_i+\tfrac{\Delta v}{2}\bigr). $$
Fig. D — Meridian bands: parallels front/mid/back Three parallels drawn as ellipses to suggest a sphere; axes and reference labels included. v_i v_{i+1}
Fig. D — Meridian bands over a half turn; 2D angular operators on each parallel.

4.2 Volume (angular sum over sections)

Axial thickness & section area (angular)

$$ \Delta z_i = r\,\big|\,c(v_{i+1})-c(v_i)\,\big|, \qquad \mathrm{A}_{\mathrm{GRG}}(\rho;N)=\tfrac{N}{2}\,\rho^2\,s\!\Bigl(\tfrac{1}{N}\Bigr). $$

Volume via trapezoids (sections)

$$ V_{M,N}\;\approx\;\sum_{i=0}^{M-1} \frac{\Delta z_i}{2}\Bigl(\mathrm{A}_{\mathrm{GRG}}(\rho_i;N)+\mathrm{A}_{\mathrm{GRG}}(\rho_{i+1};N)\Bigr). $$

Volume — midpoints

$$ V_{M,N}\;\approx\;\sum_{i=0}^{M-1}\mathrm{A}_{\mathrm{GRG}}\!\bigl(\rho_{i+\tfrac12};N\bigr)\,\Delta z_i. $$

5) Compact “no-π” operators (summary)

  • 2D circumference: $\displaystyle \mathrm{C}_{\mathrm{GRG}}(r; N)=2\,N\,r\,s\!\bigl(\tfrac{1}{2N}\bigr)$.

  • 2D area: $\displaystyle \mathrm{A}_{\mathrm{GRG}}(r; N)=\tfrac{N}{2}\,r^2\,s\!\bigl(\tfrac{1}{N}\bigr)$.

Dyadic refinement (turns-first): $b\in\mathbb{N}_{\ge 0}$, $N=2^{b}$, and $\Delta u=2^{-b}$ (quarter sampling uses $\Delta u = \tfrac{1}{4N}=2^{-b-2}$).

Core Turns

Angles are measured in turns (fractions of a full rotation, u∈[0,1)). We write c(u) and s(u) for cosine/sine with period 1 in turns (so c(0)=1, s(0)=0; c(1/4)=0, s(1/4)=1). This block gives 2D, product-only formulas without sexagesimal units or external constants.

Radial point

$$ P(u) \;=\; \bigl( r\,c(u),\; r\,s(u) \bigr) $$

Perimeter (equal-angle chords)

$$ C_N \;=\; 2\,N\,r\, s\!\Bigl(\tfrac{1}{2N}\Bigr) $$

Area (equal-angle sectors)

$$ A_N \;=\; \tfrac{1}{2}\, N\, r^{2}\, s\!\Bigl(\tfrac{1}{N}\Bigr) $$

How to use

  • Choose a precision N (e.g., 256). If you store angles as k/2^B turns, pick N dividing 2^B.
  • For a quick accuracy check, compare results at N and 2N (step-doubling).

Notes

  • C_N and A_N increase with N and converge to the circle’s values.
  • This is one GRG method block. See also the Δx Trapezoidal and Original Projection blocks.

See also: Δx Trapezoidal · Original Projection · Applications / Circle · Applications / Sphere

Note: 3D (surface/volume) lives under Applications / Sphere. This page focuses on the 2D Core Turns block.

New Determination

Quarter-area as a sum of trapezoids on one radius

Divide the single radius into N parts: $$\Delta r=\frac{R}{N},\qquad x_k=k\,\Delta r\;(k=0,\dots,N).$$ Define the heights on the circle by Pythagoras: $$b_k=\sqrt{R^2-x_k^2},\qquad b_0=R,\; b_N=0.$$

Trapezoids

The k-th trapezoid (for k=1..N) uses the adjacent heights \(B=b_{k-1}\) and \(b=b_k\) and has height \(\Delta r\):

$$A_k=\frac{(b_{k-1}+b_k)}{2}\,\Delta r \;=\; \frac{(B+b)}{2}\,\frac{R}{N}.$$

  • First trapezoid: $$A_1=\frac{(R+b_1)}{2}\,\frac{R}{N}.$$
  • Last trapezoid (degenerates to a triangle since \(b_N=0\)): $$A_N=\frac{(b_{N-1}+0)}{2}\,\frac{R}{N}=\frac{b_{N-1}}{2}\,\frac{R}{N}.$$

Total quarter area

$$A^{(Q)}_{\text{trap}}(N)=\sum_{k=1}^{N}\frac{(b_{k-1}+b_k)}{2}\,\frac{R}{N} \;=\; \sum_{k=0}^{N-1}\frac{\Delta r}{2}\big(b_k+b_{k+1}\big).$$ By symmetry for the full disk: $$A_{\text{trap}}(N)=4\,A^{(Q)}_{\text{trap}}(N).$$

Optional recursive update (computational shortcut)

You can compute the next height without re-evaluating the square root from scratch:

$$b_{k+1}^2 \;=\; R^2-(x_k+\Delta r)^2 \;=\; b_k^2-2\,x_k\,\Delta r-(\Delta r)^2.$$

Summary. Yes: the area of the quarter is the sum of all these trapezoids. The last one is automatically a triangle because \(b_N=0\). This matches your picture and the loop a computer would run.

GRG — 3D extension: the sphere (surface area) + error behaviour

Work-in-progress. GRG keeps growing while we build the site. The “joined method” (angular sectors + one-radius trapezoids) lifts naturally from the circle to the sphere.

Setup (hemisphere)

  • Choose two integers: Nz (vertical splits) and Nθ (angular sectors for circumferences).
  • Vertical step: $$\Delta z=\frac{R}{N_z},\qquad z_k=k\,\Delta z\ (k=0,\dots,N_z).$$
  • Latitude radius by Pythagoras: $$r_k=\sqrt{R^2-z_k^2}.$$
  • GRG circumference at radius \(r\) with angular split \(N_\theta\): $$C_{GRG}(r;N_\theta)=8\,N_\theta\,r\,\sin\!\Big(\frac{90^\circ}{2N_\theta}\Big).$$

Surface area by “frusta” along a meridian

Between two adjacent latitudes \(k \to k+1\) we approximate the spherical band by a conical frustum:

  • Meridian slant step (no π): $$s_k=\sqrt{(\Delta z)^2+\big(r_{k+1}-r_k\big)^2}.$$
  • Band area (average circumference × slant step, π-free):

$$A_k \;=\; \frac{C_{GRG}(r_k;N_\theta)+C_{GRG}(r_{k+1};N_\theta)}{2}\;\cdot\; s_k.$$

Hemisphere and sphere:

$$A_{\text{hemi}}(N_z,N_\theta)=\sum_{k=0}^{N_z-1} A_k,\qquad A_{\text{sphere}}(N_z,N_\theta)=2\,A_{\text{hemi}}(N_z,N_\theta).$$

Circle area reminder (why accuracy improves)

For the quarter of a circle we already use trapezoids on the single radius:

$$A^{(Q)}_{\text{trap}}(N)=\sum_{k=0}^{N-1}\frac{\Delta r}{2}\big(b_k+b_{k+1}\big),\quad \Delta r=\frac{R}{N},\ b_k=\sqrt{R^2-(k\Delta r)^2}.$$

This has quadratic error in \(\Delta r\) (order \(N^{-2}\)), so the accuracy rises fast. The same idea—“average of neighbours” along one axis—drives the sphere construction above.

Error behaviour (what shrinks, and why)

  • Angular sectors (per circumference): chord vs arc gives a relative error that scales like \( \mathcal{O}(N_\theta^{-2})\).
  • Vertical frusta (along a meridian): the trapezoidal averaging in \(z\) (via the slant step \(s_k\)) yields error \( \mathcal{O}(N_z^{-2})\).

Combined effect: the sphere estimate satisfies $$A_{\text{sphere}}(N_z,N_\theta) \to 4\pi R^2 \quad\text{as}\quad N_z,N_\theta\to\infty,$$ with total error behaving like $$\mathcal{O}\!\big(N_z^{-2}\big)+\mathcal{O}\!\big(N_\theta^{-2}\big).$$ (We keep formulas π-free in the computation; π appears only when comparing to the classical continuous value.)

Algorithm (summary)

  • For k = 0..Nz: compute \(z_k, r_k, C_k=C_{GRG}(r_k;N_\theta)\).
  • For k = 0..Nz−1: compute \(s_k=\sqrt{(\Delta z)^2+(r_{k+1}-r_k)^2}\) and $$A_k=\tfrac{C_k+C_{k+1}}{2}\,s_k.$$
  • Sum \(A_k\) for the hemisphere; double for the whole sphere.

Notes

  • The polar band automatically degenerates (like the “last trapezoid → triangle” in 2D), so the loop stays uniform.
  • To balance errors, pick \(N_z\approx N_\theta\) (e.g., 24–48 each gives already small relative errors).
  • Volume of the sphere can be done analogously using cylindrical shells with \(C_{GRG}(r;N_\theta)\) and a height term; we can add that next.
[Optional future figure: hemisphere bands as conical frusta with GRG circumferences]

GRG — Joined method for the circle: perimeter by angular sectors, area by single-radius trapezoids

Work-in-progress. Generative Radial Geometry (GRG) is evolving as we build the website. The idea below emerged today (23 August 2025) and we document it in real time. GRG is a young, living framework: definitions, figures, and formulas grow together with the site.

Setup (quarter of a circle)

Let the radius be R and consider the first-quadrant quarter of the circle. Fix an integer N ≥ 1. We couple two distinct discretisations:

  • Perimeter (angular division): split the right angle into N equal parts with step
  • $$ \Delta\theta=\frac{\pi}{2N} $$
  • Area (single-radius heights): split one radius into N equal parts with
  • $$ \Delta r=\frac{R}{N},\qquad x_k=k\,\Delta r,\qquad y_k=\sqrt{R^2-x_k^2} $$
  • Adjacent heights \(y_k,y_{k+1}\) form a trapezoid that tiles the quarter.

Formulas (π-free perimeter and trapezoidal area)

Quarter arc length (GRG, from angular sectors):

$$ C_N^{(Q)} \;=\; 2\,N\,R\,\sin\!\Big(\frac{\pi}{4N}\Big) $$

(full circle: \(C_N=8\,N\,R\,\sin(\tfrac{\pi}{4N})\)).

Quarter area (trapezoids on one radius):

$$ A_{\text{trap}}^{(Q)}(N)\;=\;\sum_{k=0}^{N-1}\frac{\Delta r}{2}\,\big(y_k+y_{k+1}\big),\qquad \Delta r=\frac{R}{N},\quad y_k=\sqrt{R^2-x_k^2},\; x_k=k\,\Delta r $$

Equivalently, with \(B_k:=y_k\) and \(b_k:=y_{k+1}\), each trapezoid is

$$ A_k=\frac{(B_k+b_k)}{2}\,\frac{R}{N},\qquad A_{N-1}=\frac{(B_{N-1}+0)}{2}\,\frac{R}{N} $$

Full disk by symmetry:

$$ A_{\text{trap}}(N)=4\,A_{\text{trap}}^{(Q)}(N) $$

Figure (joined method)

Blue = angular sectors for the perimeter. Red = heights on one radius and the adjacent trapezoids for the area. Dashed red rays start from the intersection points and do not, in general, coincide with the blue rays.

  • angular sectors (perimeter)
  • trapezoids on single-radius heights (area)

Formulas (π-free perimeter and trapezoidal area)

Quarter arc length (GRG, from angular sectors):

$$ C_N^{(Q)} \;=\; 2\,N\,R\,\sin\!\Big(\tfrac{\pi}{4N}\Big) $$

Full circle:

$$ C_N \;=\; 8\,N\,R\,\sin\!\Big(\tfrac{\pi}{4N}\Big) $$

Quarter area (trapezoids on one radius)

Using heights at \(x_k=k\,\Delta r\) with \(y_k=\sqrt{R^2-x_k^2}\), the quarter-area is:

$$ A_{\text{trap}}^{(Q)}(N)\;=\;\sum_{k=0}^{N-1}\frac{\Delta r}{2}\,\big(y_k+y_{k+1}\big) $$ $$ \Delta r\;=\;\tfrac{R}{N} $$ $$ x_k\;=\;k\,\Delta r $$ $$ y_k\;=\;\sqrt{R^2-x_k^2} $$

Equivalently, with \(B_k:=y_k\) and \(b_k:=y_{k+1}\), each trapezoid is:

$$ A_k\;=\;\frac{(B_k+b_k)}{2}\,\frac{R}{N} $$ $$ A_{N-1}\;=\;\frac{(B_{N-1}+0)}{2}\,\frac{R}{N} $$

Full disk by symmetry:

$$ A_{\text{trap}}(N)\;=\;4\,A_{\text{trap}}^{(Q)}(N) $$
Acknowledgments

Acknowledgments

Thanks to SANUSLIFE, the company where I now work. It’s a wonderful environment—a health-focused company that has cultivated a beautiful internal atmosphere. In this serene setting, I found the calm to finally shape an idea I had been contemplating for many years.

Lord, thank You for making me as I am. You give me enthusiasm for everything, and everything looks beautiful to me. I long to discover the world; I long to make it more beautiful, yet I am limited. Thank You for everything.