scientific article; zbMATH DE number 2080924

MaRDI QIDQ4473991zbMATH OpenFDO

Authors MacIej Gebala

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2234/22340253.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 2206365
• The reconstruction of polyominoes from their orthogonal projections
• The reconstruction of some 3D convex polyominoes from orthogonal projections
• Reconstructing convex polyominoes from horizontal and vertical projections
• The reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-complete

Cited in

(9)

• The reconstruction of polyominoes from their orthogonal projections
• The number of convex polyominoes reconstructible from their orthogonal projections
• Further steps on the reconstruction of convex polyominoes from orthogonal projections
• Reconstruction of convex polyominoes from orthogonal projections of their contours
• The reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-complete
• The reconstruction of some 3D convex polyominoes from orthogonal projections
• scientific article; zbMATH DE number 2206365 (Why is no real title available?)
• Reconstructing convex polyominoes from horizontal and vertical projections
• Reconstructing \(hv\)-convex multi-coloured polyominoes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473991)