Iterative stripification of a triangle mesh: focus on data structures

In this paper we describe the data structure and some implementation details of the tunneling algorithm for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological operation on the dual graph of the mesh, to generate an initial stripification and iteratively rearrange and decrease the number of strips. Our method is a major improvement of a proposed one originally devised for both static and continuous level-of-detail (CLOD) meshes and retains this feature. The usage of a dynamical identification strategy for the strips allows us to drastically reduce the length of the searching paths in the graph needed for the rearrangement and produce loop-free triangle strips without any further controls and post-processing, while requiring a more sophisticated implementation to manage the search and undo operations

The development of problem solving environments for computational engineering.

This thesis presents two Problem Solving Environments that enable engineers in industry to utilise complex computational simulation algorithms during their design processes. The work addresses the issues of allowing the end user to interact with the algorithms in a user-friendly manner through the use of graphical user interface design and advanced computer graphics. Throughout this thesis major emphasis is placed on being able to tackle a wide range of problem sizes from routine to grand challenge simulations through the use of parallel computing hardware. The effectiveness of both the environments in their domain is demonstrated using a series of examples