File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Perspective projection of non-convex polyhedra

TitlePerspective projection of non-convex polyhedra
Authors
Issue Date1988
PublisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/1430
Citation
International Journal for Numerical Methods in Engineering, 1988, v. 26 n. 7, p. 1485-1506 How to Cite?
AbstractAn algorithm is presented for removing hidden lines for isometric and perspective projections of three-dimensional objects. An object can be regarded as being made up of a number of planes, and the whole picture can therefore be visualized as only a collection of planes. Considering planes as the basic element of a picture, non-convex polyhedra can be displayed directly without prior subdivisions into convex ones. Lines connecting nodal points are first retrieved from the model to be plotted by a simple but efficient technique. On the picture planes, each unique line is examined in turn to see if it is totally or partially hidden. The intersections between a unique line and a projected plane (with or without openings) are determined by a new method which, even in the presence of numerical errors, will always give correct intersection information. Unlike many classical algorithms, intersections are determined by a single formula without tedious case subdivisions. With little additional calculations, object penetrations can also be tackled.
Persistent Identifierhttp://hdl.handle.net/10722/144825
ISSN
2015 Impact Factor: 2.1
2015 SCImago Journal Rankings: 2.007
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLo, SH-
dc.date.accessioned2012-02-06T04:57:44Z-
dc.date.available2012-02-06T04:57:44Z-
dc.date.issued1988-
dc.identifier.citationInternational Journal for Numerical Methods in Engineering, 1988, v. 26 n. 7, p. 1485-1506-
dc.identifier.issn0029-5981-
dc.identifier.urihttp://hdl.handle.net/10722/144825-
dc.description.abstractAn algorithm is presented for removing hidden lines for isometric and perspective projections of three-dimensional objects. An object can be regarded as being made up of a number of planes, and the whole picture can therefore be visualized as only a collection of planes. Considering planes as the basic element of a picture, non-convex polyhedra can be displayed directly without prior subdivisions into convex ones. Lines connecting nodal points are first retrieved from the model to be plotted by a simple but efficient technique. On the picture planes, each unique line is examined in turn to see if it is totally or partially hidden. The intersections between a unique line and a projected plane (with or without openings) are determined by a new method which, even in the presence of numerical errors, will always give correct intersection information. Unlike many classical algorithms, intersections are determined by a single formula without tedious case subdivisions. With little additional calculations, object penetrations can also be tackled.-
dc.languageeng-
dc.publisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/1430-
dc.relation.ispartofInternational Journal for Numerical Methods in Engineering-
dc.rightsInternational Journal for Numerical Methods in Engineering. Copyright © John Wiley & Sons Ltd.-
dc.titlePerspective projection of non-convex polyhedraen_US
dc.typeArticleen_US
dc.identifier.emailLo, SH: hreclsh@hkucc.hku.hk-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1002/nme.1620260703-
dc.identifier.scopuseid_2-s2.0-0024053279-
dc.identifier.volume26-
dc.identifier.issue7-
dc.identifier.spage1485-
dc.identifier.epage1506-
dc.identifier.isiWOS:A1988P199500002-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats