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.

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.

Integration

Integration

Integration: Structural Optimization & Machine Learning

Category: Generative Radial Geometry (GRG)

GRG integrates with structural optimization (SIMP/level set) and with machine learning for parameter calibration. Angles are measured in turns with dyadic step Δu = 2^{-n} on the full turn; a quarter has M = 2^{\,n-2} steps. Formulas remain π-free at finite resolution.

$$ n \in \mathbb{N}_{\ge 0},\qquad \Delta u = 2^{-n},\qquad M = 2^{\,n-2}\ \text{(steps per quarter)}. $$

Topology Optimization Bridge

We expose GRG’s radial density as design variables for SIMP/level-set frameworks. Let x denote per-sector densities, mapped from radial weights:

$$ x(u_k)\;=\;\sigma\!\big(w(u_k;\,\theta)\big),\qquad u_k = k\,2^{-n},\ \ k=0,\ldots,2^{n}-1, $$

with a smooth logistic σ and parameters θ controlling w(u). A standard compliance-minimization model uses:

$$ \min_{x}\; C(x)=\mathbf f^\top \mathbf u \quad\text{s.t.}\quad \mathbf K(x)\,\mathbf u=\mathbf f,\;\; \sum_i x_i \le \bar{v}\,m,\;\; x_{\min}\le x_i\le 1. $$

By parameterizing x via GRG weights, the optimizer searches a low-dimensional, center-seeded space that preserves radial structure while meeting volume and stiffness targets.

Level-Set Coupling

Alternatively, drive a level-set ϕ by GRG fields: initialize ϕ from radial strips and evolve with curvature-regularized motion under structural sensitivities. GRG provides stable seeding and symmetric updates across quarters.

ML-Assisted Calibration

Given exemplars (e.g., bones, shells, corals), regress GRG parameters θ to match silhouettes or performance. Use mixed geometric + physical loss:

$$ \mathcal L(\theta)\;=\;\lambda_{\text{geom}}\,d_{\text{Chamfer}}\!\big(\partial S_{\text{GRG}}(\theta),\,\partial S^\*\big) \;+\; \lambda_{\text{phys}}\!\left(\alpha\,\big|A(\theta)-A^\*\big|+\beta\,\big|P(\theta)-P^\*\big|\right) \;+\;\lambda_{\text{reg}}\|\theta\|_2^2. $$

Perimeter and area use GRG quarter aggregation with Δu=2^{-n}:

$$ P(n)\;=\;4\sum_{k=1}^{M} 2\,s\!\left(2^{-(n+1)}\right),\qquad A(n)\;=\;4\sum_{k=1}^{M}\tfrac{1}{2}\,s\!\left(2^{-n}\right), \quad M=2^{\,n-2}. $$

Pipeline

  1. Radial seed & step: pick n so Δu=2^{-n}; choose rule for chords/strips (midpoint, averaged, Δx trapezoidal).
  2. Design variables: set θ for w(u) or direct densities x(u_k).
  3. Solver coupling: run SIMP/level-set; back-propagate sensitivities to θ.
  4. Calibration (optional): fit θ to exemplars using the mixed loss.
  5. Export: reconstruct full shape from quarter; output polylines/meshes.

Safety & Regularization

  • Step cap: enforce a minimum Δu_{\min} to prevent local collapse.
  • Curvature damping: penalize large changes of w(u) across adjacent sectors.
  • Volume guard: soft penalty if \sum x_i drifts from target fraction \bar v.

Interoperability

  • Inputs: seed, n, rule, parameters θ or densities x.
  • Outputs: perimeter P, area A, nodes/strips, optional field samples.
  • Formats: .OBJ polylines, .STEP (via downstream CAD), JSON config for reproducibility.

Defaults

  • Rule: chord — midpoint for perimeter; Δx trapezoidal for area.
  • n: start with n=10 (Δu=2^{-10}) and refine dyadically.
  • ML loss: set \lambda_{\text{geom}}=1, \lambda_{\text{phys}}=0.3, \lambda_{\text{reg}}=10^{-3} as safe starters.
Benchmarks

Benchmarks

Validation and Benchmark Protocol

This page specifies planned comparisons. It does not present a completed benchmark or a demonstrated performance advantage.

Separate Tasks

Measure circumference and area evaluation separately from boundary generation, rasterisation, and three-dimensional modelling. Equal sector counts alone do not make different tasks comparable.

Accuracy and Cost

Compare runtime at the same achieved error, and error at the same runtime. Report arithmetic format, rounding, memory, hardware, software versions, warm-up, repetitions, timing variability, setup cost, and precomputation.

Baselines

Include geometric bisection with inner–outer bounds, comparable weighted or extrapolated kernels, and direct analytical evaluation where appropriate. Give every method the same target and include its full computational cost.

Data and References

Begin with the circle kernels whose hypotheses are documented in the current formulation. Validate other shapes and three-dimensional methods separately. Publish reference precision and how it is obtained.

Convergence

The current regular-sector proofs distinguish second-order arithmetic kernels from fourth-order weighted kernels. These rates must not be transferred automatically to Cartesian trapezoids, endpoint-singular integrands, general shapes, or finite-precision implementations.

Reporting

Publish executable scripts, inputs, raw CSV or JSON, version identifiers, plots, and the conditions of every comparison. Former sample timing rows and schematic plots are not retained as measured results.

Selector

Selector

Choosing a GRG Method

Choose a method by its documented geometry, required output, error model, and implementation evidence.

Current Circle Measures

For regular binary sectors, the current formulation supplies arithmetic and weighted kernels, explicit area bounds, and exact-arithmetic convergence proofs. Use the stated domains and preserve the distinction between geometric approximation and rounding.

Historical Cartesian Methods

Projection and trapezoidal constructions are separate methods. Their endpoint behaviour, stopping rules, and error rates require independent validation.

General Shapes and Adaptivity

A circular chord–sagitta ratio alone is not a demonstrated universal curvature or stability selector. An adaptive rule must define the boundary, local error indicator, limits, and termination behaviour before it is recommended.

Performance

No automatic selector is claimed as validated here. Compare actual implementations under the benchmark protocol.