Abstract
The winged-edge data structure is advantageous for traversing the topological graph of the boundary representation of a solid object. This paper presents an algorithm for converting hierarchical boundary representations into representations in the winged-edge data structure. As a result of the conversion, the adjacency relationships of geometric entities embedded in hierarchical boundary representations,-which may be evaluated through boundary evaluation on solid objects defined via Boolean set-operations, can be easily and efficiently accessed.
Similar content being viewed by others
References
Braid IC, Hillyard RC, Stroud IA (1980) Stepwise construction of polyhedra in geometric modelling. In: Brodie KW (ed) Mathematical Methods in Computer Graphics and Design. Academic Press, London, pp. 123–141.
Woo TC, Wolter JD (1984) A constant expected time, linear storage data structure for representing three-dimensional Object. IEEE Trans Syst Man Cybern SMC-14(3):510–515
Brown CM (1982) PADL-2 a technical summary. IEEE Comput Graph Appl 2(2):69–84
Hartquist EE, Peterson DP, Voelcker HB (1981) BFILE/2: a boundary file for PADL-2. Computational Geometry Group Memo. No. 20, (CGGM-20), Production Automation Project, Univ Rochester (March 1981)
Weiler K (1985) Edge-based data structures for solid modelling in curved-surface environments. IEEE Comput Graph Appl 5(1):21–40
Baumgart BG (1974) Geometric modelling for computer vision. Ph.D. Dissertation, Dept Comput Sci, Stanford Univ (August 1974)
Wilson PR (1985) Euler formulas and geometric modelling. IEEE Comput Graph Appl 5(8):24–36
Silva CE (1981) Alternative definitions of faces in boundary representations of solid objects. Tech Memo. No. 36, (TM-36), Production Automation Project, Univ Rochester, (November 1981)
Tan ST, Chan KC (1986) Generation of high order surfaces over arbitrary polyhedral meshes. Computer-Aided Design 18(8):411–423
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chan, K.C., Tan, S.T. Hierarchical structure to winged-edge structure: a conversion algorithm. The Visual Computer 4, 133–141 (1988). https://doi.org/10.1007/BF01908896
Issue Date:
DOI: https://doi.org/10.1007/BF01908896