Area-preserving approximations of polygonal paths

Journal of Discrete Algorithms - Tập 4 - Trang 554-566 - 2006
Prosenjit Bose, Sergio Cabello1, Otfried Cheong2, Joachim Gudmundsson3, Marc van Kreveld4, Bettina Speckmann5
1Department of Mathematics, Institute for Mathematics, Physics and Mechanics, Ljubljana, Slovenia
2Division of Computer Science, KAIST, Daejeon, Korea
3NICTA, Sydney, Australia
4Institute for Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
5Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands

Tài liệu tham khảo

Alt, 1990, Approximation of convex polygons, vol. 443, 703 Alt, 1998, Matching convex shapes with respect to the symmetric difference, Algorithmica, 21, 89, 10.1007/PL00009210 G. Barequet, M.T. Goodrich, D.Z. Chen, O. Daescu, J. Snoeyink, Efficiently approximating polygonal paths in three and higher dimensions, in: Proc. 14th Annual ACM Symposium on Computational Geometry, 1998, pp. 317–326 Chan, 1996, Approximation of polygonal curves with minimum number of line segments or minimum error, Internat. J. Comput. Geom. Appl., 6, 59, 10.1142/S0218195996000058 Chen, 2003, Space-efficient algorithms for approximating polygonal curves in two-dimensional space, Internat. J. Comput. Geom. Appl., 13, 95, 10.1142/S0218195903001086 Cromley, 1992 Dent, 1999 R. Estkowski, J. Mitchell, Simplifying a polygonal subdivision while keeping it simple, in: Proc. 17th Symp. Comp. Geometry, 2001, pp. 40–49 Garey, 1979 Goodrich, 1995, Efficient piecewise-linear function approximation using the uniform metric, Discrete Comput. Geom., 14, 445, 10.1007/BF02570717 J. Gudmundsson, G. Narasimhan, M. Smid, Distance-preserving simplification of polygonal paths, in: Proc. 23rd Conf. Found. Software Techn. Theor. Comp. Science, 2003 Guibas, 1993, Approximating polygons and subdivisions with minimum link paths, Internat. J. Comput. Geom. Appl., 3, 383, 10.1142/S0218195993000257 Imai, 1986, Computational-geometric methods for polygonal approximations of a curve, Computer Vision Graph. Image Process., 36, 31, 10.1016/S0734-189X(86)80027-5 Imai, 1988, Polygonal approximations of a curve-formulations and algorithms, 71 Langerman, 2003, The complexity of halfspace area queries, Discrete Comput. Geom., 30, 639, 10.1007/s00454-003-2856-2 McMaster, 1992 Melkman, 1988, On polygonal chain approximation, 87 K.R. Varadarajan, Approximating monotone polygonal curves using the uniform metric, in: Proc. 12th Annual ACM Symposium on Computational Geometry, 1996, pp. 311–318 R.C. Veltkamp, Shape matching: similarity measures and algorithms, in: Proc. Shape Modeling International, 2001, pp. 188–199