Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Tokuta, Alade | |
| dc.contributor.author | Hua, Shuwei | |
| dc.contributor.editor | Skala, Václav | |
| dc.date.accessioned | 2015-09-25T12:26:57Z | |
| dc.date.available | 2015-09-25T12:26:57Z | |
| dc.date.issued | 1996 | |
| dc.identifier.citation | Journal of WSCG. 1996, vol. 4, no. 1-2, p. 257-266. | en |
| dc.identifier.issn | 1213-6972 (print) | |
| dc.identifier.issn | 1213-6980 (CD-ROM) | |
| dc.identifier.issn | 1213-6964 (online) | |
| dc.identifier.uri | http://wscg.zcu.cz/wscg1996/wscg96.htm#abs | |
| dc.identifier.uri | http://hdl.handle.net/11025/15986 | |
| dc.format | 10 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | Václav Skala - UNION Agency | cs |
| dc.relation.ispartofseries | Journal of WSCG | en |
| dc.rights | © Václav Skala - UNION Agency | cs |
| dc.subject | parametrická reprezentace | cs |
| dc.subject | jednoduchý mnohoúhelník | cs |
| dc.subject | nekonvexní objem | cs |
| dc.title | Generalized clipping of a polygon against a 2D arbitrary window and a 3D non-convex volume | en |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.rights.access | openAccess | en |
| dc.type.version | publishedVersion | en |
| dc.description.abstract-translated | Several clipping algorithms are in wide use. These are separated into broad classes. They include subdivision algorithms of which the best known is the midpoint subdivision algorithm; the Cohen-Sutherland algorithm which uses outcodes generators and line window intersection calculations to determine what portion(s) of line segments may be contained in the window. Outcode determination/redetermination for the stages of the algorithm can dominate the clipping process. There are algorithms that are based on parametric expressions for lines, and which are comparatively more efficient than the simple Cohen-Sutherland algorithm. The Skala 2D line clipping algorithms use a parameter value to determine the intersection of a line segment with a convex or non-convex polygon window. The Rappoport algorithm clips any subject polygon against a convex polygonal window. The work of Weiler and Atherton algorithm allows the clipping of any subject polygon against any clip polygon. However, it is base on some assuptions. This work presents an efficient method for clipping a polygon against an arbitrary two-dimensional polygonal windows and a modification of the algorithm can also be applied to clip a polygon against a non-convex volume on 3D. The basic idea based on geometry and parametric representation of the lines, determines if an edge of a subject polygon should be totally rejected, or is totally visible. On the other hand, if an edge of a polygon has intersections with the boundary of a simple polygon window, it is easy to decide which parts of the edge are visible after sorting these intersections. | en |
| dc.subject.translated | parametric representation | en |
| dc.subject.translated | simple polygon | en |
| dc.subject.translated | non-convex volume | en |
| dc.type.status | Peer-reviewed | en |
| Appears in Collections: | Volume 4, number 1-2 (1996) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Hua_96.pdf | Plný text | 1,26 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/15986Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.