Closed trbabb closed 1 year ago
sdf()
project()
intersect(ray)
has_concept<Shape, Concept>
Bounded.h
Concepts.h
clip()
Trace.h
Hit.h
LUDecomp
PLUDecomposition
linear_solve()
x
b
inv()
geom::multiply_add()
det()
Dual
-march=native
Vec3d
Vec2f
sdf()
added to a bunch of shapesproject()
added to a bunch of shapesintersect(ray)
added to a bunch of shapesproject()
in Rect (was projecting to corners)has_concept<Shape, Concept>
, which helps with testingBounded.h
toConcepts.h
project()
from Frustum (for now) because it was wrongclip()
andproject()
are now distinctTrace.h
andHit.h
(and all associated methods)LUDecomp
PLUDecomposition
classlinear_solve()
changed to solvex
in place and passb
in one variablelinear_solve()
can solve multipleb
at onceinv()
linear_solve()
b
geom::multiply_add()
inv()
,det()
,Dual
-march=native
, is 20x (!!!) faster when running over a flat array.Vec3d
,Vec2f
, ...)