File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Hierarchical structure to winged-edge structure: a conversion algorithm

TitleHierarchical structure to winged-edge structure: a conversion algorithm
Authors
KeywordsAlgorithm
Boundary Representation
Constructive Solid Geometry
Euler Poincare Formula
Free-Form Surfaces
Non-Manifold Faces
Solid Modelling
Winged-Edge Data Structure
Issue Date1988
PublisherSpringer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/00371/index.htm
Citation
The Visual Computer, 1988, v. 4 n. 3, p. 133-141 How to Cite?
AbstractThe 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. © 1988 Springer-Verlag.
Persistent Identifierhttp://hdl.handle.net/10722/156897
ISSN
2015 Impact Factor: 1.06
2015 SCImago Journal Rankings: 0.560

 

DC FieldValueLanguage
dc.contributor.authorChan, KCen_US
dc.contributor.authorTan, STen_US
dc.date.accessioned2012-08-08T08:44:27Z-
dc.date.available2012-08-08T08:44:27Z-
dc.date.issued1988en_US
dc.identifier.citationThe Visual Computer, 1988, v. 4 n. 3, p. 133-141en_US
dc.identifier.issn0178-2789en_US
dc.identifier.urihttp://hdl.handle.net/10722/156897-
dc.description.abstractThe 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. © 1988 Springer-Verlag.en_US
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/00371/index.htmen_US
dc.relation.ispartofThe Visual Computeren_US
dc.subjectAlgorithmen_US
dc.subjectBoundary Representationen_US
dc.subjectConstructive Solid Geometryen_US
dc.subjectEuler Poincare Formulaen_US
dc.subjectFree-Form Surfacesen_US
dc.subjectNon-Manifold Facesen_US
dc.subjectSolid Modellingen_US
dc.subjectWinged-Edge Data Structureen_US
dc.titleHierarchical structure to winged-edge structure: a conversion algorithmen_US
dc.typeArticleen_US
dc.identifier.emailTan, ST:sttan@hkucc.hku.hken_US
dc.identifier.authorityTan, ST=rp00174en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1007/BF01908896en_US
dc.identifier.scopuseid_2-s2.0-34250089523en_US
dc.identifier.volume4en_US
dc.identifier.issue3en_US
dc.identifier.spage133en_US
dc.identifier.epage141en_US
dc.publisher.placeGermanyen_US
dc.identifier.scopusauthoridChan, KC=24331046500en_US
dc.identifier.scopusauthoridTan, ST=7403366758en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats