Skip to main content
Log in

Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes

  • Published:
International Journal of Computer Vision Aims and scope Submit manuscript

Abstract

The machine interpretation of line drawings has applications both in vision and geometric modelling. This paper extends the classic technique of assigning semantic labels to lines subject to junction constraints, by introducing new constraints (often between distant lines). These include generic constraints between lines lying on a path in the drawing as well as preference constraints between the labellings of pairs of junctions lying on parallel lines. Such constraints are essential to avoid an exponential number of legal labellings of drawings of objects with non-trihedral vertices.

The strength of these constraints is demonstrated by their ability to identify the unique correct labelling of many drawings of polyhedral objects with tetrahedral vertices. These new constraints also allowed us to deduce a general polyhedral junction constraint for the case when there is no limit on the number of faces which can meet at a junction.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Clowes, M.B. 1971. On seeing things. Artificial Intelligence, 2:79–116.

    Article  Google Scholar 

  • Conesa Pastor, J., Company Calleja, P., Gomis Marti, J.M. 1999. Initial modelling strategies for geometrical reconstruction - optimisation-based approaches. In Proc. 11th Int. Conf. on Design Tools and Methods in Industrial Engineering, pp. 161–171.

  • Cooper, M.C. 1993. Interpretation of line drawings of complex objects. Image and Vision Computing, 11(2):82–90.

    Article  Google Scholar 

  • Cooper, M.C. 1997. Interpreting line drawings of curved objects with tangential edges and surfaces. Image and Vision Computing, 15:263–276.

    Article  Google Scholar 

  • Cooper, M.C. 1998. The tractability of segmentation and scene analysis. Int. J. Computer Vision, 30(1):27–42.

    Article  Google Scholar 

  • Cooper, M.C. 1999. Linear-time algorithms for testing the realisability of line drawings of curved objects. Artificial Intelligence, 108:31–67.

    Article  MathSciNet  MATH  Google Scholar 

  • Cooper, M.C. 2000. Linear constraints for the interpretation of line drawings of curved objects. Artificial Intelligence, 119:235–258.

    Article  MathSciNet  MATH  Google Scholar 

  • Cooper, M.C. 2001. The interpretation of line drawings with contrast failure and shadows. International J. Computer Vision, 43:75–97.

    Article  MATH  Google Scholar 

  • Cooper, M.C. 2003. Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems, 134:311–342.

    Article  MathSciNet  MATH  Google Scholar 

  • Cooper, M.C. 2005. Wireframe projections: physical realisability of curved objects and unambiguous reconstruction of simple polyhedra. International Journal of Computer Vision, 64(1):69–88.

    Article  Google Scholar 

  • Cooper, M.C. and Schiex, T. 2004. Arc consistency for soft constraints. Artificial Intelligence, 154(1–2):199–227.

    Article  MathSciNet  MATH  Google Scholar 

  • Cooper, M.C. 2004. Cyclic consistency: A local reduction operation for binary valued constraints. Artificial Intelligence, 155(1–2):69–92.

    Article  MathSciNet  MATH  Google Scholar 

  • Draper, S.W. 1981. The use of gradient and dual space in line-drawing interpretation. Artificial Intelligence, 17:461–508.

    Article  Google Scholar 

  • Grimstead, I.J. and Martin, R.R. 1996. Incremental line labelling for sketch input of solid models. Computer Graphics Forum, 15(2):155–166.

    Article  Google Scholar 

  • Huffman, D.A. 1971. Impossible objects as nonsense sentences. In: B. Meltzer and D. Mitchie (Eds.), Machine Intelligence 6, Edinburgh University Press, Endinburgh, pp. 295–323.

    Google Scholar 

  • Huffman, D.A. 1977. Realizable configurations of lines in pictures of polyhedra. In: E.W. Elcock and D. Michie (Eds.), Machine Intelligence 8, Ellis-Horwood, Chichester, UK, pp. 493–509.

    Google Scholar 

  • Kirousis, L.M. 1990. Effectively labelling planar projections of polyhedra. IEEE Trans. on Pattern Analysis and Machine Intelligence, 12(2):123–130.

    Article  Google Scholar 

  • Kirousis, L.M. and Papadimitriou, C.H. 1988. The complexity of recognizing polyhedral scenes. J. Comput. System Sci., 37(1):14–38.

    Article  MathSciNet  MATH  Google Scholar 

  • Larrosa, J. and Schiex, T. 2003. In the quest of the best form of local consistency for weighted CSP. In Proc. IJCAI, pp. 239–244.

  • Lipson, H. and Shpitalni, M. 1996. Optimisation-based reconstruction of a 3D object from a single freehand line drawing. Computer-Aided Design, 28(8):651–663.

    Article  Google Scholar 

  • Malik, J. 1987. Interpreting line drawings of curved objects. International J. Computer Vision, 1:73–103.

    Article  Google Scholar 

  • Parodi, P., Lancewicki, R., Vijh, A., and Tsotos, J.K. 1998. Empirically-derived estimates of the complexity of labelling line drawings of polyhedral scenes. Artificial Intelligence, 105: 47–75.

    Article  MathSciNet  MATH  Google Scholar 

  • Parodi, P. and Torre, V. 1994. On the complexity of labelling perspective projections of polyhedral scenes. Artificial Intelligence, 70:239–276.

    Article  MathSciNet  MATH  Google Scholar 

  • Piquer Vicent, A., Company Calleja, P., and Martin, R.R. 2003. Skewed mirror symmetry in the 3D reconstruction of polyhedral models. Journal of WSCG, 11(1).

  • Schiex, T., Fargier, H., and Verfaillie, G. 1995. Valued constraint satisfaction problems: hard and easy problems. In Proc. of the 14th IJCAI, Montreal, Canada, pp. 631–637.

  • Sugihara, K. 1984. A necessary and sufficient condition for a picture to represent a polyhedral scene. IEEE Trans. Pattern Anal. Machine Intell., 6(5):578–586.

    Article  Google Scholar 

  • Sugihara, 1986. Machine Interpretation of Line Drawings. MIT Press, Cambridge, MA, 1986.

  • Varley, P.A.C. 2004. email message.

  • Varley, P.A.C. and Martin, R.R. 2000. A system for constructing boundary representation solid models from a two-dimensional sketch. In Proc. Geometric Modelling and Processing 2000, R. Martin and W. Wang (Eds.). IEEE Computer Society Press, pp. 13–30.

  • Varley, P.A.C. and Martin, R.R. 2001. The junction catalogue for labelling line drawings of polyhedra with tetrahedral vertices. International Journal of Shape Modeling, 7(1):23–44.

    Google Scholar 

  • Varley, P.A.C. and Martin, R.R. 2002. Estimating depth from line drawings. In Proc. 7th ACM Symposium on Solid Modelling and Applications, pp. 180–191.

  • Varley, P.A.C. and Martin, R.R. 2003. Deterministic and probabilistic approaches to labelling line drawings of engineering objects. International Journal of Shape Modeling, 9(1):79–99.

    MATH  Google Scholar 

  • Varley, P.A.C., Suzuki, H., and Martin, R.R. 2004. Interpreting line drawings of objects with K-vertices. In Proc. Geometric Modelling and Processing 04, S.-M. Hu and H. Pottmann (Eds.), pp. 249–358.

  • Waltz, D. 1975. Understanding line drawings of scenes with shadows. In P.H. Winston (Ed.), Psychology of Computer Vision. McGraw-Hill, New York, pp. 19–91.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Martin C. Cooper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cooper, M.C. Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes. Int J Comput Vision 73, 195–212 (2007). https://doi.org/10.1007/s11263-006-9783-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11263-006-9783-7

Keywords

Navigation