Institutional Repository

Frame clipping of polygons

Show simple item record

dc.contributor.author Anderssen, E.C.
dc.contributor.author Von Solms, S.H.
dc.date.accessioned 2018-06-06T14:49:34Z
dc.date.available 2018-06-06T14:49:34Z
dc.date.issued 1988
dc.identifier.citation E C Anderssen and S H von Solms (1988) Frame clipping of polygons. Quaestiones Informaticae Vol 6 No 3 1988 en
dc.identifier.issn 0254-2757
dc.identifier.uri http://hdl.handle.net/10500/24299
dc.description.abstract A polygon clipping algorithm is presented for the clipping of closed geographical areas such as dams or forests, against a surrounding rectangular windowframe. The algorithm employs a line clipping procedure which divides the vertices of the clipped polygon into three groups: interior vertices, border vertices and exterior vertices. The vertices on the borders of the windowframe are sorted and stored in a control vector. The control vector determines the sequence in which the clipped vertices are loaded/or plotting purposes. en
dc.language.iso en en
dc.publisher Computer Society of South Africa (on behalf of SAICSIT) en
dc.subject Computer graphics en
dc.subject Line clipping en
dc.subject Polygon clipping en
dc.title Frame clipping of polygons en
dc.type Article en
dc.description.department School of Computing en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


Browse

My Account

Statistics