Linear Programming Fitting of Implicit Polynomials
IEEE Trans. Pattern Anal. Mach. Intell.（1998）
摘要
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.
更多查看译文
关键词
approximation theory,computational geometry,curve fitting,image representation,linear programming,polynomials,distance approximation,fitting algorithm,geometric constraints,implicit polynomial,linear programming,shape representation
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要