Paradigm Shift

Paradigm Shift

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

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

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.

Results

Results

Results and Verification

This page separates analytical results from numerical illustrations and performance measurements.

Analytical Results

The current binary radial formulation defines regular chord–tangent sectors and gives exact-arithmetic proofs of second-order error for arithmetic kernels and fourth-order error for the weighted circumference and area kernels. It also proves an area bracket for the defined regular sectors.

These statements have specific geometric hypotheses. They do not establish numerical exactness at finite resolution, hardware stability, originality, or superiority over other methods.

Numerical Checks

Numerical evaluations may check consistency with the analytical results. A publishable record must include the generating procedure, radius, sector count, precision, reference definition, raw output, and executable code.

Performance Results

The former gallery mixed example cards with timing figures and incomplete dataset records. Those figures are not retained as validated performance results. No measured efficiency advantage is established by this page.

Performance results will be added when complete reproducible evidence is available under the comparison protocol.

Roadmap

Roadmap

Research Roadmap

This page records work to be completed rather than retaining expired milestones or unsupported delivery promises.

Documentation

Align the current formulation, area-kernel article, notation, historical methods, and references. Consolidate duplicate content and preserve versions.

Implementation

Trace dependencies in every interactive tool. Specify which operations construct geometry, evaluate measures, compute comparison references, and draw the visualisation.

Verification

Review domains, normalisations, error proofs, rounding, cancellation, and stopping conditions. Validate general shapes and three-dimensional methods independently.

Benchmarks and Releases

Publish actual scripts, datasets, environments, licences, and measured results. Assess equal-accuracy performance before reporting a speed advantage.

Publication

List manuscripts and releases with verified status and persistent links. No release date, throughput target, or completed milestone is implied until evidence is available.