An exploratory research project was conducted through a company focusing on CAD and their own developed real-time 3D model viewer. The company needed to be able to convert CAD models to use in Unreal Engine with great visual quality. Before this project, another was conducted to perform the simple conversion of CAD models to the FBX file format, which Unreal uses. In extension to the previous project, one needed to add functionalities to manipulate the models for better quality and performance. The tasks were carried out and performed with good results.

The workflow of different game modelling artists is explored, with the goal of creating a melee weapon designed for games. A low polygon weapon was created using the research into the most common components from professional workflows of creating game models. One of the goals for the paper was to obtain a greater understanding of professional workflows when creating models for games. Other goals were to utilize the research and design a finished game model from concept to end product.

L’objet de cette thèse est l’étude du problème Δ 2uω = fω avec les conditions aux limites Uω = Δ uω = 0, le second membre étant supposé dépendre continûment de ω dans L2(ω), où ω = {(r, θ); 0 < r < 1, 0 < θ < ω} , 0 < ω ≤ π, est une famille de secteurs tronqués du plan. Si ω < π on sait d’après Blum et Rannacher (1980) que la solution de ce problème uω se décompose au voisinage de l’origine en uω = u1,ω + u2,ω + u3,ω, (1) où u1,ω, u2,ω sont les parties singulières de uω et u3,ω la partie régulière. En effet, au voisinage de l’origine u1,ω (resp. u2,ω, u3,ω) est de régularité H1+πω−ǫ (resp. H2+πω−ǫ, H4) pour tout Q > 0, tandis que la solution uπ appartient, au moins au voisinage de l’origine, à l’espace H4(π), où π est le demi-disque supérieur de centre 0 et de rayon r = 1. On voit clairement une résolution de la singularité près de l’angle π dont la description est l’objectif principal de ce travail. Le résultat obtenu est que la décomposition (1) de uω est uniforme par rapport à ω, lorsque ω → π, pour les meilleures topologies possibles pour chacun des termes, et converge terme à terme vers le développement limité de uπ au voisinage de 0. / In this work, we study the family of problems Δ 2uω = fω with boundary conditionuω = Δ uω = 0. There, the second member is assumed to depend smoothly on ω in L2(ω), where ω = {(r, θ); 0 < r < 1, 0 < θ < ω} , 0 < ω ≤ π, is a family of truncated sectors of the plane. If ω < π it is known from Blum et Rannacher (1980) that the solution uω decomposes as uω = u1,ω + u2,ω + u3,ω, (1) where u1,ω, u2,ω are singular and u3,ω is regular. Indeed, near the origin, u1,ω(resp. u2,ω, u3,ω) is of regularity H1+πω−ǫ (resp. H2+πω−ǫ, H4) for every Q > 0, while the solution uπ is, in the neighborhood of the origin again, of regularity H4. One clearly sees a resolution of the singularity near the angle π whose descriptionis the main objective of this work. The obtained result is that there exists a decomposition (1) of uω which is uniform with respect to ω, when ω → π, with the best possible topologies for each term, and which term by term convergestowards the Taylor expansion of uπ near 0.

This thesis work focuses on how to create realistic looking hair using only the vanilla version of Autodesk Maya. It describes two approaches, the widely used polygon-stripe based technique and the Maya built-in nHair. It also evaluates these two approaches in terms of ease of implementation, production speed and quality of final results. The conclusion is that nHair has the potential to produce realistic looking hair but contains various bugs and is not optimized at the current stage, while the polygon-stripe based approach is robust and flexible but the realism of rendering results is heavily dependent upon the skill level of artists.

This study aims to quantify ground ice content and describe the cryostructures and sediment in 15 ice-bearing permafrost cores collected from nine sand-wedge polygons in University Valley. The objectives were reached through laboratory measurements and computed tomodensitometric (CT) scanned image analysis of the permafrost cores. The soils in the valley were predominantly medium-sand. Four types of cryostructures were present in the cores: structureless, suspended, crustal and porphyritic. Excess ice content ranged from 0 to 93%, gravimetric water content ranged from 13 to 1881% and volumetric ice content varied from 28 to 93%. Median excess ice, volumetric ice and gravimetric water contents significantly increased in the top 20 cm of the cores taken from the polygon shoulders with increasing distance from University Glacier. Ground ice was preferentially stored in the centre of the investigated polygons where the ground surface remains cryotic throughout the year. Conversely, higher ground ice contents were measured in the shoulders of the investigated polygon where the ground surface is seasonally non-cryotic. CT-scanned images were shown to reasonably assess the distribution and presence of excess ice in permafrost cores taken from a cold and hyper-arid environment. The results of this thesis provide the first cryostratigraphic study in the McMurdo Dry Valleys of Antarctica.

The home range encompasses an animal’s movements as it goes about its normal activity, and several home range estimators have been developed. I evaluated the performance of the Minimum Convex Polygon, Bivariate Normal, and several kernel home range estimators in a geographical information system environment using simulations and a large database of O. pumilio mark-recapture locations. A fixed 90% kernel estimator using Least-Square Cross-Validation (to select the bandwidth) outperformed other methods of estimating home range size and was effective with relatively few capture points. Home range size, core area size, intrasexual overlap, and movement rates among coordinates were higher in female frogs than in male frogs. These measures likely reflect behavioral differences related to territoriality (males only) and parental care (both sexes). The simple Biological Index of Vagility (BIV) generated movement values that scaled well with home range size while revealing more information than home range estimates alone.

The aim of this work is to create a library for Boolean operations on 3D polygonal meshes. Resulting library has to support open models, its memory requirements shouldn't exceed those of existing solutions and it should, ideally, support multiple models. Most of the existing solutions are vulnerable to arithmetic inaccuracies, or do not support open meshes. The solution is based on Adaptive Mesh Booleans method which treats input models as adaptive surfaces. This method assumes that input models can be arbitrarily refined and no individual polygon is particularly important. Instead of computing exact polygon intersections, the input meshes are refined in intersection regions, intersecting polygons are discarded and created holes are closed. Advantages of this approach are robustness against numerical errors, support for open meshes, possibility to trade accuracy for computation time and ability to solve cases like co-planar and near-coincident regions. The resulting library offers three Boolean operations: union, difference and intersection.

This thesis presents various approaches for race track surface reconstruction based on different algorithms designated for these purposes. In addition to surface reconstruction it also offers proposals for polygon mesh filling in the unscanned areas around the track.

This thesis deals with the procedural generation of building models based on a given pattern. The community project OpenStreetMap is used for obtaining datasets that create the buildings platform patterns. A brief survey of classifiers and formal grammars for modeling is introduced. Designing an estate classifier and algorithm for building generation is practical aspect of this thesis, including the algorithm implementation. 3D output meshes are rendered using OpenGL in real-time.

The recent growth in sensor technology allows easier information gathering in real-time as sensors have grown smaller, more accurate, and less expensive. The resulting data is often in a geo-stream format continuously changing input with a spatial extent. Researchers developing geo-streaming management systems (GSMS) require a benchmark system for evaluation, which is currently lacking. This thesis presents GSMark, a benchmark for evaluating GSMSs. GSMark provides a data generator that creates a combination of synthetic and real geo-streaming data, a workload simulator to present the data to the GSMS as a data stream, and a set of benchmark queries that evaluate typical GSMS functionality and query performance. In particular, GSMark generates both moving points and evolving spatial regions, two fundamental data types for a broad range of geo-stream applications, and the geo-streaming queries on this data.