Scaling of Plane Figures That Assures Faithful Digitization

  • Valentin E. Brimkov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4958)


In this paper we propose a method for obtaining a faithful digitization of certain broad classes of plane figures, so that the original continuous object and its digitization feature analogous geometric properties. The approach is based on an appropriate scaling of a given figure so that the obtained one admits digitization satisfying some desirable conditions. Informally speaking, we show that from certain point on, a continuous object and its digitization are in a sense equivalent. In terms of computational complexity, the scaling factor is easily computable. As a corollary of the presented theory we prove the strong NP-hardness of the problem of obtaining a polyhedron reconstruction in which the facets are trapezoids or triangles.


digital geometry lattice polygon scaling factor polyhedral reconstruction NP-hard problem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Asano, Ta., Asano, Te., Imai, H.: Partitioning a polygonal region into trapezoids. J. ACM 33, 290–312 (1986)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Brimkov, V.E.: Discrete volume polyhedrization: Complexity and bounds on performance. In: Tavares,, et al. (eds.) Computational Modelling of Objects Represented in Images: Fundamentals, Methods and Applications. Proceedings of the International Symposium CompIMAGE 2006, Coimbra (Portugal), October 21-22, pp. 117–122. Taylor & Francis, Abington (2006)Google Scholar
  3. 3.
    Chaselle, B., Dobkin, D.P.: Decomposing a polygon into its convex parts. In: Proc. 11th Annual ACM Sympos. on Theory Comput., pp. 38–48 (1979)Google Scholar
  4. 4.
    Debled-Renesson, I., Reveillès, J.-P.: A linear algorithm for segmentation of digital curves. International Journal of Pattern Recognition and Artificial Intelligence 9(4), 635–662 (1995)CrossRefGoogle Scholar
  5. 5.
    Feschet, F., Tougne, L.: On the min dss problem of closed discrete curves. Discrete Applied Mathematics 151(1-3), 138–153 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Garey, M., Johnson, D.: Computers and Intractability. W.H. Freeman & Company, San Francisco (1979)zbMATHGoogle Scholar
  7. 7.
    Klette, R., Rosenfeld, A.: Digital Geometry - Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)zbMATHGoogle Scholar
  8. 8.
    Latecki, L.J., Rosenfeld, A.: Recovering a polygon from noisy data. Computer Vision and Image Understanding 86, 1–20 (2002)CrossRefGoogle Scholar
  9. 9.
    Lingas, A.: The power of non-rectilinear holes. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 369–383. Springer, Heidelberg (1982)CrossRefGoogle Scholar
  10. 10.
    Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)Google Scholar
  11. 11.
    Serra, J.: Image Analysis and Mathematical Morphology. Academic Press, London (1982)zbMATHGoogle Scholar
  12. 12.
    Sivignon, I., Dupont, F., Chassery, J.-M.: Decomposition of three-dimensional discrete objects surface into discrete plane pieces. Algorithmica 38, 25–43 (2004)zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Stelldinger, P., Latecki, L.J., Siqueira, M.: 3D object digitization: Topological equivalence between a 3D object and the reconstruction of its digital image. IEEE Transactions on Pattern Analysis and Machine Intelligence 29(1), 126–140 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Valentin E. Brimkov
    • 1
  1. 1.Mathematics DepartmentSUNY Buffalo State CollegeBuffaloUSA

Personalised recommendations