File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A hidden-line algorithm using picture subdivision technique

TitleA hidden-line algorithm using picture subdivision technique
Authors
Issue Date1988
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/compstruc
Citation
Computers And Structures, 1988, v. 28 n. 1, p. 37-45 How to Cite?
AbstractAn algorithm is presented for removing hidden lines for isometric or perspective projections of three-dimensional objects. Lines connecting nodal points are first retrieved from the model to be displayed. Instead of testing against the entire population of the projected planes to see if a line is totally or partially hidden, only potential covering planes belonging to a certain neighbourhood of the line are considered. Shifting from a global view to a local view, the efficiency of the algorithm is much improved; in fact the CPU time required for a plot increases only linearly with the number of planes present in the model. Improvement can also be found in the hidden-line elimination process (search for intersection and hidden portions) where classifications and case subdivisions are generalised and combined, and calculations for their determinations are also simplified. Examples of various degrees of complexity are given. © 1987.
Persistent Identifierhttp://hdl.handle.net/10722/144823
ISSN
2015 Impact Factor: 2.425
2015 SCImago Journal Rankings: 1.710
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLo, SHen_HK
dc.date.accessioned2012-02-06T04:41:21Z-
dc.date.available2012-02-06T04:41:21Z-
dc.date.issued1988en_HK
dc.identifier.citationComputers And Structures, 1988, v. 28 n. 1, p. 37-45en_HK
dc.identifier.issn0045-7949en_HK
dc.identifier.urihttp://hdl.handle.net/10722/144823-
dc.description.abstractAn algorithm is presented for removing hidden lines for isometric or perspective projections of three-dimensional objects. Lines connecting nodal points are first retrieved from the model to be displayed. Instead of testing against the entire population of the projected planes to see if a line is totally or partially hidden, only potential covering planes belonging to a certain neighbourhood of the line are considered. Shifting from a global view to a local view, the efficiency of the algorithm is much improved; in fact the CPU time required for a plot increases only linearly with the number of planes present in the model. Improvement can also be found in the hidden-line elimination process (search for intersection and hidden portions) where classifications and case subdivisions are generalised and combined, and calculations for their determinations are also simplified. Examples of various degrees of complexity are given. © 1987.en_HK
dc.languageeng-
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/compstrucen_HK
dc.relation.ispartofComputers and Structuresen_HK
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Computers & Structures. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers & Structures, [VOL 28, ISSUE 1, 1988] DOI 10.1016/0045-7949(88)90089-2-
dc.titleA hidden-line algorithm using picture subdivision techniqueen_HK
dc.typeArticleen_HK
dc.identifier.emailLo, SH:hreclsh@hkucc.hku.hken_HK
dc.identifier.authorityLo, SH=rp00223en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/0045-7949(88)90089-2-
dc.identifier.scopuseid_2-s2.0-0023861242en_HK
dc.identifier.volume28en_HK
dc.identifier.issue1en_HK
dc.identifier.spage37en_HK
dc.identifier.epage45en_HK
dc.identifier.isiWOS:A1988L516600004-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridLo, SH=7401542444en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats