A Symmetric GRG Kernel for Area

A Symmetric GRG Kernel for Area

A Symmetric GRG Kernel for Area

The binary radial formulation combines complementary internal and external sector triangles. The area kernel uses one internal contribution and two external contributions, unlike the circumference kernel’s two-to-one chord–tangent balance.

Geometric Elements

Resolve one Turn into N equal symmetric sectors. Let a be the internal triangle’s height, h half its chord, and e half the external tangent side. Define q = h/a.

$$
N=2^b,\quad b\ge2,\quad R>0,\qquad a^2+h^2=R^2,\quad e=R\frac ha.
$$
$$
I_b=ah=R^2\frac{q_b}{1+q_b^2},\qquad E_b=Re=R^2q_b.
$$

Two Area Kernels

$$
A_m=\frac N2(I_b+E_b),\qquad A_w=\frac N3(I_b+2E_b).
$$

Accuracy for the Defined Triangles

The current formulation gives an analytical verification using a local integral as an exact sector reference, not as a kernel input.

$$
F(q)=\int_0^q\frac{dt}{1+t^2},\qquad A_T(R)=NR^2F(q_b).
$$
$$
\begin{aligned}A_m-A_T&=NR^2\left(-\frac{q_b^3}{6}+\frac{3q_b^5}{10}+O(q_b^7)\right),\\A_w-A_T&=NR^2\left(\frac{2q_b^5}{15}+O(q_b^7)\right).\end{aligned}
$$

Regular geometric bisection yields a scale bound. Together with the expansion, it proves second-order total error for the arithmetic kernel and fourth-order total error for the weighted kernel in exact arithmetic.

$$
0\lt q_b\le\frac4N,\qquad A_m-A_T=O(N^{-2}),\qquad A_w-A_T=O(N^{-4}).
$$

The same analysis proves the following bracket for these sectors:

$$
A_{\mathrm{in}}\le A_m\le A_T\le A_w\le A_{\mathrm{out}}.
$$

Sampling and Scope

$$
\Delta u=\frac1{4N}.
$$

The earlier version introduced this quarter-step sampling parameter inside each module. The proof here concerns the complete sector triangles defined above. A different sample-based area construction requires its own explicit definition and proof.

GRG length and area kernel inversion A clean schematic comparison between the GRG circumference kernel, based on two internal chord contributions and one external tangent contribution, and the proposed GRG area kernel, based on one internal area contribution and two external area contributions. Length kernel 2 chord + 1 tangent Chord Chord Tangent Area kernel 1 internal + 2 external Internal External External weight inversion
Internal–external weights are reversed between the circumference and area kernels. This diagram is schematic; the triangle definitions determine the calculation.

Research Status

The cancellation is established for the regular triangular elements above. This does not establish original authorship of the weighting, numerical stability of an implementation, or a computational advantage. Those questions require separate literature and implementation comparisons.

Earlier revisions of this page described fourth-order behaviour as a candidate. The current analytical clarification identifies the geometric assumptions under which that behaviour follows.

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.

Methods

Methods

Methods and Their Scope

Current Binary Radial Kernels

The current formulation defines regular equal sectors, local chord–tangent lengths, triangular areas, and weighted kernels. Its proofs concern those definitions.

Earlier Methods

Algorithm Specifications

A runnable method must identify initial values, refinement or direct evaluation, arithmetic format, outputs, and stopping conditions. A geometry identity alone is not a runtime benchmark.

Extensions

Adaptive sampling, general curves, multiple seeds, and three-dimensional constructions require their own definitions and validation. No error order or performance advantage is transferred automatically from the regular-circle proof.

Continuous

Continuous

GRG — Continuous Model

Continuous Model: Radial Fields, Well-posedness & Stability

Category: Generative Radial Geometry (GRG)

We describe a continuous model that interprets GRG’s inside-out construction as integral curves of a center-seeded field on a domain Ω ⊂ ℝ². Let the seed be s ∈ Ω. For any point x ≠ s define the unit radial direction er(x) = (x−s)/‖x−s‖ and a tangential direction et(x) orthogonal to er. The guidance field blends radial and tangential components.

Radial Guidance Field

The model uses a field F: Ω\\{s} → ℝ² with radial bias

$$ \mathbf{F}(x) \;=\; a(x)\, \mathbf{e}_r(x) \;+\; b(x)\, \mathbf{e}_t(x), \qquad a(x) > 0 $$

Integral curves γ(τ) solve

$$ \dot{\gamma}(\tau) \;=\; \mathbf{F}\big(\gamma(\tau)\big), \qquad \gamma(0)=x_0,\quad x_0\in\Omega\setminus\{s\} $$

Each turn-angle u ∈ [0,1) selects an initial direction, producing a family of trajectories that reach the boundary. The discrete GRG construction samples these trajectories at uniform steps in turns.

Well-posedness

  • Existence & Uniqueness. If F is locally Lipschitz on Ω\\{s} then trajectories starting away from the seed have local existence and uniqueness while they remain in that domain. Global continuation and boundary arrival require additional hypotheses.
  • Termination. Trajectories stop when they hit ∂Ω. Dirichlet-type constraints prescribe a target boundary, while Neumann-type constraints control flux through ∂Ω.

Stability to Perturbations

If F has Lipschitz constant L, perturbing the seed by ε yields trajectories with deviation bounded by

$$ \|\gamma_\varepsilon(\tau) - \gamma(\tau)\| \;\le\; C\,\varepsilon\, e^{L\tau} $$

In practice we keep L moderate via smoothing of a(x), b(x) and by capping curvature of trajectories.

Regularization & Safety

  • Step lower bound. Minimum angular step Δu_{\min} to avoid local collapse.
  • Curvature damping. Add −λ\,κ(\gamma)\,\mathbf{e}_t to reduce spiraling near thin features.
  • Line-search. Backtrack the last advance if distance to boundary decreases below a threshold.

Multi-Seed and Holes

For non-simply connected domains or shapes with holes we blend fields from auxiliary seeds s_i with weights w_i(x):

$$ \mathbf{F}(x) \;=\; \sum_{i=1}^{m} w_i(x)\,\Big(a_i(x)\,\mathbf{e}_r^{(i)}(x) + b_i(x)\,\mathbf{e}_t^{(i)}(x)\Big), \qquad \sum_i w_i(x)=1,\ \ w_i(x)\ge 0 $$

Hole guards choose weights that vanish across cut-loci to prevent ambiguous paths.

Discrete Connection

Sampling each trajectory at uniform steps in turns yields the GRG primitives used for chord sums and radial strips. The continuous model justifies convergence as resolution increases. With turns-first sampling and dyadic refinement, the discrete GRG primitives converge monotonically as b increases.

Radial field with boundary, hole guard and trajectories Center-seeded field with trajectories to the boundary, auxiliary seed for a hole, and example paths. s (seed) aux seed ∂Ω hole guard
Center-seeded field with trajectories to the boundary, auxiliary seed for a hole, and example paths.

Practical Defaults

  • Field coefficients. a(x)=1 near the seed, tapering to maintain stable speed; b(x) small and smooth to avoid spirals.
  • Adaptive control. Increase samples where the curvature proxy exceeds a threshold; cap Δu.
  • Refinement (dyadic). Use the dyadic level b ∈ ℕ≥0 with N = 2^b samples and step Δu = 2^{-b}; increasing b yields monotone refinement.
  • Reconstruction. Quarter symmetry reconstructs the full figure; multi-seed blending covers non-simply connected domains.