• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • Tagged with
  • 4
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

The visualisation and rendering of digital elevation data

Hobbs, Kenneth Frank January 2000 (has links)
The thesis addresses a longstanding cartographic problem, of how to visualise the Earth's surface relief in an effective and meaningful way. The problem is narrowed to relief defined by digital elevation data and visualised as a static, orthographic representation. It is approached in three steps: firstly research focuses on determining the most useful form of graphical representation to be pursued; secondly the theoretical basis of computer visualisation is investigated through a three-model framework, prompting a number of directions where solutions might be developed; and thirdly the development and engineering of a system is reported which models and renders widely available elevation data, and which provides flexibility in its input variables. The developed system is then applied to specific cases of relief visualisation, and new graphical forms are developed. The investigation of past and current approaches to relief representation, and a review of computer-graphic rendering of simpler geometrically defined objects, have revealed some limitations in commonly used relief visualisation systems, but have established the simulation of light and shade as still the most promising line of development. Analysis of the component variables of surface visualisation and rendering has led to the visualisation paradigm of three parametric models - of elevation, illumination and reflectance. Some attractive qualities, including widespread availability, of the contour elevation model have been identified, and a system has been developed which reconstructs surfaces from this data structure in a more effective way than typical current approaches. The system is also designed to support more complex illumination and surface reflectance models than the somewhat simplistic scenarios commonly available. The thesis reports the application of the system to generate surfaces from contour data, and experimentation with multiple coloured light sources and varying degrees of surface specularity. Evaluation of system implementation, and of the qualities of a representative set of graphical products, is addressed through six design criteria within a context defined by a typical mapping application. This has led to conclusions that the system and the new graphical forms have a number of virtues, including close fidelity with the source data, and significant improvements in visualisation.
2

Texturmappningsalgoritmer : Jämförelse mellan Normal-mapping, Parallax-mapping och Relief-mapping

Klahr, Joakim January 2006 (has links)
<p>Denna rapport jämför tre stycken texturmappningsalgoritmer vars uppgift är att öka detaljrikedomen på ytor utan att tillföra några extra polygoner. Algoritmerna är tre stycken pixel-shaders vars uppgift är att skapa illusionen av tre dimensioner istället för två på de ytor algoritmerna är applicerad på. Ytor med få polygoner ska se ut att bestå utav många fler.</p><p>Fyra expriment har utförts på tre, till formen mycket olika, 3D-modeller tillsammans med tre olika texturuppsättningar berstående utav färg-, normal- och höjdtextur.</p><p>Resultatet visar att alla tre tekniker har olika starka och svaga sidor och på så vis sina optimala användningsområden.</p>
3

Texturmappningsalgoritmer : Jämförelse mellan Normal-mapping, Parallax-mapping och Relief-mapping

Klahr, Joakim January 2006 (has links)
Denna rapport jämför tre stycken texturmappningsalgoritmer vars uppgift är att öka detaljrikedomen på ytor utan att tillföra några extra polygoner. Algoritmerna är tre stycken pixel-shaders vars uppgift är att skapa illusionen av tre dimensioner istället för två på de ytor algoritmerna är applicerad på. Ytor med få polygoner ska se ut att bestå utav många fler. Fyra expriment har utförts på tre, till formen mycket olika, 3D-modeller tillsammans med tre olika texturuppsättningar berstående utav färg-, normal- och höjdtextur. Resultatet visar att alla tre tekniker har olika starka och svaga sidor och på så vis sina optimala användningsområden.
4

Review of Displacement Mapping Techniques and Optimization / Granskning av Displacement Mapping Tekniker och Optimering

Lundgren, Mikael, Hrkalovic, Ermin January 2012 (has links)
This paper explores different bump mapping techniques and their implementation. Bump mapping is a technique that is used in computer games to make simple 3D objects look more detailed than what they really are. The technique involves using a texture to change the objects normals to simulate bumps and is used to avoid rendering high polygonal objects. Over the years some different techniques have been developed based on bump mapping, these are normal mapping, relief mapping, parallax occlusion mapping, quadtree displacement mapping and so on. The first part of this paper we go through our goals and our research methodology. We then write about four different techniques and describe how they work. We also go through how they are implemented. After that we start our experiments and measure the different techniques against each other. When the first testing has been done, we start to optimize the techniques and run a second test to see how much faster, if it is faster, the optimization is compared to the previous tests. When the tests are done, we present our test data and analyse them. Finally we discuss the techniques and the testing. Then we finish up with a conclusion. / Mikaels telefon: 072-181 77 29 Ermins telefon: 076-178 97 59

Page generated in 0.0689 seconds