An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects

  • Nick D. Dendris
  • Iannis A. Kalafatis
  • Lefteris M. Kirousis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)


Labelling the lines of a planar line drawing of a 3-D object in a way that reflects the geometric properties of the object is a much studied problem in computer vision and considered to be an important step towards understanding the object from its 2-D drawing. Combinatorially, the labellability problem is a restricted version of the Constraint Satisfaction Problem and has been shown to be NP-complete even for images of polyhedral scenes. In this paper, we examine scenes that consist of a set of objects each obtained by rotating a polygon around an arbitrary axis. The objects are allowed to arbitrarily intersect or overlay. We show that for these scenes, there is a sequential linear-time labelling algorithm. Moreover, we show that the algorithm has a fast parallel version that executes in O(log4n) time on a EREW PRAM with O(n3/log2n) processors. The algorithm not only answers the decision problem of labellability, but also produces a legal labelling, if there is one. This parallel algorithm should be contrasted with the techniques of dealing with special cases of the constraint satisfaction problem. These techniques employ an effective, but inherently sequential, relaxation procedure in order to restrict the domains of the variables.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. P. Alevizos, “A linear algorithm for labeling planar projections of polyhedra,” Proc. IEEE/RSJ Int. Workshop on Intelligent Robots and Systems (Osaka, Japan, 1991), 595–601.Google Scholar
  2. M.B. Clowes, “On seeing things,” Artifical Intelligence, 2 (1971), 79–116.CrossRefGoogle Scholar
  3. M. Goldberg and T. Spencer, “A new parallel algorithm for the maximal independent set problem,” SIAM J. Computing, 18 (1989), 419–427.CrossRefGoogle Scholar
  4. D.A. Huffman, “Impossible objects as nonsense sentences,” Machine Intelligence, 6 (1971), 295–323.Google Scholar
  5. R.M. Karp and V. Ramachandran, “Parallel algorithms for shared-memory machines,” in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, vol. A (Elsevier, 1990) 869–942.Google Scholar
  6. R.M. Karp and A. Wigderson, “A fast parallel algorithm for the maximal independent set problem,” J. Association of Computing Machinery, 32 (1985), 762–773.Google Scholar
  7. S. Kasif, “On the parallel complexity of discrete relaxation in constraint satisfaction networks,” Artificial Intelligence, 45 (1990), 275–286.CrossRefGoogle Scholar
  8. L.M. Kirousis and C.H. Papadimitriou, “The complexity of recognizing polyhedral scenes,” Journal of Computer and System Sciences, 37 (1988) 14–38.Google Scholar
  9. L.M. Kirousis, “Effectively labeling planar projections of polyhedra,” IEEE Transactions on Pattern Analysis and Machine Intelligence 12 (1990) 123–130.CrossRefGoogle Scholar
  10. M. Luby, “A simple parallel algorithm for the maximal independent set problem,” SIAM J. Computing 15 (1986), 1036–1053.CrossRefGoogle Scholar
  11. J. Malik, “Interpreting line drawings of curved objects,” International J. of Computer Vision, 1 (1987), 73–103.CrossRefGoogle Scholar
  12. J. Malik and D. Maydan, “Recovering three-dimensional shape from a single image of curved objects,” IEEE Transactions on Pattern Analysis and Machine Intelligence 11 (1989) 555–566.Google Scholar
  13. A.K. Mackworth and E.C. Freuder, “The complexity of some polynomial network consistency algorithms for constraint satisfaction problems,” Artificial Intelligence 25 (1985), 65–74.CrossRefGoogle Scholar
  14. U. Montanari and F. Rossi, “Constraint relaxation may be perfect,” Artificial Intelligence, 48 (1991), 143–170.CrossRefGoogle Scholar
  15. K. Sugihara, “A necessary and sufficient condition for a picture to represent a polyhedral scene,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 6 (1984), 578–586.Google Scholar
  16. D. Waltz, “Understanding line drawings of scenes with shadows,” in: P.H. Winston (ed.), The Psychology of Computer Vision, (McGraw-Hill, New York, 1975), 19–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Nick D. Dendris
    • 1
  • Iannis A. Kalafatis
    • 1
  • Lefteris M. Kirousis
    • 1
    • 2
  1. 1.Department of Computer Engineering and InformaticsUniversity of PatrasPatrasGreece
  2. 2.Computer Technology InstitutePatrasGreece

Personalised recommendations