On Fri, Sep 5, 2008 at 6:16 PM, John Randall <[EMAIL PROTECTED]> wrote: > If f is a polynomial, then solving the intersection problem for a > given u also involves polynomials. In general this will be hard.
Can you recommend something less general than arbitrary polynomials, where this would not be so hard? Conic sections, I guess, would not be too hard... but ideally I would like something a bit more general than that. Does anyone have any catalogs of functions where this intersection problem is not hard? Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
