I've got a polygon of n points. How can I simplify out noisy edges? [more inside]
posted by soma lkzx on Mar 31, 2009 - 12 answers

How can I work out if a point x,y,z is contained by a cone ? [more inside]
posted by matholio on Jan 14, 2007 - 15 answers

Programming/geometry: in a Flash program (you don't need to know Flash to answer this), I'm trying to place rectangular images at random positions on the screen. There are already images on the screen. I need to make sure that the new, randomly-placed images don't obscure the images already there. [more inside]
posted by grumblebee on Sep 29, 2005 - 25 answers

I am working on a project involving some 3d programming (in AutoLisp), and have managed to muddle through with what I remember of university geometry. I run into basic geometry problems (i.a.: find the 3d point where 2 lines intersect, given only the start points, angles and slope of the lines) which I manage to laboriously and clumsily solve. I'm sure most of these problems have 'canonical' solutions, worked out by graphic programmers. Is there any online resource for algorithms and formulas for typical 3d programming problems?
A good, simple explanation of the theory (and application in 3d graphics) of transformation matrixes would be nice, too.
posted by signal on Sep 3, 2004 - 6 answers