ERG volume

ERG volume

GRG Sphere — Points • Surface • ERG Volume • Smooth

Abstract. A sphere of radius $R$ is generated as a quasi-uniform point set. With sampling step:

$$ h_{\max}(\kappa,\varepsilon)\;=\;2\sqrt{\frac{\varepsilon}{\kappa}}, \qquad \kappa=\frac{1}{R}, $$

the reconstructed surface is perfect at scale $\varepsilon$ (geometric error $\le \varepsilon$); area and ERG volume converge with $O(h^2)$ error.

1) Definitions

  • Resolution $\varepsilon$: admissible indistinguishability threshold.
  • Step $h$: distance between nearby surface samples.
  • Curvature $\kappa$: for a sphere, $\kappa = 1/R$.
  • Perfect at scale $\varepsilon$: Hausdorff distance (ideal ↔ reconstructed) $\le \varepsilon$.

Geometric reminder (sagitta of an arc of radius $R$):

$$ s \;\approx\; \frac{h^{2}}{8R} \;=\; \frac{\kappa h^{2}}{8} $$
$$ \Rightarrow\quad h_{\max} \;=\; 2\sqrt{\frac{\varepsilon}{\kappa}} \;=\; 2\sqrt{\varepsilon R}. $$

2) Points → Surface → ERG volume

2.1 Points (quasi-uniform sampling)

  • Spherical Fibonacci lattice: simple and isotropic.
  • Icosphere (subdivided icosahedron): regular connectivity.

Point count (triangles near-equilateral, area $(\sqrt{3}/2)\,h^2$):

$$ N \;\approx\; \frac{4\pi R^{2}}{(\sqrt{3}/2)\,h^{2}} \;=\; \frac{2\pi}{\sqrt{3}}\,\frac{R}{\varepsilon}. $$

It grows linearly with $R/\varepsilon$.

2.2 Surface (closed, oriented mesh)

Triangulate coherently on the spherical manifold. Face normal: $\mathbf{n}_f \propto (p_j-p_i)\times(p_k-p_i)$.

Discrete area:

$$ A \;=\; \sum_{\triangle ijk} \frac{1}{2}\,\big\|\, (p_j-p_i)\times(p_k-p_i)\, \big\|. $$

2.3 ERG volume (from closed surface)

With an oriented closed mesh (tetrahedra w.r.t. the origin):

$$ V_{\mathrm{ERG}} \;=\; \frac{1}{6}\sum_{\triangle ijk}\big((p_i\times p_j)\cdot p_k\big). $$

Convergence: $A$ and $V_{\mathrm{ERG}}$ approach the ideal values with $O(h^2)$ error.

3) Smooth$_{\varepsilon}$ (when and how)

Goal: stabilize normals and reflections without exceeding $\varepsilon$.

  1. Local Taubin/MLS filter (forward/backward pass to avoid shrinkage).
  2. Projection onto the sphere ($\lVert v\rVert \to R$).
  3. Check: Hausdorff (pre/post) $\le \varepsilon/2$.
  4. Smoothed normals from local MLS fit ($\ge C^{1}$ continuity).

When it’s not needed: if you only measure area/ERG volume and faceting is already below the $\varepsilon$-scale threshold.

4) Algorithm (concise)

input: R, ε
κ ← 1/R
h_max ← 2*sqrt(ε/κ)       # = 2*sqrt(εR)
N    ← round((2π/√3) * R/ε)

P ← fibonacci_sphere(N)    # or icosphere(h_max)
T ← triangulate_on_sphere(P)
orient(T)                  # outward normals

A ← sum_areas(T)
V_ERG ← tetra_volume(T)

if need_smooth_normals:
    P' ← taubin_mls(P, T)  # controlled smoothing
    P' ← project_to_sphere(P', R)
    assert hausdorff(P, P') ≤ ε/2
    recompute_normals(P', T)
output: (P, T, A, V_ERG, normals)

5) Checks & validation

  • Hausdorff distance (ideal ↔ mesh) $\le \varepsilon$.
  • Triangle quality (avoid extreme angles).
  • No self-intersections.
  • $O(h^{2})$ convergence for area and ERG volume.

6) Why it matters

The sphere is an ideal testbed: constant curvature and closed-form $A,V$. The chain points → surface → ERG volume → smooth at scale $\varepsilon$ sets the general GRG/ERG procedure for solids.

7) Figures (inline SVG)

Sagitta geometry: s ≈ h^2/(8R) Arc of radius R, chord of length h, sagitta s; all lengths in the same units. R O s | ⟂ h
F3 — Sagitta relation used to bound $h_{\max}$.
Quasi-uniform points on a sphere Wireframe sphere with dots to suggest Fibonacci vs icosphere distributions.
F1 — Point distribution (Fibonacci vs icosphere idea) at equal $h$.

8) FAQ

Is “perfect” absolute?
No: it is perfect at scale $\varepsilon$. Details $<\,\varepsilon$ are not guaranteed.

Do we always need smoothing?
No: needed for normals/optics stability; otherwise optional.

Fibonacci or icosphere?
Both work: Fibonacci is simple and isotropic; icosphere offers regular connectivity.

How do I choose $\varepsilon$?
Based on use: measurement accuracy, rendering, fabrication, etc.

ERG Quick Calculator ERG grid icon Concentric arcs with dyadic ticks representing ERG refinement.

This compact tool computes the quarter-sampling step Δu and the grid size K from the dyadic level b, previews the uk values, and exports the grid to CSV.

Inputs

  • Dyadic level b ∈ ℕ≥0 (recommended range: 0–18)
  • Optional: recent estimates V2b-1 and V2b to check the dyadic stopping rule
\[ \Delta u \;=\; 2^{-(b+2)}, \qquad K \;=\; \left\lfloor \frac{1}{\Delta u} \right\rfloor \;=\; 2^{\,b+2}. \]
\[ \text{Stop if}\quad \bigl|V_{2^{b}} - V_{2^{b-1}}\bigr| \le \varepsilon. \]

Calculator

Results

  • Δu = — (exact: —)
  • K = — (i.e., number of grid points)
  • N = — (turns-first level, N = 2b)
Preview of u-grid uk = k · Δu

First 8: —

Last 8: —

—

Practical checklist

  • Use dyadic refinement: increase b until the dyadic difference falls below ε.
  • Quarter-sampling is assumed: Δu = 2-(b+2).
  • Grid is deterministic; CSV can be versioned for reproducibility.
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.

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.

GRG Speed & Hardware

GRG Speed & Hardware

GRG Computational Cost and Hardware

Binary sector indices and power-of-two scaling motivate investigation of digital implementations. They do not establish a performance advantage for the complete calculation.

Define the Task

Kernel evaluation, generation of radial nodes, drawing a raster boundary, filling a disk, and building a volume are different tasks. Their complexity depends on the output representation and implementation.

Count Complete Costs

Include generation or retrieval of geometric ratios, arithmetic precision, divisions and square roots, precomputation, memory access, and output generation. A final multiplication alone does not describe the complete cost.

Hardware Directions

Possible directions include fixed-point arithmetic, lookup tables, vectorisation, parallel execution, and programmable hardware. Each requires an implementation and measurements; their availability is not a claim that GRG already outperforms alternatives.

Evidence Required

Use the benchmark protocol and publish comparisons at equal achieved accuracy. Test rounding, cancellation, overflow, and refinement limits. State what is geometric identity and what is numerical approximation.

Current Status

The current formulation supplies geometric kernels and accuracy proofs. This page makes no unsupported claim of speed, stability, throughput superiority, or three-dimensional scaling.