Abstract
A new implicit polynomial (IP) fitting method is presented. It provides
a different way of viewing the IP fitting problem from those of the
nonlinear optimization approaches. It requires less computation, and
can be done automatically or interactively. Linear Programming (LP) is
used to do the fitting. The approach can incorporate a variety of
distance measures and global geometric constraints.
{\it IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 20,
No. 2, February 1998.}