File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/0045-7949(88)90089-2
- Scopus: eid_2-s2.0-0023861242
- WOS: WOS:A1988L516600004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A hidden-line algorithm using picture subdivision technique
Title | A hidden-line algorithm using picture subdivision technique |
---|---|
Authors | |
Issue Date | 1988 |
Publisher | Pergamon. 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? |
Abstract | An 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 Identifier | http://hdl.handle.net/10722/144823 |
ISSN | 2023 Impact Factor: 4.4 2023 SCImago Journal Rankings: 1.274 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lo, SH | en_HK |
dc.date.accessioned | 2012-02-06T04:41:21Z | - |
dc.date.available | 2012-02-06T04:41:21Z | - |
dc.date.issued | 1988 | en_HK |
dc.identifier.citation | Computers And Structures, 1988, v. 28 n. 1, p. 37-45 | en_HK |
dc.identifier.issn | 0045-7949 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/144823 | - |
dc.description.abstract | An 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.language | eng | - |
dc.publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/compstruc | en_HK |
dc.relation.ispartof | Computers and Structures | en_HK |
dc.rights | NOTICE: 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.title | A hidden-line algorithm using picture subdivision technique | en_HK |
dc.type | Article | en_HK |
dc.identifier.email | Lo, SH:hreclsh@hkucc.hku.hk | en_HK |
dc.identifier.authority | Lo, SH=rp00223 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/0045-7949(88)90089-2 | - |
dc.identifier.scopus | eid_2-s2.0-0023861242 | en_HK |
dc.identifier.volume | 28 | en_HK |
dc.identifier.issue | 1 | en_HK |
dc.identifier.spage | 37 | en_HK |
dc.identifier.epage | 45 | en_HK |
dc.identifier.isi | WOS:A1988L516600004 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Lo, SH=7401542444 | en_HK |
dc.identifier.issnl | 0045-7949 | - |