Machine interpretation of line drawings
Machine interpretation of line drawings
Three-dimensional computer vision
Three-dimensional computer vision
On the automatic reconstruction of a 3D object's constructive solid geometry representation from its 2D projection line drawing
Identification of Faces in a 2D Line Drawing Projection of a Wireframe Object
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the consistency of line-drawings, obtained by projections of piecewise planar objects
Journal of Mathematical Imaging and Vision
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Communications of the ACM
A Graph-Based Method for Face Identification from a Single 2D Line Drawing
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Engineering Graphics
Identifying Faces in a 2D Line Drawing Representing a Manifold Object
IEEE Transactions on Pattern Analysis and Machine Intelligence
Interpreting a 3D object from a rough 2D line drawing
VIS '90 Proceedings of the 1st conference on Visualization '90
Interpreting Line Drawings of Objects with K-Vertices
GMP '04 Proceedings of the Geometric Modeling and Processing 2004
Topological analysis of a single line drawing for 3D shape recovery
Proceedings of the 2nd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Evolutionary Search for Faces from Line Drawings
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Computer Vision
A Simple and Fast Min-Cut Algorithm
Theory of Computing Systems
Frontal geometry from sketches of engineering objects: is line labelling necessary?
Computer-Aided Design
Technical Section: An optimisation-based reconstruction engine for 3D modelling by sketching
Computers and Graphics
A survey on geometrical reconstruction as a core technology to sketch-based modeling
Computers and Graphics
IBM Journal of Research and Development
nD polyhedral scene reconstruction from single 2D line drawing by local propagation
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
A method for reconstructing sketched polyhedral shapes with rounds and fillets
SG'10 Proceedings of the 10th international conference on Smart graphics
Proceedings of the 2013 ACM conference on Pervasive and ubiquitous computing adjunct publication
A general and efficient method for finding cycles in 3D curve networks
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |
The problem of identifying the topology implied by wireframe drawings of polyhedral objects requires the identification of face loops, loops of edges which correspond to a face in the object the drawing portrays. In this paper, we survey the advantages and limitations of known approaches, and present and discuss test results which illustrate the successes and failures of a currently popular approach based on Dijkstra's Algorithm. We conclude that the root cause of many failure cases is that the underlying algorithm assumes that the cost of traversing an edge is fixed. We propose a new polynomial-order algorithm for finding faces in wireframes. This algorithm could be adapted to any graph-theoretical least-cost circuit problem where the cost of traversing an edge is not fixed but context-dependent.