Superformula
en.wikipedia.org
en.wikipedia.org
Many years ago, when Symbolics LISP machines roamed the earth, Alex Pentland wrote the first animation physics engine. Everything was a deformed superellipse, or rather the solid of rotation of one. You could apply a bend and a taper to a superellipse-generated solid. These were called "superquadrics".[1] I spent much time trying to come up with an analytical formula for the closest distance between two such objects, for collision detection. This was a dead end; polyhedra and meshes, although they required much more bookkeeping, were more useful in programs. Interest in superquadrics died out.
Also, what is the advantage of using the 'Superformula' to create most shapes as opposed to using some simple parametrization of meshes and enforcing symmetry or something of the like?
In that case, it feels like a loophole there people could just skip the annual fees until an opertunity to sue someone occurs and then pay for all the years at ones.
Feels also strange a patent that have been withdrawn could be sold.
In no country I guess. You have to transform your idea in something more concrete first. A piece of hardware, a process, a composition of matter you name it.
Imagine all those stupid ideas from just lying in the bed and thinking about being patented. Nothing would have been created but everything would have been patented. That's worse than patenting a formula or a piece of software.
It appears that USPTO has issued it several times [0]:
6505576 Pet Toy
6557495 Laser Pet Toy
6651591 Automatic laser pet toy and exerciser
6701872 Method and apparatus for automatically exercising a curious animal
[0] http://www.freepatentsonline.com/crazy.htmlWhether it'll stick once someone challenges it is another question.
I did not know you could patent a mathematical formula.
I had to look into this regarding an algorithm we're building and whether it's patentable. If your formula is a mere scheme or method implemented in a computer, it's likely to be rejected. The following links add detail:
http://www.fisheradamskelly.com.au/2015/12/full-federal-cour...
https://en.wikipedia.org/wiki/Alice_Corp._v._CLS_Bank_Intern...
http://www.ipwatchdog.com/2016/05/13/federal-circuit-says-so...
A second aspect of the present invention which further enhances
its ability to achieve high compression percentages, is its
ability to be applied to data recursively. Specifically, the
methods of the present invention are able to make multiple
passes over a file, each time further compressing the
file. Thus, a series of recursions are repeated until the
desired compression level is achieved.
...
Thus, one skilled in the art can see that by keeping the
appropriate counters, the direct bit encode method of the
present invention is effective for reducing an input string by
one bit regardless of the bit pattern of the input string.
What would one say about the examiner now?Actually, I am not even sure that they can enforce anything against a software company with this patent. Someone who distributes a software does not produce an "apparatus" so I am not sure if they can even launch a procedure based on that patent.
Caveat: not a patent lawyer.
> Genicap's patent calls out the formula's potential use in "graphics programs (e.g., 2D, 3D, etc.); CAD software; finite element analysis programs; wave generation programs; or other software," it doesn't specifically mention game design (procedurally generated or otherwise).
http://arstechnica.com/gaming/2016/07/no-mans-sky-faces-pote...
In general, one can fit many such curves through a finite set of points. http://math.stackexchange.com/questions/65970/can-a-function...
A question originally asked by Leibniz to determine the measure of usefulness of a law. https://plus.maths.org/content/omega-and-why-maths-has-no-to....
If you don't have the 6 parameters, good luck. A unique inverse is defined only for injective functions.
I'm not a huge fan of these random parametrizations; overall, it seems like they have no physical significance (yay! it can describe a bunch of things! I can do that anyways by picking a linear space with enough dimensions or a nice non-linear kernel and projecting into the first few principal components, and best of all, it's going to be fit directly to my problem). I'd like to be enlightened as to why this is such a big deal and why anyone would do this instead of parametrization of meshes for procedural generation? It seems a few comments here are referencing NMS, hence the question.
Here it is in complex numbers:
p = (r1*cos(ph1 + th) + 1.0*I*r2*sin(ph2 + th))*
(Abs(cos(m*th/4)/a)**n2 + Abs(sin(m*th/4)/b)**n3)**(-1/n1)
This can produce a number of interesting shapes that original Gielis transforms can't.PolarPlot[(Abs[Cos[2(t - Pi/2)/4]] + Abs[Sin[44(t - Pi/2)/4]])^(-1/(-0.2)), {t, 0, 2*Pi}, PlotRange -> {{-20, 20}, {-5, 32}}, PlotStyle -> Darker[Green, 0.2], PlotTheme -> "Marketing"]