1,968 research outputs found
Tipstreaming of a drop in simple shear flow in the presence of surfactant
We have developed a multi-phase SPH method to simulate arbitrary interfaces
containing surface active agents (surfactants) that locally change the
properties of the interface, such the surface tension coefficient. Our method
incorporates the effects of surface diffusion, transport of surfactant from/to
the bulk phase to/from the interface and diffusion in the bulk phase.
Neglecting transport mechanisms, we use this method to study the impact of
insoluble surfactants on drop deformation and breakup in simple shear flow and
present the results in a fluid dynamics video.Comment: Two videos are included for the Gallery of Fluid Motion of the APS
DFD Meeting 201
Stochastic Volume Rendering of Multi-Phase SPH Data
In this paper, we present a novel method for the direct volume rendering of large smoothed‐particle hydrodynamics (SPH) simulation data without transforming the unstructured data to an intermediate representation. By directly visualizing the unstructured particle data, we avoid long preprocessing times and large storage requirements. This enables the visualization of large, time‐dependent, and multivariate data both as a post‐process and in situ. To address the computational complexity, we introduce stochastic volume rendering that considers only a subset of particles at each step during ray marching. The sample probabilities for selecting this subset at each step are thereby determined both in a view‐dependent manner and based on the spatial complexity of the data. Our stochastic volume rendering enables us to scale continuously from a fast, interactive preview to a more accurate volume rendering at higher cost. Lastly, we discuss the visualization of free‐surface and multi‐phase flows by including a multi‐material model with volumetric and surface shading into the stochastic volume rendering
VisIVO - Integrated Tools and Services for Large-Scale Astrophysical Visualization
VisIVO is an integrated suite of tools and services specifically designed for
the Virtual Observatory. This suite constitutes a software framework for
effective visual discovery in currently available (and next-generation) very
large-scale astrophysical datasets. VisIVO consists of VisiVO Desktop - a stand
alone application for interactive visualization on standard PCs, VisIVO Server
- a grid-enabled platform for high performance visualization and VisIVO Web - a
custom designed web portal supporting services based on the VisIVO Server
functionality. The main characteristic of VisIVO is support for
high-performance, multidimensional visualization of very large-scale
astrophysical datasets. Users can obtain meaningful visualizations rapidly
while preserving full and intuitive control of the relevant visualization
parameters. This paper focuses on newly developed integrated tools in VisIVO
Server allowing intuitive visual discovery with 3D views being created from
data tables. VisIVO Server can be installed easily on any web server with a
database repository. We discuss briefly aspects of our implementation of VisiVO
Server on a computational grid and also outline the functionality of the
services offered by VisIVO Web. Finally we conclude with a summary of our work
and pointers to future developments
Hierarchical octree and k-d tree grids for 3D radiative transfer simulations
A crucial ingredient for numerically solving the 3D radiative transfer
problem is the choice of the grid that discretizes the transfer medium. Many
modern radiative transfer codes, whether using Monte Carlo or ray tracing
techniques, are equipped with hierarchical octree-based grids to accommodate a
wide dynamic range in densities. We critically investigate two different
aspects of octree grids in the framework of Monte Carlo dust radiative
transfer. Inspired by their common use in computer graphics applications, we
test hierarchical k-d tree grids as an alternative for octree grids. On the
other hand, we investigate which node subdivision-stopping criteria are optimal
for constructing of hierarchical grids. We implemented a k-d tree grid in the
3D radiative transfer code SKIRT and compared it with the previously
implemented octree grid. We also considered three different node
subdivision-stopping criteria (based on mass, optical depth, and density
gradient thresholds). Based on a small suite of test models, we compared the
efficiency and accuracy of the different grids, according to various quality
metrics. For a given set of requirements, the k-d tree grids only require half
the number of cells of the corresponding octree. Moreover, for the same number
of grid cells, the k-d tree is characterized by higher discretization accuracy.
Concerning the subdivision stopping criteria, we find that an optical depth
criterion is not a useful alternative to the more standard mass threshold,
since the resulting grids show a poor accuracy. Both criteria can be combined;
however, in the optimal combination, for which we provide a simple approximate
recipe, this can lead to a 20% reduction in the number of cells needed to reach
a certain grid quality. An additional density gradient threshold criterion can
be added that solves the problem of poorly resolving sharp edges and...
(abridged).Comment: 10 pages, 6 figures. Accepted for publication in A&
Visuelle Analyse großer Partikeldaten
Partikelsimulationen sind eine bewährte und weit verbreitete numerische Methode in der Forschung und Technik. Beispielsweise werden Partikelsimulationen zur Erforschung der Kraftstoffzerstäubung in Flugzeugturbinen eingesetzt. Auch die Entstehung des Universums wird durch die Simulation von dunkler Materiepartikeln untersucht. Die hierbei produzierten Datenmengen sind immens. So enthalten aktuelle Simulationen Billionen von Partikeln, die sich über die Zeit bewegen und miteinander interagieren. Die Visualisierung bietet ein großes Potenzial zur Exploration, Validation und Analyse wissenschaftlicher Datensätze sowie der zugrundeliegenden
Modelle. Allerdings liegt der Fokus meist auf strukturierten Daten mit einer regulären Topologie. Im Gegensatz hierzu bewegen sich Partikel frei durch Raum und Zeit. Diese Betrachtungsweise ist aus der Physik als das lagrange Bezugssystem bekannt. Zwar können Partikel aus dem lagrangen in ein reguläres eulersches Bezugssystem, wie beispielsweise in ein uniformes Gitter, konvertiert werden. Dies ist bei einer großen Menge an Partikeln jedoch mit einem erheblichen Aufwand verbunden. Darüber hinaus führt diese Konversion meist zu einem Verlust der Präzision bei gleichzeitig erhöhtem Speicherverbrauch. Im Rahmen dieser Dissertation werde ich neue Visualisierungstechniken erforschen, welche speziell auf der lagrangen Sichtweise basieren. Diese ermöglichen eine effiziente und effektive visuelle Analyse großer Partikeldaten
Multi-view Convolutional Neural Networks for 3D Shape Recognition
A longstanding question in computer vision concerns the representation of 3D
shapes for recognition: should 3D shapes be represented with descriptors
operating on their native 3D formats, such as voxel grid or polygon mesh, or
can they be effectively represented with view-based descriptors? We address
this question in the context of learning to recognize 3D shapes from a
collection of their rendered views on 2D images. We first present a standard
CNN architecture trained to recognize the shapes' rendered views independently
of each other, and show that a 3D shape can be recognized even from a single
view at an accuracy far higher than using state-of-the-art 3D shape
descriptors. Recognition rates further increase when multiple views of the
shapes are provided. In addition, we present a novel CNN architecture that
combines information from multiple views of a 3D shape into a single and
compact shape descriptor offering even better recognition performance. The same
architecture can be applied to accurately recognize human hand-drawn sketches
of shapes. We conclude that a collection of 2D views can be highly informative
for 3D shape recognition and is amenable to emerging CNN architectures and
their derivatives.Comment: v1: Initial version. v2: An updated ModelNet40 training/test split is
used; results with low-rank Mahalanobis metric learning are added. v3 (ICCV
2015): A second camera setup without the upright orientation assumption is
added; some accuracy and mAP numbers are changed slightly because a small
issue in mesh rendering related to specularities is fixe
- …