Hidden line problem formulated as a set union problem
| dc.contributor.author | Hrúz, T. | |
| dc.contributor.author | Považan, I. | |
| dc.contributor.author | Gosiorovský, R. | |
| dc.contributor.editor | Skala, Václav | |
| dc.date.accessioned | 2015-09-25T12:13:14Z | |
| dc.date.available | 2015-09-25T12:13:14Z | |
| dc.date.issued | 1996 | |
| dc.description.abstract-translated | This paper describes an alternative approach to the hidden line problem in computer graphics. It is assumed that a 3D visible scene consisting of conver planar polygons with known visibility order is given. An abstract data structure together with a set of operation UNION is then implemented on the segment tree data structure. The solution of the visibility problem relies mainly on a two-way scan conversion process and the hidden line problem is formulated as a set union problem. The worst case complexity of the presented algorithm is O(sn log s) where n is the number of polygons and s is a resolution. The algorithm is output sensitive in the image space sense. In certain situations priority order is given or easily computable and resolution of raster space is very high. In these situastions the algorithm presented can be faster than Z-buffer. | en |
| dc.format | 11 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Journal of WSCG. 1996, vol. 4, no. 1-2, p. 246-256. | 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/15985 | |
| 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.rights.access | openAccess | en |
| dc.subject | počítačová grafika | cs |
| dc.subject | datová struktura | cs |
| dc.subject | skryté čáry | cs |
| dc.subject.translated | computer graphics | en |
| dc.subject.translated | data structure | en |
| dc.subject.translated | hidden lines | en |
| dc.title | Hidden line problem formulated as a set union problem | en |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.type.status | Peer-reviewed | en |
| dc.type.version | publishedVersion | en |
Files
Original bundle
1 - 1 out of 1 results
No Thumbnail Available
- Name:
- Hruz_96.pdf
- Size:
- 1.93 MB
- Format:
- Adobe Portable Document Format
- Description:
- Plný text
License bundle
1 - 1 out of 1 results
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: