Processing and interactive editing of huge point clouds from 3D scanners

This paper describes a new out-of-core multi-resolution data structure for real-time visualization, interactive editing and externally efficient processing of large point clouds. We describe an editing system that makes use of the novel data structure to provide interactive editing and preprocessing tools for large scanner data sets. Using the new data structure, we provide a complete tool chain for 3D scanner data processing, from data preprocessing and filtering to manual touch-up and real-time visualization. In particular, we describe an out-of-core outlier removal and bilateral geometry filtering algorithm, a toolset for interactive selection, painting, transformation, and filtering of huge out-of-core point-cloud data sets and a real-time rendering algorithm, which all use the same data structure as storage backend. The interactive tools work in real-time for small model modifications. For large scale editing operations, we employ a two-resolution approach where editing is planned in real-time and executed in an externally efficient offline computation afterwards. We evaluate our implementation on example data sets of sizes up to 63 GB, demonstrating that the proposed technique can be used effectively in real-world applications.     

SplitLab: A shear-wave splitting environment in Matlab

We present a graphical user interface to facilitate the processing of teleseismic shear-wave splitting observations. In contrast to a fully automated technique, we present a manual, per-event approach that maintains user control during the sequence of processing. The SplitLab environment is intended to undertake the repetitive processing steps while enabling the user to focus on quality control and eventually the interpretation of the results. Pre-processing modules of SplitLab create a database of events and link the corresponding seismogram files. The seismogram viewer tool uses this database to perform the measurement interactively. Post-processing of the combined results of such a project includes a viewer and export option. Our emphasis lies in the application to teleseismic shear-wave splitting analysis, but our code can be extended easily for other purposes. SplitLab can be downloaded at http://www.gm.univ-montp2.fr/splitting/.     

Particle Level Set Advection for the Interactive Visualization of Unsteady 3D Flow

Typically, flow volumes are visualized by defining their boundary as iso‐surface of a level set function. Grid‐based level sets offer a good global representation but suffer from numerical diffusion of surface detail, whereas particle‐based methods preserve details more accurately but introduce the problem of unequal global representation. The particle level set (PLS) method combines the advantages of both approaches by interchanging the information between the grid and the particles. Our work demonstrates that the PLS technique can be adapted to volumetric dye advection via streak volumes, and to the visualization by time surfaces and path volumes. We achieve this with a modified and extended PLS, including a model for dye injection. A new algorithmic interpretation of PLS is introduced to exploit the efficiency of the GPU, leading to interactive visualization. Finally, we demonstrate the high quality and usefulness of PLS flow visualization by providing quantitative results on volume preservation and by discussing typical applications of 3D flow visualization.     

Automatic Construction and Verification of Isotopy Invariants

We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Isotopism is an important generalisation of isomorphism, and is studied by mathematicians in domains such as loop theory. This extension was not straightforward, and we had to solve two major technical problems, namely, generating and verifying isotopy invariants. Concentrating on the domain of loop theory, we have developed three novel techniques for generating isotopic invariants, by using the notion of universal identities and by using constructions based on subblocks. In addition, given the complexity of the theorems that verify that a conjunction of the invariants form an isotopy class, we have developed ways of simplifying the problem of proving these theorems. Our techniques employ an interplay of computer algebra, model generation, theorem proving, and satisfiability-solving methods. To demonstrate the power of the approach, we generate isotopic classification theorems for loops of size 6 and 7, which extend the previously known enumeration results. This work was previously beyond the capabilities of automated reasoning techniques. The author’s work was supported by EPSRC MathFIT grant GR/S31099.     

Multi-block Poisson grid generator for cascade simulations

High quality computational grids can greatly enhance the accuracy of turbine and compressor cascade simulations especially when time-dependent results are sought where vortical structures are convected through the computational domain. A technique for generating periodic structured grids for cascade simulations based on the Poisson equations is described. To allow for more complex geometries, the grid can be divided into individual zones or blocks. The grids are generated simultaneously in all blocks, assuring continuity of the grid lines and their slopes across the zonal boundaries. Simple geometric rules can be employed for enforcing orthogonality at block boundaries. The method results in grids with low grid distortion by allowing both, block boundaries and grid points on physical boundaries, to move freely. Results are presented for a linear turbine and a linear compressor cascade.     

Production of two-material micro-assemblies by two-component powder injection molding and sinter-joining

In the field of micro-technology the production of metallic and ceramic micro-components by powder injection molding (PIM) has become a more and more established fabrication method. But in order to fulfill the demand for more complex-shaped high-precision micro-components further development work has to be performed. This is especially true if more efficient production routes for multi-component-micro-assemblies consisting of different materials or sub-components are envisaged. To meet these challenges, investigations are performed to realize and to establish two primary shape micro-processes. These are two-component micro-injection molding (2C-MicroPIM) and sinter-joining. The realization of these technologies will lead to a markedly reduction of the efforts for handling, adjustment, and assembling of metallic and ceramic micro-assemblies. Furthermore, an increased integration level and functionality can be yielded. For an effective transfer of scientific results to industrial applications the whole process chain must be considered, from development and construction of the tooling as well as of the components to the quality assurance and determination of the properties of the assemblies after sintering. These primary shape processes shall enable the mutual processing of different materials within the fabrication process, so avoiding separate mounting or assembling steps. Additionally fixed and loose junctions between at least two components shall be realized. The progress in research and development will be demonstrated especially by the implementation of shaft-to-collar connections between micro-gearwheels and corresponding shafts. Regarding two-component micro-injection molding, the tool construction for shaft-to-collar connections will be presented as well as first experimental results on the properties of selected ceramic powders and feedstocks for the special requirements of the 2C-MicroPIM process. With the assembly step being performed outside the injection molding tool before sinter-joining different parts and geometries can be combined quite easily. The presented article gives an overview on the concept and on preliminary testing results for the fabrication of a shaft-to-collar-connection. Additionally, a solution for an automated assembly of a shaft and a toothed wheel outside the injection molding tool is presented.     

t-Private and t-secure Auctions

In most of the auction systems the values of bids are known to the auctioneer. This allows him to manipulate the outcome of the auction. Hence, one might be interested in hiding these values. Some cryptographically secure protocols for electronic auctions have been presented in the last decade. Our work extends these protocols in several ways. On the basis of garbled circuits, i.e., encrypted circuits, we present protocols for sealed-bid auctions that fulfill the following requirements: 1) protocols are information-theoretically t-private for honest but curious parties; 2) the number of bits that can be learned by malicious adversaries is bounded by the output length of the auction; 3) the computational requirements for participating parties are very low: only random bit choices and bitwise computation of the XOR-function are necessary. Note that one can distinguish between the protocol that generates a garbled circuit for an auction and the protocol to evaluate the auction. In this paper we address both problems. We will present a t-private protocol for the construction of a garbled circuit that reaches the lower bound of 2t 1 parties, and a more randomness effcient protocol for (t 1)2 parties. Finally, we address the problem of bid changes in an auction.     

Improving SCTP retransmission delays for time-dependent thin streams

A large number of network services rely on IP and reliable transport protocols. For applications that provide abundant data for transmission, loss is usually handled satisfactorily, even if the application is latency-sensitive (Wang et al. 2004). For data streams where small packets are sent intermittently, however, applications can occasionally experience extreme latencies (Griwodz and Halvorsen 2006). As it is not uncommon that such thin-stream applications are time-dependent, any unnecessarily induced delay can have severe consequences for the service provided. Massively Multiplayer Online Games (MMOGs) are a defining example of thin streams. Many MMOGs (like World of Warcraft and Age of Conan) use TCP for the benefits of reliability, in-order delivery and NAT/firewall traversal. It has been shown that TCP has several shortcomings with respect to the latency requirements of thin streams because of the way it handles retransmissions (Griwodz and Halvorsen 2006). As such, an alternative to TCP may be SCTP (Stewart et al. 2000), which was originally developed to meet the requirements of signaling transport. In this paper, we evaluate the Linux-kernel SCTP implementation in the context of thin streams. To address the identified latency challenges, we propose sender-side only enhancements that reduce the application-layer latency in a manner that is compatible with unmodified receivers. These enhancements can be switched on by applications and are used only when the system identifies the stream as thin. To evaluate the latency performance, we have performed several tests over various real networks and over an emulated network, varying parameters like RTT, packet loss and amount of competing cross traffic. When comparing our modifications with SCTP on Linux and FreeBSD and TCP New Reno, our results show great latency improvements and indicate the need for a separate handling of thin and thick streams.     

Directed model checking with distance-preserving abstractions

In directed model checking, the traversal of the state space is guided by an estimate of the distance from the current state to the nearest error state. This paper presents a distance-preserving abstraction for concurrent systems that allows one to compute an interesting estimate of the error distance without hitting the state explosion problem. Our experiments show a dramatic reduction both in the number of states explored by the model checker and in the total runtime.