Comprehensive shape / modifier decomposition

[ProfLander]

Need to finish implementing the various shapes from Inigo Quilez' SDF reference.

Favor decomposing each shape into its constituent primitives and operators. Explicit implementations should only be created in cases where the compositional equivalent would result in a bound instead of a field, and those should be analyzed further to determine whether the algorithm used to achieve that end can itself be generalized.

[ProfLander]

Making progress; all modifiers are implemented, and the explicit Torus shape has been generalized into Sweep<Circle, Circle>.

[ProfLander]

Remaining 3D shapes of note:

Box Frame
Appears to be a set of boolean operations, but manages to avoid bounding somehow

Capped Torus
Appears to convert a line from cartesian to polar before rounding it into a capsule

Cone
Evaluates a 2D circle SDF, then somehow sweeps it along an axis while increasing radius and applying a sign

Round Cone
Appears to be a swept sphere with increasing radius

Cut Hollow Sphere / Death Star
Both seem arbitrary, but may contain a generalizable technique to avoid bound issues with booleans

Ellipsoid
Appears similar to Cone etc in practical terms, but using different mathematical properties to scale along an axis

Octahedron
Uses abs(p) for an 8-way mirror, but manages to avoid bounding somehow

Triangle / Quad
Are these 3D generalizations w/built in extrude?

2D shapes are all still of note; probably some interesting n-gon implementations there that may be generalizable into 3d prisms.

On prisms and reflection: Field approach likely predicated on finding angles containing a bound edge, then rounding them out with a point evaluation versus the nearest shape vertex.

[ProfLander]

Finished analysing 2D N-gon implementations.

Composition strategy:

• Mirror distance space along the exterior angle every 2 sides, flipping the mirror plane each step.
• A 1D line field is applied to the X axis, and an isosurface offset to the Y.
• The resulting position is then evaluated as a euclidean space by taking its length.
• Reversed for intuitiveness, this can be though of as create vertex -> push outward by radius -> extend sideways to create bottom face -> repeatedly mirror to create remaining faces

Optimization strategy:

• Evaluate one less mirror step, and apply a cheap global mirror (abs) to the resulting field in X for odd-sided shapes, and XY for even-sided shapes.

Notes:
This can be broken down into the following sub-operations:

• Abs mirror X / XY (conditional on SIDES % 2)
• Mirror / inverse mirror (conditional on step_idx % 2)
• 1D Line
• 1D Isosurface
• Point
• Sidedness (d *= y.signum())

It should be possible to build compositional machinery for these. Much of it already exists, but 1D distance functions and adapters to lift them into 2D functions will need to be implemented, as well as adapters for picking between SDFs based on some conditional.

[ProfLander]

Finished generalizing N-gon implementation; shapes up to decagon are now encoded as compositional type aliases.