A Level Set Approach for Denoising and Adaptively Smoothing Complex Geometry Stereolithography Files

abstract: Stereolithography files (STL) are widely used in diverse fields as a means of describing complex geometries through surface triangulations. The resulting stereolithography output is a result of either experimental measurements, or computer-aided design. Often times stereolithography outputs from experimental means are prone to noise, surface irregularities and holes in an otherwise closed surface. A general method for denoising and adaptively smoothing these dirty stereolithography files is proposed. Unlike existing means, this approach aims to smoothen the dirty surface representation by utilizing the well established levelset method. The level of smoothing and denoising can be set depending on a per-requirement basis by means of input parameters. Once the surface representation is smoothened as desired, it can be extracted as a standard levelset scalar isosurface. The approach presented in this thesis is also coupled to a fully unstructured Cartesian mesh generation library with built-in localized adaptive mesh refinement (AMR) capabilities, thereby ensuring lower computational cost while also providing sufficient resolution. Future work will focus on implementing tetrahedral cuts to the base hexahedral mesh structure in order to extract a fully unstructured hexahedra-dominant mesh describing the STL geometry, which can be used for fluid flow simulations.Dissertation/ThesisMasters Thesis Aerospace Engineering 201

A storage and access architecture for efficient query processing in spatial database systems

Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and access architecture with respect to efficient query processing. Performance improving concepts such as spatial storage and access structures, approximations, object decompositions and multi-phase query processing have been suggested and analyzed as single building blocks. In this paper, we describe a storage and access architecture which is composed from the above building blocks in a modular fashion. Additionally, we incorporate into our architecture a new ingredient, the scene organization, for efficiently supporting set-oriented access of large-area region queries. An experimental performance comparison demonstrates that the concept of scene organization leads to considerable performance improvements for large-area region queries by a factor of up to 150

Query processing of spatial objects: Complexity versus Redundancy

The management of complex spatial objects in applications, such as geography and cartography, imposes stringent new requirements on spatial database systems, in particular on efficient query processing. As shown before, the performance of spatial query processing can be improved by decomposing complex spatial objects into simple components. Up to now, only decomposition techniques generating a linear number of very simple components, e.g. triangles or trapezoids, have been considered. In this paper, we will investigate the natural trade-off between the complexity of the components and the redundancy, i.e. the number of components, with respect to its effect on efficient query processing. In particular, we present two new decomposition methods generating a better balance between the complexity and the number of components than previously known techniques. We compare these new decomposition methods to the traditional undecomposed representation as well as to the well-known decomposition into convex polygons with respect to their performance in spatial query processing. This comparison points out that for a wide range of query selectivity the new decomposition techniques clearly outperform both the undecomposed representation and the convex decomposition method. More important than the absolute gain in performance by a factor of up to an order of magnitude is the robust performance of our new decomposition techniques over the whole range of query selectivity

Mini-Workshop: Analytical and Numerical Methods in Image and Surface Processing

The workshop successfully brought together researchers from mathematical analysis, numerical mathematics, computer graphics and image processing. The focus was on variational methods in image and surface processing such as active contour models, Mumford-Shah type functionals, image and surface denoising based on geometric evolution problems in image and surface fairing, physical modeling of surfaces, the restoration of images and surfaces using higher order variational formulations

ColDICE: a parallel Vlasov-Poisson solver using moving adaptive simplicial tessellation

Resolving numerically Vlasov-Poisson equations for initially cold systems can be reduced to following the evolution of a three-dimensional sheet evolving in six-dimensional phase-space. We describe a public parallel numerical algorithm consisting in representing the phase-space sheet with a conforming, self-adaptive simplicial tessellation of which the vertices follow the Lagrangian equations of motion. The algorithm is implemented both in six- and four-dimensional phase-space. Refinement of the tessellation mesh is performed using the bisection method and a local representation of the phase-space sheet at second order relying on additional tracers created when needed at runtime. In order to preserve in the best way the Hamiltonian nature of the system, refinement is anisotropic and constrained by measurements of local Poincar\'e invariants. Resolution of Poisson equation is performed using the fast Fourier method on a regular rectangular grid, similarly to particle in cells codes. To compute the density projected onto this grid, the intersection of the tessellation and the grid is calculated using the method of Franklin and Kankanhalli (1993) generalised to linear order. As preliminary tests of the code, we study in four dimensional phase-space the evolution of an initially small patch in a chaotic potential and the cosmological collapse of a fluctuation composed of two sinusoidal waves. We also perform a "warm" dark matter simulation in six-dimensional phase-space that we use to check the parallel scaling of the code.Comment: Code and illustration movies available at: http://www.vlasix.org/index.php?n=Main.ColDICE - Article submitted to Journal of Computational Physic

The Grid Dependence of Well Inflow Performance in Reservoir Simulation

Imperial Users onl

Collaborative geographic visualization

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia do Ambiente, perfil Gestão e Sistemas AmbientaisThe present document is a revision of essential references to take into account when developing ubiquitous Geographical Information Systems (GIS) with collaborative visualization purposes. Its chapters focus, respectively, on general principles of GIS, its multimedia components and ubiquitous practices; geo-referenced information visualization and its graphical components of virtual and augmented reality; collaborative environments, its technological requirements, architectural specificities, and models for collective information management; and some final considerations about the future and challenges of collaborative visualization of GIS in ubiquitous environment

Integrated modelling for 3D GIS

A three dimensional (3D) model facilitates the study of the real world objects it represents. A geoinformation system (GIS) should exploit the 3D model in a digital form as a basis for answering questions pertaining to aspects of the real world. With respect to the earth sciences, different kinds of objects of reality can be realized. These objects are components of the reality under study. At the present state-of-the-art different realizations are usually situated in separate systems or subsystems. This separation results in redundancy and uncertainty when different components sharing some common aspects are combined. Relationships between different kinds of objects, or between components of an object, cannot be represented adequately. This thesis aims at the integration of those components sharing some common aspects in one 3D model. This integration brings related components together, minimizes redundancy and uncertainty. Since the model should permit not only the representation of known aspects of reality, but also the derivation of information from the existing representation, the design of the model is constrained so as to afford these capabilities. The tessellation of space by the network of simplest geometry, the simplicial network, is proposed as a solution. The known aspects of the reality can be embedded in the simplicial network without degrading their quality. The model provides finite spatial units useful for the representation of objects. Relationships between objects can also be expressed through components of these spatial units which at the same time facilitate various computations and the derivation of information implicitly available in the model. Since the simplicial network is based on concepts in geoinformation science and in mathematics, its design can be generalized for n-dimensions. The networks of different dimension are said to be compatible, which enables the incorporation of a simplicial network of a lower dimension into another simplicial network of a higher dimension.The complexity of the 3D model fulfilling the requirements listed calls for a suitable construction method. The thesis presents a simple way to construct the model. The raster technique is used for the formation of the simplicial network embedding the representation of the known aspects of reality as constraints. The prototype implementation in a software package, ISNAP, demonstrates the simplicial network's construction and use. The simplicial network can facilitate spatial and non spatial queries, computations, and 2D and 3D visualizations. The experimental tests using different kinds of data sets show that the simplicial network can be used to represent real world objects in different dimensionalities. Operations traditionally requiring different systems and spatial models can be carried out in one system using one model as a basis. This possibility makes the GIS more powerful and easy to use