Pictures as Boolean formulas. A method for recognizing polyhedral scenes
From MaRDI portal
Recommendations
- The complexity of recognizing polyhedral scenes
- scientific article; zbMATH DE number 3958768
- An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
- Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes
- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
Cites work
Cited in
(9)- The complexity of recognizing polyhedral scenes
- Three-dimensional connected pictures are not recognizable by finite-state acceptors
- Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes
- scientific article; zbMATH DE number 3958768 (Why is no real title available?)
- scientific article; zbMATH DE number 4067739 (Why is no real title available?)
- scientific article; zbMATH DE number 1206599 (Why is no real title available?)
- scientific article; zbMATH DE number 2019661 (Why is no real title available?)
- Computer Algebra and Geometric Algebra with Applications
- An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
This page was built for publication: Pictures as Boolean formulas. A method for recognizing polyhedral scenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513326)