“Automated conversion of curvilinear wire-frame models to surface boundary models; a topological approach” by Brewer and Courter

  • ©John A. Brewer and S. Mark Courter

Conference:


Type:


Title:

    Automated conversion of curvilinear wire-frame models to surface boundary models; a topological approach

Presenter(s)/Author(s):



Abstract:


    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.

References:


    1. Brewer, J. A., “User’s Guide: Computer Graphics Program for Generation of Engineering Geometry (SKETCH)”, Waterways Experiment Station Report No. k-83-2, June 1983.
    2. Brewer, J. A., “Reference Manual: Computer Graphics Program for Generation of Engineering Geometry (SKETCH)”, Waterways Experiment Station Report No. k-83-2, September 1983.
    3. Cobb, E. C., “On the Extraction of Solid Geometry from a Wire Frame Geometric Data Base”, M.S. Thesis, University of Wisconsin-Madison, 1978.
    4. Deo, N., GRAPH THEORY WITH APPLICA- TIONS TO ENGINEERING AND COMPUTER SCIENCE, Englewood C l i f f s, NJ: Prentice-Hall, 1974.
    5. Dutton, R. D. and R. C. Brigham, “Efficiently Identifying the Faces of a Solid”, COMPUTERS AND GRAPHICS IN MECHANICAL ENGINEERING”– 7(2): 143-147; 1983.
    6. Ganter, M. A. and J. J. Uicker, “From Wire-Frame to Solid Geometric: Automated Conversion of Data Representations”, COMPUTERS IN MECHANICAL ENGINEERING– 2(2):40-45 (Sept. ’83).
    7. Hanrahan, P. M., “Creating Volume Models from Edge-Vertex Graphs”, ACM COMPUTER GRAPHICS– 16(3):77-84 (July ’82).
    8. Hocking, J. G. and G. S. Young, TOPOLOGY, Addison-Wesley, Reading, MA, 1061.
    9. Idesawa, M., “A System to Generate a Solid Figure from a Three View”, BULL. JSME– 16:216-225 (Feb. ’73).
    10. Lafue, G., “Recognition of Three- Dimensional Objects from Orthographic Views”, PROCEEDINGS 3RD ANNUAL CONFERENCE ON COMPUTER GRAPHICS, INTERACTIVE TECHNIQUES AND IMAGE PROCESSING, ACM/SIGGRAPH, July ’76, pp. 103-108.
    11. Markowski, G. and M. A. Wesley, “Fleshing Out Wire Frames”, IBM JOURNAL OF RESEARCH AND DEVELOPMENT — 24(5):582-597 (Sept. ’80).
    12. Paton, K., “An Algorithm for Finding a Fundamental Set of Cycles of a Graph”, COMM OF ACM– 12(9):514-518 (Sept. ’69).
    13. Tarjan, R., “An Efficient Planarity Algorithm”, Computer Science Department, Report No. CS-244-71, Stanford University, November 1971.


ACM Digital Library Publication: