Context. Triangulated irregular network (TIN) can produce terrain meshes with a reduced triangle count compared to a regular grid. At the same time, TIN meshes are more challenging to optimize in real-time in comparison to other approaches. Objectives. This thesis explores efficient generation of view-dependent, adaptive TIN meshes for terrain during runtime with no or minimal preprocessing. Methods. Since the workings of the proposed technique is a novel approach, an empirical strategy was employed to present the findings instead of partial comparisons to related techniques. Results. To determine the result of the technique, run-time performance is measured and presented to provide incentives for implementation and improvements on the proposed algorithm. Several problem sizes are tested with varying terrain features to determine the effectiveness as a result of the features in the mesh. Conclusions. We conclude that reducing the problem of mesh simplification to that of 2D Delaunay triangulation on sampled points spanning terrains is valid approach for triangulating on-the-fly. Moreover, this approach opens up for further improvements which may soon allow real-time triangulation of TINs.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:bth-10937 |
| Date | January 2015 |
| Creators | Bertilsson, Emil |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.002 seconds