• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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

Avoiding cracks between terrain segments in a visual terrain database

Holst, Hanna January 2004 (has links)
<p>To be able to run a flight simulator a large area of terrain needs to be visualized. The simulator must update the screen in real-time to make the simulation work well. One way of managing large terrains is to tile the area into quadratic tiles to be able to work with different detailed representations of the terrain at different distances from the user. The tiles need to match with the adjacent tiles in the edge points to avoid cracks. When every tile can have a number of different levels of detail this means that the different levels of detail need to match too. This was previously done by having the same edge points in all levels of detail, giving an unnicessarily large polygon count in the less detailed levels. the method developed in this report uses different versions of borders with their own level of detail, adapting to different detail levels at the adjacent tile, reducing hte number of polygons.</p>
2

Avoiding cracks between terrain segments in a visual terrain database

Holst, Hanna January 2004 (has links)
To be able to run a flight simulator a large area of terrain needs to be visualized. The simulator must update the screen in real-time to make the simulation work well. One way of managing large terrains is to tile the area into quadratic tiles to be able to work with different detailed representations of the terrain at different distances from the user. The tiles need to match with the adjacent tiles in the edge points to avoid cracks. When every tile can have a number of different levels of detail this means that the different levels of detail need to match too. This was previously done by having the same edge points in all levels of detail, giving an unnicessarily large polygon count in the less detailed levels. the method developed in this report uses different versions of borders with their own level of detail, adapting to different detail levels at the adjacent tile, reducing hte number of polygons.

Page generated in 0.5015 seconds