Exactness at the Chosen Scale (GRG)

Exactness at the Chosen Scale (GRG)

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 \)).

Interactive Lab + FAQ

Interactive Lab + FAQ

Generative Radial Geometry (GRG)

A discrete–exact grammar for curves and surfaces using turns, chords, and radial projections. π is not imported as a magic constant; it emerges from dyadic steps and converges in the classical limit.

.

Turns-first definitions

We discretize the unit turn; dyadic refinement keeps operations exact on the mesh and drives accuracy.

$$ b \in \mathbb{N}_{\geq 0}, \qquad N = 2^{b} $$
$$ \Delta u = 2^{-(b+2)} \quad \text{(quarter sampling)} \qquad \Rightarrow \qquad \Delta u = \frac{1}{4N}. $$

For a circle of radius \(R\), the inscribed polygon at \(N\) turns has:

$$ P_{N} = 2 N R \sin\!\left(\frac{\pi}{N}\right), \qquad A_{N} = \frac{1}{2} N R^{2} \sin\!\left(\frac{2\pi}{N}\right). $$
Dyadic polygon and chords Circle with an N=16 inscribed polygon, dyadic rays, and a highlighted chord.
Turns, chords, and dyadic rays. Crisp vectors at any zoom.

Interactive Lab

Switch presets and adjust the dyadic exponent \(b\). For the star case \(r(\theta)=1+a\cos(k\theta)\), the exact area is \(A=\pi\!\left(1+\frac{a^{2}}{2}\right)\).

N (turns)
—
Perimeter (approx)
—
Area (approx)
—
Perimeter true
—
Area true
—
Errors (|P|, |A|)
—

Notes. Circle & atlas use exact finite-step formulas (chords) and converge monotonically. Star-shape uses inscribed polygons; C-shape uses odd–even radial sweep for area (perimeter shown exact for reference).

Critical FAQ (condensed)

Q: Is GRG just numerical integration with a trick?
A: For circles with dyadic bisections steps are exact at finite \(N\) (chords & projections). The limit recovers classical values; nothing is imported.

Q: Where does \(\pi\) come from?
A: From the discrete perimeter/area growth of dyadic polygons. \(\pi\) appears as a rotational-symmetry shadow as \(N\to\infty\).

Q: Non-convex shapes “jump across the outside”.
A: We prevent that with visibility-aware schemes: (i) odd–even radial sweep; (ii) radial atlas (locally star-shaped patches with ± signs for outer components/holes).

Q: Convergence?
A: \(O(N^{-2})\) for \(C^{2}\) boundaries; \(O(N^{-1})\) near corners (mitigated via adaptive dyadics). Inscribed perimeter/area are monotone.

Q: Why is GRG pedagogically useful?
A: You can teach Euclidean geometry from bisections and chords; radians & trig tables emerge rather than being prerequisites.

Technical Appendix — Non-Convex & Complex Parametrizations

  1. Star-Check. If a center sees the whole boundary (star-shaped), sample \(\theta\) in dyadic turns and use \(r(\theta)\). Inscribed area/perimeter are monotone \(\uparrow\) with \(O(N^{-2})\).
  2. Odd–Even radial sweep. For each \(\theta_{k}\), intersect the ray with the boundary, sort radii \(r_{k,j}\), and add inside segments \([r_{k,1},\, r_{k,2}],\ [r_{k,3},\, r_{k,4}], \dots\).
  3. Radial atlas (± signs). Decompose into locally star-shaped patches; outer components \(+\), holes \(−\). Sum areas with signs and perimeters by absolute length. Same \(O(N^{-2})\) patch-wise.
  4. Robustness. \(C^{2} \Rightarrow O(N^{-2})\); corners \(\Rightarrow O(N^{-1})\) unless adaptively refined. Self-intersections: use winding rule instead of parity.

All computations use turns, chords, projections; operations are exact at finite dyadic steps for circular primitives and exact on the mesh for polygons.

Team

Roles are presented by responsibility area. Individual bios can be added later.

Team roles pictogram Minimal icons representing research, algorithms, systems, and editorial review.
Role-based structure. Short scope, clear ownership.

Leadership & Research

  • Sets the research agenda and publishes specifications with reproducible examples.
  • Maintains the “turns-first” glossary and consistency across demos and notes.
  • Approves public statements and abstracts before release.

Methods & Algorithms

  • Designs visibility-aware procedures (odd–even sweep, radial atlas with ± signs).
  • Owns convergence studies and baselines for circles, ellipses, and polygons.
  • Runs complexity/accuracy benchmarks; documents limits and mitigations.

Systems & Frontend

  • Implements interactive canvases; keeps demos accessible and performant.
  • Maintains build tooling and test fixtures for numerical correctness.
  • Coordinates localization and analytics (non-invasive, anonymized).

Editorial Review & QA

  • Checks clarity, tone, and scope; enforces the evidence-led style.
  • Validates formulas and captions (MathJax + SVG semantics and accessibility).
  • Controls versioning of figures; ensures non-repetitive hero imagery.

Collaborations

We welcome collaborations with educators and researchers. A public contact form will be added once finalized.

.
Measuring Shape

Measuring Shape

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.

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.

Overview

Overview

GRG Overview

Generative Radial Geometry studies finite radial constructions and their measurement kernels. The current two-dimensional reference uses equal binary sectors, internal chord triangles, and external tangent triangles.

Current Reference

Definitions, kernel formulas, bounds, and exact-arithmetic error proofs.

Research History

Original Projection, Cartesian trapezoidal methods, and earlier Turns formulations retain their own definitions and scope. They are not interchangeable specifications.

Evidence

Geometric accuracy, floating-point stability, computational performance, and originality are separate questions. See Results and the benchmark protocol for their status.