An algorithm for finding a fundamental set of cycles of a graph
Communications of the ACM
Recognition of three-dimensional objects from orthographic views
SIGGRAPH '76 Proceedings of the 3rd annual conference on Computer graphics and interactive techniques
Creating volume models from edge-vertex graphs
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
IBM Journal of Research and Development
Polygon properties calculated from the vertex neighborhoods
SCG '87 Proceedings of the third annual symposium on Computational geometry
Designing solid objects using interactive sketch interpretation
I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
A shortest path approach to wireframe to solid model conversion
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Identifying Faces in a 2D Line Drawing Representing a Manifold Object
IEEE Transactions on Pattern Analysis and Machine Intelligence
Smart sketch system for 3D reconstruction based modeling
SG'03 Proceedings of the 3rd international conference on Smart graphics
nD object representation and detection from Single 2D line drawing
IWMM'04/GIAE'04 Proceedings of the 6th international conference on Computer Algebra and Geometric Algebra with Applications
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 general and efficient method for finding cycles in 3D curve networks
ACM Transactions on Graphics (TOG)
A procedure for computing the symmetric difference of regions defined by polygonal curves
Journal of Symbolic Computation
| Hi-index | 0.00 |
An algorithm is presented for automatically converting data representing unambiguous, three-dimensional objects in wire-frame form with curvilinear edges into a boundary representation. The method is an important extension to a previously published algorithm based on graph theory and topology. The new method automatically detects and resolves anomalies, such as necks which may appear to be faces, that formerly required human intervention. The topological basis for the solution to this problem is given along with a description of what topological properties a well defined three-dimensional object should have. An implementation has been coded and examples of results are included.