×
O’Rourke, Joseph; Supowit, Kenneth J.

Some NP-hard polygon decomposition problems. (English) Zbl 0501.68036

IEEE Trans. Inf. Theory 29, 181-190 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0501.68036

Cited in 1 Review
Cited in 41 Documents

MSC:

68R99 Discrete mathematics in relation to computer science
68Q25 Analysis of algorithms and problem complexity
68T10 Pattern recognition, speech recognition

Keywords:

computational complexity of polygon decomposition; computational geometry; syntactic pattern recognition
Cite Review PDF
Full Text: DOI