He found 15 ways, which generalized to methods like CORDIC, etc.
A couple years ago I was wondering if SDF shape representation could use something like a taxi cab distance metric to move floating point operations to integer, although I haven't spent too much time investigating it.
Meagher's octree system notably used only integer arithmetic with no integer multiplication/division:
> Efficient (linear time) algorithms have been developed for the Boolean operations (union, intersection and difference), geometric operations (translation, scaling and rotation), N-dimensional interference detection, and display from any point in space with hidden surfaces removed. The algorithms require neither floating-point operations, integer multiplications, nor integer divisions.
"How Many Ways Can You Draw a Circle?", the first *Jim Blinn's Corner* article:
https://ieeexplore.ieee.org/document/4057251
He found 15 ways, which generalized to methods like CORDIC, etc.
A couple years ago I was wondering if SDF shape representation could use something like a taxi cab distance metric to move floating point operations to integer, although I haven't spent too much time investigating it.