The aim of the diploma thesis is to analyze the current state of creation of management reporting, its contribution to a company and to create a proposal for improving and expanding awareness of reporting in a company.

This thesis designs and implements an intermediary layer on both the backend and the frontend part of a web application, together with a user interface used to show analysis outputs and to manage the data. This layer was designed based on analysis of several existing solutions, in various languages and environments, and implemented using MongoDB and PostgreSQL databases, written in PHP on the server side and in JavaScript on the client side. It offers an immediately usable flexible persistence layer directly in the frontend, with analysis, feedback and an option to convert collections to PostgreSQL while keeping the same API, enabling a fluent transition.

Cette thèse aborde la problématique du calcul d’ombre exact par pixel en temps réel. Ce mémoire propose une nouvelle méthode de rendu d’ombre dure avec une partition de volumes d’ombre : un arbre ternaire basés sur les plans d’ombre des volumes d’ombre de la scène est construit dans un premier temps, avant de l’interroger pour déterminer l’ombrage des pixels de l’image. Une des propriétés intéressantes de cette structure est la prédictibilité de son empreinte mémoire ; contrairement aux méthodes de calcul d’ombre, cette méthode supporte des scènes géométriquement complexes de l’ordre du million de triangles grâce au comportement logarithmique du parcours de la structure vis à vis de la complexité géométrique. / This thesis focuses on exact per pixel hard shadow computation. We propose a new method for rendering hard shadows using a partition of shadow volumes : first, a ternary tree based on the shadow planes of the shadow volumes, and then, it is traversed to determine the shading of each pixel in the image. An interesting property of this structure is the predictability of its memory footprint ; Unlike other geometric shadow methods, our approach supports complex scenes up to a million triangles thanks to the logarithmic behavior of the structure traversal with respect to the geometric complexity.

Since the late 90s, support and services at SAAB have produced and maintained a product called ELDIS. ELDIS is an application used by Swedish armed forces at air bases in Sweden and flight technicians at air bases. It displays electrical information, wire diagrams, and detailed information for cables, electrical equipment, and other electrical devices. The main problem for ELDIS is that when drawing wire diagrams in the application, it takes too long of a time when the stored procedures are retrieving information from the database. There are two significant areas in this project, analyzing and optimizing stored procedures and implementing a client-side solution. This project aims to guide SAAB to choose the right approach for solving the performance issue of the application and display some of the problems that can exist with slow stored procedures for companies in general. This project has optimized the most used stored procedure at SAAB and compared it to a client-side solution and the original application. The result of this project is that both the optimized stored procedure implementation and the client-side implementation is a faster option than the original implementation. It also highlights that when trying to optimize the stored procedures, indexing on the database should be considered for increasing the performance of a stored procedure.

The ADtree, a data structure useful for caching sufficient statistics, has been successfully adapted to grow lazily when memory is limited and to update sequentially with an incrementally updated dataset. However, even these modified forms of the ADtree still exhibit inefficiencies in terms of both space usage and query time, particularly on datasets with very high dimensionality and with high arity features. We propose five modifications to the ADtree, each of which can be used to improve size and query time under specific types of datasets and features. These modifications also provide an increased ability to precisely control how an ADtree is built and to tune its size given external memory or speed requirements.

<p>Synthesis of terrains with complex features has been a challenging problem in computer graphics since most of the existing methods are based on the height field representation. Complex features in terrains adds to the overall realism of the terrain. Hence, there is a need to synthesize terrains in real-time with complex features that adhere to user input. The methodology described in this thesis describes a novel way to synthesize terrains with complex features based on user drawn sketches. Layered stack data structure is used to ensure that the resulting terrain has complex features. Since, Neural Networks are used to generate the terrains, the process is real-time.</p>

No description available.

No description available.

No description available.

No description available.