3D laser scanners become more and more popular especially for measuring construction sites, in the field of architecture and for preservation of monuments. As these scanners can only record discrete data sets (point clouds), it is necessary to mesh these sets for getting closed 3D models and take advantage of 3D graphics acceleration of modern graphics hardware. The meshing process is a complex...

--Current research on radiosity has concentrated on increasing the accuracy and the speed of the solution. Although algorithmic and meshing techniques decrea,se the execution time, still excessive computational power is required for complex scenes. Hence, parallelism can be exploited for speeding up the method further. This paper aims at providing a thorough examination of parallelism in the ba...

The proposed research for the Computational Engineering and Sciences (CES) option of the Computational and Applied Mathematics (CAM) Ph.D. program is in the area of tetrahedral/hexahedral finite element meshing from volumetric imaging data with defined boundaries. The proposed research work is to extract adaptive tetrahedral and hexahedral finite element meshes with guaranteed quality directly ...

A very wide range of finite element analyses required to design carbodies calls for quadrilateral meshes with austere quality needs. Quadrilaterals being varying strain and non-planar, element quality, in body-in-white analyses, is virtually impossible to measure with a single parameter. Auto-designers mostly prefer heuristic element quality metrices that catapult the need for predominantly ort...

In this paper a systematic approach of repairing polygonal meshes is developed for volume meshing, which can then be used in finite element analyses. All poor-quality elements are classified into three general categories: point element, line element, and overlapped element. A robust iterative scheme is proposed to remove all poor-quality elements progressively, leading to a successful volume me...

Consider an algorithm for generating a triangle mesh interpolating a fixed set of 3D point samples, where the generated triangle set varies depending on some underlying parameters. In this paper we treat such an algorithm as a means of sampling the space of possible interpolant meshes, and then define a more robust algorithm based on drawing multiple such samples from this process and averaging...