Re: [Algorithms] Efficient / reliable means of determining thepatentstatus of a given algorithm (sh
Brought to you by:
vexxed72
From: Tom F. <tom...@ee...> - 2006-08-27 08:48:27
|
> I read dozens of articles, some of which describe > advanced techniques. None mention patents or restrictions on usage, so > I don't worry about it. This "don't ask, don't tell" policy is the current state of the art for = this insanity. Luckily, at the rate at which patents are being awarded, and = the absurd opacity and generality of the language, there is increasingly no possible way anybody can keep up with the patent list and still do any actual work, especially if nobody goes out of their way to bring = relevant ones to your attention, so independent invention becomes a more and more plausible defence as time goes on. Which is crazy, obviously. As is the entire system. TomF. > -----Original Message----- > From: gda...@li...=20 > [mailto:gda...@li...] On=20 > Behalf Of Chris Chapman > Sent: 27 August 2006 01:35 > To: Game Development Algorithms > Subject: Re: [Algorithms] Efficient / reliable means of=20 > determining thepatentstatus of a given algorithm (shadow=20 > mapping, in this case) >=20 >=20 > On 27/08/06, Will Vale <wi...@se...> wrote: > > Anything where lawsuits might be involved should probably be treated > > with a little more seriousness than you suggest. > > > > > I believe the best thing to do is keep your mouth shut..=20 > only people who > > > have access to code knows how you implemented an algorithm. >=20 > Indeed - the problem doesn't come when you're implementing a solution, > the problem comes when you have to sign a piece of paper which says > you have not infringed any IP, copyright or patent. Even if you don't > have it in your employment contract (as we do), chances are the > development agreement between publisher and developer will have a > clause which states that you have not knowingly infringed. If it comes > down to it later, you signing that clause and then infringing anyway > is all anyone needs to make sure the compensation buck stops with you; > and the publisher has a copy of your code which they can readily > audit. >=20 > However you'd have to ask a lawyer whether unknowingly infringing on a > patent (say, if the article you researched didn't mention it) is a > viable defense. I read dozens of articles, some of which describe > advanced techniques. None mention patents or restrictions on usage, so > I don't worry about it. >=20 > ChrisC > Black Company Studios >=20 > -------------------------------------------------------------- > ----------- > Using Tomcat but need to do more? Need to support web=20 > services, security? > Get stuff done quickly with pre-integrated technology to make=20 > your job easier > Download IBM WebSphere Application Server v.1.0.1 based on=20 > Apache Geronimo > http://sel.as-us.falkag.net/sel?cmd=3Dlnk&kid=3D120709&bid=3D263057& dat=3D121642 _______________________________________________ GDAlgorithms-list mailing list GDA...@li... https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_id=3D6188 |