This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Feb 1990
Volume: 12,
Issue: 2
On page(s): 123-130
ISSN: 0162-8828
References Cited: 9
CODEN: ITPIDJ
INSPEC Accession Number: 3629825
Digital Object Identifier: 10.1109/34.44400
Current Version Published: 2002-08-06
Abstract
A well-known method for interpreting planar projections (images)
of three-dimensional polyhedra is to label their lines by the
Clowes-Huffman scheme. However, the question of whether there is such a
labeling has been shown to be NP-complete. A linear-in-time algorithm is
given that answers the labelability question under the assumption that
some information is known about those edges of the polyhedron both of
whose faces are visible. In many cases, this information can be derived
from the image itself. Moreover, the algorithm has an effective parallel
version, i.e. with polynomially many processors it can be executed in
time polynomial in log n
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
