Approximation of Point Sets by 1-Corner Polygonal Chains

References

• Ballard D.H. A hierarchical representation for curves. Communications of the ACM (1981) 24:310–321Crossref, Google Scholar
• Chan W.S., Chin F. Approximation of polygonal curves with minimum number of line segments or minimum error. International Journal of Computational Geometry & Applications (1996) 6:59–77Crossref, Google Scholar
• Chin F., Choi A., Luo Y. Optimal generating kernels for image pyramids by piecewise fitting. IEEE Transactions on Pattern Analysis and Machine Intelligence (1992) 14:1190–1198Crossref, Google Scholar
• Díaz-Báñez J.M. Location of Linear and Piecewise Linear Structures. (1998) . Ph.D. thesis (in Spanish), Univ. de Sevilla, Sevilla, SpainGoogle Scholar
• Díaz-Báñez J.M., Gómez F., Hurtado F. Some Problems on Approximation of Point Sets by Polygonal Chains. (1999) . Technical Report 11-1999, Dept. de Mat. Aplic., EUI, Univ. Pol. de Madrid, Madrid, SpainGoogle Scholar
• Drezner Z., Wesolowsky G.O. Location of an obnoxious route. J. Operational Research Society (1989) 40:1011–1018Crossref, Google Scholar
• Gentle J.E., Sposito V.N., Narula S.C. Algorithms for unconstrained L1 simple linear regression. Computational Statistics and Data Analysis (1988) 6:335–339Crossref, Google Scholar
• Guibas L., Ramshaw L., Stolfi J. A kinetic framework for computational geometry. Proc. 24th FOCS (1983) 100–111Crossref, Google Scholar
• Hakimi S.L., Schmeichel E.F. Fitting polygonal functions to a set of points in the plane. Graphical Models and Image Processing (1991) 53:132–136Crossref, Google Scholar
• Imai H., Iri M. An optimal algorithm for approximating a piecewise linear function. Journal of Information Processing (1986) 9:159–162Google Scholar
• Imai H., Iri M., Toussaint G.T. Polygonal approximations of curve-formulations and algorithms. Computational Morphology (1988) (North Holland, Amsterdam) Crossref, Google Scholar
• Kirkpatrick D., Snoeyink J. Tentative prune-and-search for computing fixed points with applications to geometric computation. Fundamenta Informaticae (1995) 22:353–370Crossref, Google Scholar
• Kurozumi Y., Davis W.A. Polygonal approximation by the minimax method. Computer Graphics and Image Processing (1982) 19:248–264Crossref, Google Scholar
• Megiddo N. Linear time algorithms for linear programming in IR3 and related problems. SIAM J. Comput. (1983) 12:759–776Crossref, Google Scholar
• Megiddo N. Linear programming in linear time when the dimension is fixed. Journal of the Association for Computing Machinery (1984) 31:114–127Crossref, Google Scholar
• Melkman A., O'Rourke J., Toussaint G.T. On polygonal chain approximation. Computational Morphology (1988) (North Holland, Amsterdam) Crossref, Google Scholar
• O'Rourke J. An on-line algorithm for fitting straight lines between data ranges. Comm. ACM (1981) 24:574–578Crossref, Google Scholar
• O'Rourke J.Computational Geometry in C (1998) 2nd ed.(Cambridge University Press, New York) Crossref, Google Scholar
• Rice J.The Approximation of Functions, vol. 1: The Linear Theory (1964) (Addison-Wesley)Google Scholar
• Toussaint G.T. Complexity, convexity and unimodality. International Journal of Computer and Information Sciences (1984) 13:197–217Crossref, Google Scholar
• Toussaint G.T. On the complexity of approximating polygonal curves in the plane. Proc. IASTED, International Symposium on Robotics and Automation (1985) (Lugano, Switzerland) Google Scholar