Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable in Dimension 3

  • Yan GérardEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10502)


We consider a conjecture on lattice polytopes \(Q\subset \mathbb {R}^d\) (the vertices are integer points) or equivalently on finite subsets \(S\subset \mathbb {Z}^d\), Q and S being related by \(Q\cap \mathbb {Z}^d = S\) or \(Q=\mathrm {conv (S)}\): given the vertices of Q or the list of points of S and an integer n, the problem to determine whether there exists a (rational) polyhedron \(P\subset \mathbb {R}^d\) with at most n faces and verifying \(P \cap \mathbb {Z}^d= S\) is decidable.

In terms of computational geometry, it’s a problem of polyhedral separability of S and \(\mathbb {Z}^d \setminus S\) but the infinite number of points of \(\mathbb {Z}^d \setminus S\) makes it intractable for classical algorithms. This problem of digital geometry is however very natural since it is a kind of converse of Integer Linear Programming.

The conjecture is proved in dimension \(d=2\) and in arbitrary dimension for non hollow lattice polytopes Q [6]. The purpose of the paper is to extend the result to hollow polytopes in dimension \(d=3\). An important part of the work is already done in [5] but it remains three special cases for which the set of outliers can not be reduced to a finite set: planar sets, pyramids and marquees. Each case is solved with a particular method which proves the conjecture in dimension \(d=3\).


Pattern recognition Geometry of numbers Polyhedral separation Digital polyhedron Hollow lattice polytopes 


  1. 1.
    Asano, T., Brimkov, V.E., Barneva, R.P.: Some theoretical challenges in digital geometry: a perspective. Discrete Appl. Math. 157(16), 3362–3371 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Blanco, M., Haase, C., Hofmann, J., Santos, F.: The finiteness threshold width of lattice polytopes (2016)Google Scholar
  3. 3.
    Edelsbrunner, H., Preparata, F.: Minimum polygonal separation. Inform. Comput. 77(3), 218–232 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Forchhammer, S., Kim, C.: Digital squares, vol. 2, pp. 672–674. IEEE (1988)Google Scholar
  5. 5.
    Gerard, Y.: About the decidability of polyhedral separability in the lattice \(z ^d\). J. Math. Imaging Vis. (2017)Google Scholar
  6. 6.
    Gérard, Y.: Recognition of digital polyhedra with a fixed number of faces. In: Normand, N., Guédon, J., Autrusseau, F. (eds.) DGCI 2016. LNCS, vol. 9647, pp. 415–426. Springer, Cham (2016). doi: 10.1007/978-3-319-32360-2_32 CrossRefGoogle Scholar
  7. 7.
    Krishnaswamy, R., Kim, C.E.: Digital parallelism, perpendicularity, and rectangles. IEEE Trans. Pattern Anal. Mach. Intell. 9(2), 316–321 (1987)CrossRefGoogle Scholar
  8. 8.
    Megiddo, N.: Linear-time algorithms for linear programming in r\({}^{\text{3 }}\) and related problems. SIAM J. Comput. 12(4), 759–776 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Megiddo, N.: On the complexity of polyhedral separability. Discrete Comput. Geom. 3(4), 325–337 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Nakamura, A., Aizawa, K.: Digital squares. Comput. Vis. Graph. Image Process. 49(3), 357–368 (1990)CrossRefGoogle Scholar
  11. 11.
    Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)zbMATHGoogle Scholar
  12. 12.
    Ziegler, G.: Lectures on Polytopes. Graduate Texts in Mathematics. Springer, New York (1995)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.LIMOS - UMR 6158 CNRS/Université Clermont AuvergneClermont-ferrandFrance

Personalised recommendations