Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Analysis of Two Common Hidden Surface Removal Algorithms, Painter's Algorithm & Z-Buffering.
KTH, School of Computer Science and Communication (CSC).
2011 (English)Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This report addresses two algorithms within the eld of hidden surface removal; Painter's algorithm and Z-buffering. An introduction is rst made into the domain of computer generated graphics and more specically hidden surface removal within that area, discussing methods of culling and denitions within hidden surface removal. The following sections documents the implementation, strengths, and weaknesses of the two algorithms as well as shortly discussing the data structure known as Binary Space Partitioning. An analysis is then given, comparing the algorithms with the help of specic scenarios. Finally, a discussion of combining the algorithms together with Binary Space Partitioning is given, labeling the strengths and weaknesses of this particular combination.

Abstract [sv]

Denna rapport behandlar två algoritmer inom området borttagning av skymda ytor, Painter's algoritm och Z-buffering. En introduktion görs först om datorgenererade bilder i sin helhet, och sedan mer specikt borttagning av skymda ytor, som diskuterer metoder för culling och denitioner inom borttagning av skymda ytor. I följande avsnitt dokumenteras implementationen, styrkorna och svagheterna av de två algoritmer samt en kort diskussion av datastrukturen Binary Space Partitioning. En analys ges därefter, där algoritmerna jämförs med hjälp av specika scenarion. Slutligen nns en diskussion om att kombinera algoritmerna tillsammans med Binary Space Partitioning ges, med kombinationens styrkor och svagheter.

Place, publisher, year, edition, pages
2011.
Series
Kandidatexjobb CSC, K11061
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-130849OAI: oai:DiVA.org:kth-130849DiVA: diva2:654296
Educational program
Master of Science in Engineering - Computer Science and Technology
Uppsok
Technology
Supervisors
Examiners
Available from: 2013-10-07 Created: 2013-10-07

Open Access in DiVA

No full text

Other links

http://www.csc.kth.se/utbildning/kandidatexjobb/datateknik/2011/rapport/nyberg_daniel_K11061.pdf
By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 18 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf