An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
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.
- 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
- D.A. Huffman, “Impossible objects as nonsense sentences,” Machine Intelligence, 6 (1971), 295–323.Google Scholar
- 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
- 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
- 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
- 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
- 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
- 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