File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/BF01908896
- Scopus: eid_2-s2.0-34250089523
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Hierarchical structure to winged-edge structure: a conversion algorithm
Title | Hierarchical structure to winged-edge structure: a conversion algorithm |
---|---|
Authors | |
Keywords | Algorithm Boundary Representation Constructive Solid Geometry Euler Poincare Formula Free-Form Surfaces Non-Manifold Faces Solid Modelling Winged-Edge Data Structure |
Issue Date | 1988 |
Publisher | Springer 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? |
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. © 1988 Springer-Verlag. |
Persistent Identifier | http://hdl.handle.net/10722/156897 |
ISSN | 2023 Impact Factor: 3.0 2023 SCImago Journal Rankings: 0.778 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chan, KC | en_US |
dc.contributor.author | Tan, ST | en_US |
dc.date.accessioned | 2012-08-08T08:44:27Z | - |
dc.date.available | 2012-08-08T08:44:27Z | - |
dc.date.issued | 1988 | en_US |
dc.identifier.citation | The Visual Computer, 1988, v. 4 n. 3, p. 133-141 | en_US |
dc.identifier.issn | 0178-2789 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/156897 | - |
dc.description.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. © 1988 Springer-Verlag. | en_US |
dc.language | eng | en_US |
dc.publisher | Springer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/00371/index.htm | en_US |
dc.relation.ispartof | The Visual Computer | en_US |
dc.subject | Algorithm | en_US |
dc.subject | Boundary Representation | en_US |
dc.subject | Constructive Solid Geometry | en_US |
dc.subject | Euler Poincare Formula | en_US |
dc.subject | Free-Form Surfaces | en_US |
dc.subject | Non-Manifold Faces | en_US |
dc.subject | Solid Modelling | en_US |
dc.subject | Winged-Edge Data Structure | en_US |
dc.title | Hierarchical structure to winged-edge structure: a conversion algorithm | en_US |
dc.type | Article | en_US |
dc.identifier.email | Tan, ST:sttan@hkucc.hku.hk | en_US |
dc.identifier.authority | Tan, ST=rp00174 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1007/BF01908896 | en_US |
dc.identifier.scopus | eid_2-s2.0-34250089523 | en_US |
dc.identifier.volume | 4 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.spage | 133 | en_US |
dc.identifier.epage | 141 | en_US |
dc.publisher.place | Germany | en_US |
dc.identifier.scopusauthorid | Chan, KC=24331046500 | en_US |
dc.identifier.scopusauthorid | Tan, ST=7403366758 | en_US |
dc.identifier.issnl | 0178-2789 | - |