Towards a High Quality Real-Time Graphics Pipeline

Modern graphics hardware pipelines create photorealistic images with high geometric complexity in real time. The quality is constantly improving and advanced techniques from feature film visual effects, such as high dynamic range images and support for higher-order surface primitives, have recently been adopted. Visual effect techniques have large computational costs and significant memory bandwidth usage. In this thesis, we identify three problem areas and propose new algorithms that increase the performance of a set of computer graphics techniques. Our main focus is on efficient algorithms for the real-time graphics pipeline, but parts of our research are equally applicable to offline rendering. Our first focus is texture compression, which is a technique to reduce the memory bandwidth usage. The core idea is to store images in small compressed blocks which are sent over the memory bus and are decompressed on-the-fly when accessed. We present compression algorithms for two types of texture formats. High dynamic range images capture environment lighting with luminance differences over a wide intensity range. Normal maps store perturbation vectors for local surface normals, and give the illusion of high geometric surface detail. Our compression formats are tailored to these texture types and have compression ratios of 6:1, high visual fidelity, and low-cost decompression logic. Our second focus is tessellation culling. Culling is a commonly used technique in computer graphics for removing work that does not contribute to the final image, such as completely hidden geometry. By discarding rendering primitives from further processing, substantial arithmetic computations and memory bandwidth can be saved. Modern graphics processing units include flexible tessellation stages, where rendering primitives are subdivided for increased geometric detail. Images with highly detailed models can be synthesized, but the incurred cost is significant. We have devised a simple remapping technique that allowsfor better tessellation distribution in screen space. Furthermore, we present programmable tessellation culling, where bounding volumes for displaced geometry are computed and used to conservatively test if a primitive can be discarded before tessellation. We introduce a general tessellation culling framework, and an optimized algorithm for rendering of displaced Bézier patches, which is expected to be a common use case for graphics hardware tessellation. Our third and final focus is forward-looking, and relates to efficient algorithms for stochastic rasterization, a rendering technique where camera effects such as depth of field and motion blur can be faithfully simulated. We extend a graphics pipeline with stochastic rasterization in spatio-temporal space and show that stochastic motion blur can be rendered with rather modest pipeline modifications. Furthermore, backface culling algorithms for motion blur and depth of field rendering are presented, which are directly applicable to stochastic rasterization. Hopefully, our work in this field brings us closer to high quality real-time stochastic rendering

A hybrid representation for modeling, interactive editing, and real-time visualization of terrains with volumetric features

Cataloged from PDF version of article.Terrain rendering is a crucial part of many real-time applications. The easiest way to process and visualize terrain data in real time is to constrain the terrain model in several ways. This decreases the amount of data to be processed and the amount of processing power needed, but at the cost of expressivity and the ability to create complex terrains. The most popular terrain representation is a regular 2D grid, where the vertices are displaced in a third dimension by a displacement map, called a heightmap. This is the simplest way to represent terrain, and although it allows fast processing, it cannot model terrains with volumetric features. Volumetric approaches sample the 3D space by subdividing it into a 3D grid and represent the terrain as occupied voxels. They can represent volumetric features but they require computationally intensive algorithms for rendering, and their memory requirements are high. We propose a novel representation that combines the voxel and heightmap approaches, and is expressive enough to allow creating terrains with caves, overhangs, cliffs, and arches, and efficient enough to allow terrain editing, deformations, and rendering in real time

2D and 3D surface image processing algorithms and their applications

This doctoral dissertation work aims to develop algorithms for 2D image segmentation application of solar filament disappearance detection, 3D mesh simplification, and 3D image warping in pre-surgery simulation. Filament area detection in solar images is an image segmentation problem. A thresholding and region growing combined method is proposed and applied in this application. Based on the filament area detection results, filament disappearances are reported in real time. The solar images in 1999 are processed with this proposed system and three statistical results of filaments are presented. 3D images can be obtained by passive and active range sensing. An image registration process finds the transformation between each pair of range views. To model an object, a common reference frame in which all views can be transformed must be defined. After the registration, the range views should be integrated into a non-redundant model. Optimization is necessary to obtain a complete 3D model. One single surface representation can better fit to the data. It may be further simplified for rendering, storing and transmitting efficiently, or the representation can be converted to some other formats. This work proposes an efficient algorithm for solving the mesh simplification problem, approximating an arbitrary mesh by a simplified mesh. The algorithm uses Root Mean Square distance error metric to decide the facet curvature. Two vertices of one edge and the surrounding vertices decide the average plane. The simplification results are excellent and the computation speed is fast. The algorithm is compared with six other major simplification algorithms. Image morphing is used for all methods that gradually and continuously deform a source image into a target image, while producing the in-between models. Image warping is a continuous deformation of a: graphical object. A morphing process is usually composed of warping and interpolation. This work develops a direct-manipulation-of-free-form-deformation-based method and application for pre-surgical planning. The developed user interface provides a friendly interactive tool in the plastic surgery. Nose augmentation surgery is presented as an example. Displacement vector and lattices resulting in different resolution are used to obtain various deformation results. During the deformation, the volume change of the model is also considered based on a simplified skin-muscle model

Feature-based Product Modelling in a Collaborative Environment

Ph.DDOCTOR OF PHILOSOPH

Non-Uniform Rational B-Splines and Rational Bezier Triangles for Isogeometric Analysis of Structural Applications

Isogeometric Analysis (IGA) is a major advancement in computational analysis that bridges the gap between a computer-aided design (CAD) model, which is typically constructed using Non-Uniform Rational B-splines (NURBS), and a computational model that traditionally uses Lagrange polynomials to represent the geometry and solution variables. In IGA, the same shape functions that are used in CAD are employed for analysis. The direct manipulation of CAD data eliminates approximation errors that emanate from the process of converting the geometry from CAD to Finite Element Analysis (FEA). As a result, IGA allows the exact geometry to be represented at the coarsest level and maintained throughout the analysis process. While IGA was initially introduced to streamline the design and analysis process, this dissertation shows that IGA can also provide improved computational results for complex and highly nonlinear problems in structural mechanics. This dissertation addresses various problems in structural mechanics in the context of IGA, with the use of NURBS and rational Bézier triangles for the description of the parametric and physical spaces. The approaches considered here show that a number of important properties (e.g., high-order smoothness, geometric exactness, reduced number of degrees of freedom, and increased flexibility in discretization) can be achieved, leading to improved numerical solutions. Specifically, using B-splines and a layer-based discretization, a distributed plasticity isogeometric frame model is formulated to capture the spread of plasticity in large-deformation frames. The modeling approach includes an adaptive analysis where the structure of interest is initially modeled with coarse mesh and knots are inserted based on the yielding information at the quadrature points. It is demonstrated that improvement on efficiency and convergence rates is attained. With NURBS, an isogeometric rotation-free multi-layered plate formulation is developed based on a layerwise deformation theory. The derivation assumes a separate displacement field expansion within each layer, and considers transverse displacement component as C0-continuous at dissimilar material interfaces, which is enforced via knot repetition. The separate integration of the in-plane and through-thickness directions allows to capture the complete 3D stresses in a 2D setting. The proposed method is used to predict the behavior of advanced materials such as laminated composites, and the results show advantages in efficiency and accuracy. To increase the flexibility in discretizing complex geometries, rational Bézier triangles for domain triangulation is studied. They are further coupled with a Delaunay-based feature-preserving discretization algorithm for static bending and free vibration analysis of Kirchhoff plates. Lagrange multipliers are employed to explicitly impose high-order continuity constraints and the augmented system is solved iteratively without increasing the matrix size. The resulting discretization is geometrically exact, admits small geometric features, and constitutes C1-continuity. The feature-preserving rational Bézier triangles are further applied to smeared damage modeling of quasi-brittle materials. Due to the ability of Lagrange multipliers to raise global continuity to any desired order, the implicit fourth- and sixth-order gradient damage models are analyzed. The inclusion of higher-order terms in the nonlocal Taylor expansion improves solution accuracy. A local refinement algorithm that resolves marked regions with high resolution while keeping the resulting mesh conforming and well-conditioned is also utilized to improve efficiency. The outcome is a unified modeling framework where the feature-preserving discretization is able to capture the damage initiation and early-stage propagation, and the local refinement technique can then be applied to adaptively refine the mesh in the direction of damage propagation.PHDCivil EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/147668/1/ningliu_1.pd

Shape Reconstruction from Point Clouds Using Closed Form Solution of a Fourth-Order Partial Differential Equation

Partial differential equation (PDE) based geometric modelling has a number of advantages such as fewer design variables, avoidance of stitching adjacent patches together to achieve required continuities, and physics-based nature. Although a lot of papers have investigated PDE-based shape creation, shape manipulation, surface blending and volume blending as well as surface reconstruction using implicit PDE surfaces, there is little work of investigating PDE-based shape reconstruction using explicit PDE surfaces, specially satisfying the constraints on four boundaries of a PDE surface patch. In this paper, we propose a new method of using an accurate closed form solution to a fourth-order partial differential equation to reconstruct 3D surfaces from point clouds. It includes selecting a fourth-order partial differential equation, obtaining the closed form solutions of the equation, investigating the errors of using one of the obtained closed form solutions to reconstruct PDE surfaces from differential number of 3D points

Modelado jerárquico de objetos 3D con superficies de subdivisión

Las SSs (Superficies de Subdivisión) son un potente paradigma de modelado de objetos 3D (tridimensionales) que establece un puente entre los dos enfoques tradicionales a la aproximación de superficies, basados en mallas poligonales y de parches alabeados, que conllevan problemas uno y otro. Los esquemas de subdivisión permiten definir una superficie suave (a tramos), como las más frecuentes en la práctica, como el límite de un proceso recursivo de refinamiento de una malla de control burda, que puede ser descrita muy compactamente. Además, la recursividad inherente a las SSs establece naturalmente una relación de anidamiento piramidal entre las mallas / NDs (Niveles de Detalle) generadas/os sucesivamente, por lo que las SSs se prestan extraordinariamente al AMRO (Análisis Multiresolución mediante Ondículas) de superficies, que tiene aplicaciones prácticas inmediatas e interesantísimas, como la codificación y la edición jerárquicas de modelos 3D. Empezamos describiendo los vínculos entre las tres áreas que han servido de base a nuestro trabajo (SSs, extracción automática de NDs y AMRO) para explicar como encajan estas tres piezas del puzzle del modelado jerárquico de objetos de 3D con SSs. El AMRO consiste en descomponer una función en una versión burda suya y un conjunto de refinamientos aditivos anidados jerárquicamente llamados "coeficientes ondiculares". La teoría clásica de ondículas estudia las señales clásicas nD: las definidas sobre dominios paramétricos homeomorfos a R" o (0,1)n como el audio (n=1), las imágenes (n=2) o el vídeo (n=3). En topologías menos triviales, como las variedades 2D) (superficies en el espacio 3D), el AMRO no es tan obvio, pero sigue siendo posible si se enfoca desde la perspectiva de las SSs. Basta con partir de una malla burda que aproxime a un bajo ND la superficie considerada, subdividirla recursivamente y, al hacerlo, ir añadiendo los coeficientes ondiculares, que son los detalles 3D necesarios para obtener aproximaciones más y más finas a la superficie original. Pasamos después a las aplicaciones prácticas que constituyen nuestros principal desarrollo original y, en particular, presentamos una técnica de codificación jerárquica de modelos 3D basada en SSs, que actúa sobre los detalles 3D mencionados: los expresa en un referencial normal loscal; los organiza según una estructura jerárquica basada en facetas; los cuantifica dedicando menos bits a sus componentes tangenciales, menos energéticas, y los "escalariza"; y los codifica dinalmente gracias a una técnica similar al SPIHT (Set Partitioning In Hierarchical Tress) de Said y Pearlman. El resultado es un código completamente embebido y al menos dos veces más compacto, para superficies mayormente suaves, que los obtenidos con técnicas de codificación progresiva de mallas 3D publicadas previamente, en las que además los NDs no están anidados piramidalmente. Finalmente, describimos varios métodos auxiliares que hemos desarrollado, mejorando técnicas previas y creando otras propias, ya que una solución completa al modelado de objetos 3D con SSs requiere resolver otros dos problemas. El primero es la extracción de una malla base (triangular, en nuestro caso) de la superficie original, habitualmente dada por una malla triangular fina con conectividad arbitraria. El segundo es la generación de un remallado recursivo con conectividad de subdivisión de la malla original/objetivo mediante un refinamiento recursivo de la malla base, calculando así los detalles 3D necesarios para corregir las posiciones predichas por la subdivisión para nuevos vértices

Contact non-localisé entre poutres avec des sections droites circulaires et elliptiques

Numerous materials and structures are aggregates of slender bodies. We can, for example, refer to struts in metal foams, yarns in textiles, fibers in muscles or steel wires in wire ropes. To predict the mechanical performance of these materials and structures, it is important to understand how the mechanical load is distributed between the different bodies. If one can predict which slender body is the most likely to fail, changes in the design could be made to enhance its performance. As the aggregates of slender bodies are highly complex, simulations are required to numerically compute their mechanical behaviour. The most widely employed computational framework is the Finite Element Method in which each slender body is modeled as a series of beam elements. On top of an accurate mechanical representation of the individual slender bodies, the contact between the slender bodies must often be accurately modeled. In the past couple of decades, contact between beam elements has received wide-spread attention. However, the focus was mainly directed towards beams with circular cross-sections, whereas elliptical cross-sections are also relevant for numerous applications. Only two works have considered contact between beams with elliptical cross-sections, but they are limited to point-wise contact, which restricts their applicability. In this Ph.D. thesis, different frameworks for beams with elliptical cross-sections are proposed in case a point-wise contact treatment is insufficient. The thesis also reports a framework for contact scenarios where a beam is embedded inside another beam, which is in contrast to conventional contact frameworks for beams in which penetrating beams are actively repelled from each other. Finally, two of the three contact frameworks are enhanced with frictional sliding, where friction not only occurs due to sliding in the beams’ longitudinal directions but also in the transversal directions