A polynomial algorithm for recognizing images of polyhedra

Lefteris M. Kirousis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem of recognizing a 3D polyhedron from a 2-dimensional projection is studied. The problem is known to be NP-complete in general. A polynomial algorithm is presented, given some information about the non-contour lines of the image.

Original languageEnglish (US)
Title of host publicationVLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings
EditorsKurt Mehlhorn, Fillia Makedon, T. Papatheodorou, P. Spirakis
PublisherSpringer Verlag
Pages194-204
Number of pages11
ISBN (Print)9783540167662
DOIs
StatePublished - 1986
EventAegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1986 - Loutrak, Greece
Duration: Jul 8 1986Jul 11 1986

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume227 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceAegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1986
Country/TerritoryGreece
CityLoutrak
Period7/8/867/11/86

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A polynomial algorithm for recognizing images of polyhedra'. Together they form a unique fingerprint.

Cite this