Scaling of Plane Figures That Assures Faithful Digitization
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.
Keywordsdigital geometry lattice polygon scaling factor polyhedral reconstruction NP-hard problem
Unable to display preview. Download preview PDF.
- 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.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
- 10.Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)Google Scholar