Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Effectively labeling planar projections of polyhedra

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Kirousis, L.M. ; Comput. Technol. Inst., Patras, Greece

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

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:12 ,  Issue: 2 )