An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects |
| |
Authors: | Nick D. Dendris Iannis A. Kalafatis Lefteris M. Kirousis |
| |
Affiliation: | (1) Department of Computer Engineering and Informatics, University of Patras, Rio, 265 00 Patras, Greece;(2) Computer Technology Institute, P.O. Box 1122, 261 10 Patras, Greece |
| |
Abstract: | 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, considered to be an important step towards understanding the object from its 2-D drawing. Combinatorially, the labellability problem is a 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 lineartime labelling algorithm. Moreover, we show that the algorithm has a fast parallel version that executes inO(log3n) time on an Exclusive-Read-Exclusive-Write Parallel Random Access Machine withO(n3/log3n) 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.This research was partially supported by the European Community ESPRIT Basic Research Program under contracts 7141 (project ALCOM II) and 6019 (project Insight II). |
| |
Keywords: | image analysis planar projections of 3-D objects line drawings labelling of lines of drawings efficient parallel algorithms |
本文献已被 SpringerLink 等数据库收录! |
|