Preface |
Introduction / 1: |
Impossible Pictures / 2: |
Losing the Third Dimension / 2.1: |
Two Planar Surfaces / 2.2: |
Depth Order of Surfaces at a Point / 2.3: |
Cubic Corners and Improbable Objects / 2.4: |
Impossible Intersections / 2.5: |
Impossible Wireframe Projections / 2.6: |
Labeling Line Drawings of Polyhedra / 3: |
Historical Background / 3.1: |
Line Drawing Labelling as Optimization / 3.2: |
Parallel-Lines Constraint / 3.3: |
A Universal Constraint for Simple Junctions / 3.4: |
Lines Sharing the Same Two Regions / 3.5: |
Cyclic-Path Constraint / 3.6: |
Parallel Junctions on Distinct Faces / 3.7: |
Encoding of Soft Constraints / 3.8: |
Non-Manifold Scenes / 3.9: |
Discussion / 3.10: |
Discrete Inflation Using Cubic Corners / 4: |
Computer-Enhanced Perception / 4.1: |
Machine Interpretation of Line Drawings / 4.2: |
Depth Labels / 4.3: |
Depth Labels and Impossible Figures / 4.4: |
Propagation of Depth Labels / 4.5: |
Orthogonality Constraints on Cubic Corners / 4.6: |
Experimental Trials / 4.7: |
Adding Depth Information to Line Drawings / 4.8: |
Vertices Which Are Not Cubic Corners / 4.9: |
Conclusion / 4.10: |
A Rich Labeling Scheme for Curved Objects / 5: |
Labeling Line Drawings of Curved Objects / 5.1: |
Regularities in Man-Made Objects / 5.2: |
Planarity Constraints / 5.3: |
Constraints from Orthogonal Edges / 5.4: |
Examples of Drawing Interpretation / 5.5: |
Complete 3D Reconstruction / 5.6: |
Depth Recovery Through Linear Algebra / 5.7: |
Gradient Space and Gradient Directions / 6.1: |
Linear Constraints and Curved Objects / 6.2: |
Formulation of Linear Constraints / 6.3: |
Deriving Linear Constraints from a Drawing / 6.4: |
Vanishing Point Constraint / 6.4.1: |
Constraints from Collinearity or Intersections / 6.4.2: |
T-junction Constraint / 6.4.3: |
Convex/Concave Edge Constraints / 6.4.4: |
Coplanarity Constraints / 6.4.5: |
Hidden-Surface Coplanarity Constraints / 6.4.6: |
Orthographic Projection / 6.5: |
Physical Realizability of Drawings / 6.6: |
The Computational Problem / 6.7: |
Wireframe Projections / 6.8: |
Semantic and Numerical Line Labels / 7.1: |
Realizability / 7.3: |
All Wireframes Are Ambiguous / 7.4: |
Identifying Faces / 7.5: |
Common-Surface Constraints / 7.6: |
Unambiguous Wireframes / 7.7: |
Residual Ambiguity / 7.9: |
Constraints Between Distant Lines / 7.10: |
Tetrahedral Vertices / 7.11: |
Tangential Edges and Surfaces / 7.12: |
Rich Labelling Scheme / 7.13: |
Simplification of Combinatorial Problems / 7.14: |
Transformations of Combinatorial Problems / 8.1: |
When Local Reductions Suffice / 8.2: |
Arc Consistency / 8.3: |
Neighbourhood Substitution / 8.4: |
Simplification of Soft Constraint Problems / 8.5: |
Valuation Structures / 8.6: |
Valued Constraint Satisfaction / 8.7: |
Soft Arc Consistency Techniques / 8.8: |
Optimal Soft Arc Consistency / 8.9: |
Virtual Arc Consistency / 8.10: |
VAC Decomposition / 8.11: |
Soft Neighbourhood Substitution / 8.12: |
Tractability of Drawing Interpretation / 8.13: |
Tractable Constraint Classes / 9.1: |
Zero/One/All Constraints / 9.1.1: |
Max-Closed Constraints / 9.1.2: |
Characterization of Tractable Boolean Constraints / 9.1.3: |
Characterization of Tractable Boolean Valued Constraints / 9.1.4: |
Complexity of Line Drawing Interpretation / 9.2: |
3D Reconstruction of Ambiguous Pictures / 10: |
Reconstruction of Frontal Geometry / 10.1: |
Hidden-Part Reconstruction / 10.2: |
Bibliography |
Index |