Effectively Labeling Planar Projections of Polyhedra

Authors:
L. M. Kirousis
Affiliations:
-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1990

Citing 3
Cited 5

Parallel graph algorithms

ACM Computing Surveys (CSUR)
Artificial intelligence (2nd ed.)

Artificial intelligence (2nd ed.)
The complexity of recognizing polyhedral scenes

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985

The Tractability of Segmentation and Scene Analysis

International Journal of Computer Vision
Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes

International Journal of Computer Vision
Technical Section: Extracting a polyhedron from a single-view sketch: Topological construction of a wireframe sketch with minimal hidden elements

Computers and Graphics
Pictures as Boolean Formulas

Journal of Mathematical Imaging and Vision
Special Section on Expressive Graphics: A constrained genetic algorithm for line labelling of line drawings with shadows and table-lines

Computers and Graphics

Quantified Score

Hi-index	0.14

Visualization

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.