Skip to main content
Springer Nature Link
Log in

Hierarchical structure to winged-edge structure: a conversion algorithm

  • Published:
The Visual Computer Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. 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.

    Google Scholar 

  2. 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

    Google Scholar 

  3. Brown CM (1982) PADL-2 a technical summary. IEEE Comput Graph Appl 2(2):69–84

    Google Scholar 

  4. 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)

  5. Weiler K (1985) Edge-based data structures for solid modelling in curved-surface environments. IEEE Comput Graph Appl 5(1):21–40

    Google Scholar 

  6. Baumgart BG (1974) Geometric modelling for computer vision. Ph.D. Dissertation, Dept Comput Sci, Stanford Univ (August 1974)

  7. Wilson PR (1985) Euler formulas and geometric modelling. IEEE Comput Graph Appl 5(8):24–36

    Google Scholar 

  8. 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)

  9. Tan ST, Chan KC (1986) Generation of high order surfaces over arbitrary polyhedral meshes. Computer-Aided Design 18(8):411–423

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, University of Hong Kong, Pokfulam Road, Hong Kong

    K. C. Chan & S. T. Tan

Authors
  1. K. C. Chan
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. S. T. Tan
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01908896

Key words