Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    The visual computer 4 (1988), S. 133-141 
    ISSN: 1432-2315
    Keywords: Winged-edge data structure ; Algorithm ; Solid modelling ; Boundary representation ; Constructive solid geometry ; Non-manifold faces ; Euler poincare formula ; Free-form surfaces
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: 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.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...