Abstract
We adapt several important properties from affine geometry so that they become applicable in the digital plane. Each affine property is first reformulated as a property about line transversals. Known results about transversals are then used to derive Helly type theorems for the digital plane. The main characteristic of a Helly type theorem is that it expresses a relation holding for a collection of geometric objects in terms of simpler relations holding for some of the subcollections. For example, we show that in the digital plane a collection of digital lines is parallel if and only if each of its 2-membered subcollections consists of two parallel digital lines. The derived Helly type theorems lead to many applications in digital image processing. For example, they provide an appropriate setting for verifying whether lines detected in a digital image satisfy the constraints imposed by a perspective projection. The results can be extended to higher dimensions or to other geometric systems, such as projective geometry.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.B. Amenta, “Helly theorems and generalized linear programming,” Ph.D. thesis, University of California at Berkeley, 1979.
T.A. Anderson and C.E. Kim, “Representation of digital line segments and their preimages,” Comput. Vision Graphics Image Process., Vol. 30, pp. 279–288, 1985.
E. Andres, R. Acharya, and C. Sibata, “Discrete analytical hyperplanes,” CVGIP: Graphical Models and Image Processing, Vol. 59, pp. 302–309, 1997.
M. Atallah and C. Bajaj, “Efficient algorithms for common transversals,” Inform. Process. Lett., Vol. 25, pp. 87–91, 1987.
D. Avis and M. Doskas, “Algorithms for high dimensional stabbing problems,” Discrete Applied Math., Vol. 27, pp. 39–48, 1990.
L. Danzer, B. Grünbaum, and V. Klee, “Helly' theorem and its relatives,” in Proceedings of the Symposium on Pure Mathematics, Vol. 7, Convexity, American Mathematical Society, Providence, RI, 1963, pp. 101–180.
M. Dhome, M. Richetin, J.-T. Lapresté, and G. Rives, “Determination of the attitude of 3-D objects from a single perspective view,” IEEE Trans. Pattern Anal. Machine Intell., Vol. 11, pp. 1265–1278, 1989.
L. Dorst and A. Smeulders, “Discrete representation of straight lines,” IEEE Trans. Pattern Anal. Machine Intell., Vol. 6, pp. 450–462, 1984.
L. Dorst and A. Smeulders, “Discrete straight line segments: parameters, primitives and properties,” in Vision Geometry, R.A. Melter, A. Rosenfeld, and P. Bhattacharya (Eds.), Contemporary Mathematics Series, Vol. 119, American Mathematical Society, 1991, pp. 45–61.
H. Hadwiger and H. Debrunner, Combinatorial Geometry in the Plane, Holt, Rinehart and Winston: New York, 1964.
E. Helly, “Über Mengen konvexer Körper mit gemeinschaftligen Punkten,” Jahresber. D.M.V., Vol. 32, pp. 175–176, 1923.
C.E. Kim, “Three-dimensional digital line segments,” IEEE Trans. Pattern Anal. Machine Intell., Vol. 5, pp. 231–234, 1983.
D.G. Larman, “Helly type properties of unions of convex sets,” Mathematika, Vol. 15, pp. 53–59, 1968.
M.D. McIlroy, “Anote on discrete representation of lines,”AT&T Technical Journal, Vol. 64, pp. 481–490, 1985.
G.F. McLean, “Geometric correction of digitized art,” CVGIP: Graphical Models and Image Processing, Vol. 58, pp. 142–154, 1996.
F.P. Preparata and M.I. Shamos, Computational Geometry, Springer-Verlag: New York, 1985.
J.-P. Reveillès, “Géométrie discrète, calcul en nombres entiers et algorithmique,” Thèse d'Etat, Université Louis Pasteur, Strasbourg, 1991.
R.T. Rockafellar, Convex Analysis, Princeton Univerisity Press: Princeton, 1970.
C. Ronse, “Asimple proof of Rosenfeld' characterization of digital straight line segments,” Pattern Recognition Letters, Vol. 3, pp. 323–326, 1985.
C. Ronse, “Criteria for approximation of linear and affine functions,” Arch. Math., Vol. 46, pp. 371–384, 1986.
C. Ronse, “A note on the approximation of linear and affine functions: The case of bounded slope,” Arch. Math., Vol. 54, pp. 601–609, 1990.
A. Rosenfeld, “Digital straight line segments,” IEEE Trans. Comput., Vol. 23, pp. 1264–1269, 1974.
J. Stoer and C. Witzgall, Convexity and Optimization in Finite Dimensions I, Springer: Berlin, 1970.
I. StojmenoviĆ and R. TošiĆ, “Digitization schemes and the recognition of digital straight lines, hyperplanes, and flats in arbitrary dimensions,” in Vision Geometry, R.A. Melter, A. Rosenfeld, and P. Bhattacharya (Eds.), Contemporary Mathematics Series, Vol. 119, American Mathematical Society, 1991, pp. 197–212.
H. Tverberg, “Proof of Grünbaum' conjecture on common transversals for translates,” Discrete Comput. Geom., Vol. 4, pp. 191–203, 1989.
F. Ulupinar and R. Nevatia, “Constraints for interpretation of line drawings under perspective projection,” CVGIP: Image Understanding, Vol. 53, pp. 88–96, 1991.
F.A. Valentine, “The dual cone and Helly type theorems,” in Proceedings of the Symposium on Pure Mathematics, Vol. 7, Convexity, American Mathematical Society, Providence, RI, 1963, pp. 473–493.
P. Veelaert, “On the flatness of digital hyperplanes,” J. Math. Imaging and Vision, Vol. 3, pp. 205–221, 1993.
P. Veelaert, “Helly type theorems in the digital plane,” Technical report DG98-01, University of Ghent, Dept. ELIS, 1998.
R. Wenger, “Ageneralization of Hadwiger' transversal theorem to intersecting sets,” Discrete Comput. Geom., Vol. 5, pp. 383–388, 1990.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Veelaert, P. Geometric Constructions in the Digital Plane. Journal of Mathematical Imaging and Vision 11, 99–118 (1999). https://doi.org/10.1023/A:1008325426721
Issue Date:
DOI: https://doi.org/10.1023/A:1008325426721