Volume 33 (2014)

Permanent URI for this community

https://diglib.eg.org/handle/10.2312/7081

Browse

Now showing 1 - 20 of 245

ShapeSynth: Parameterizing Model Collections for Coupled Shape Exploration and Synthesis
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Averkiou, Melinos; Kim, Vladimir G.; Zheng, Youyi; Mitra, Niloy J.; B. Levy and J. Kautz
Recent advances in modeling tools enable non-expert users to synthesize novel shapes by assembling parts extracted from model databases. A major challenge for these tools is to provide users with relevant parts, which is especially difficult for large repositories with significant geometric variations. In this paper we analyze unorganized collections of 3D models to facilitate explorative shape synthesis by providing high-level feedback of possible synthesizable shapes. By jointly analyzing arrangements and shapes of parts across models, we hierarchically embed the models into low-dimensional spaces. The user can then use the parameterization to explore the existing models by clicking in different areas or by selecting groups to zoom on specific shape clusters. More importantly, any point in the embedded space can be lifted to an arrangement of parts to provide an abstracted view of possible shape variations. The abstraction can further be realized by appropriately deforming parts from neighboring models to produce synthesized geometry. Our experiments show that users can rapidly generate plausible and diverse shapes using our system, which also performs favorably with respect to previous modeling tools.
Thumbnail Galleries for Procedural Models
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Lienhard, Stefan; Specht, Matthias; Neubert, Boris; Pauly, Mark; Müller, Pascal; B. Levy and J. Kautz
Procedural modeling allows for the generation of innumerable variations of models from a parameterized, conditional or stochastic rule set. Due to the abstractness, complexity and stochastic nature of rule sets, it is often very difficult to have an understanding of the diversity of models that a given rule set defines. We address this problem by presenting a novel system to automatically generate, cluster, rank, and select a series of representative thumbnail images out of a rule set. We introduce a set of view attributes that can be used to measure the suitability of an image to represent a model, and allow for comparison of different models derived from the same rule set. To find the best thumbnails, we exploit these view attributes on images of models obtained by stochastically sampling the parameter space of the rule set. The resulting thumbnail gallery gives a representative visual impression of the procedural modeling potential of the rule set. Performance is discussed by means of a number of distinct examples and compared to state-of-the-art approaches.
Visualizing Validation of Protein Surface Classifiers
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Sarikaya, Alper; Albers, Danielle; Mitchell, Julie; Gleicher, Michael; H. Carr, P. Rheingans, and H. Schumann
Many bioinformatics applications construct classifiers that are validated in experiments that compare their results to known ground truth over a corpus. In this paper, we introduce an approach for exploring the results of such classifier validation experiments, focusing on classifiers for regions of molecular surfaces. We provide a tool that allows for examining classification performance patterns over a test corpus. The approach combines a summary view that provides information about an entire corpus of molecules with a detail view that visualizes classifier results directly on protein surfaces. Rather than displaying miniature 3D views of each molecule, the summary provides 2D glyphs of each protein surface arranged in a reorderable, small-multiples grid. Each summary is specifically designed to support visual aggregation to allow the viewer to both get a sense of aggregate properties as well as the details that form them. The detail view provides a 3D visualization of each protein surface coupled with interaction techniques designed to support key tasks, including spatial aggregation and automated camera touring. A prototype implementation of our approach is demonstrated on protein surface classifier experiments.
Optimizing BRDF Orientations for the Manipulation of Anisotropic Highlights
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Raymond, Boris; Guennebaud, Gaël; Barla, Pascal; Pacanowski, Romain; Granier, Xavier; B. Levy and J. Kautz
This paper introduces a system for the direct editing of highlights produced by anisotropic BRDFs, which we call anisotropic highlights. We first provide a comprehensive analysis of the link between the direction of anisotropy and the shape of highlight curves for arbitrary object surfaces. The gained insights provide the required ingredients to infer BRDF orientations from a prescribed highlight tangent field. This amounts to a non-linear optimization problem, which is solved at interactive framerates during manipulation. Taking inspiration from sculpting software, we provide tools that give the impression of manipulating highlight curves while actually modifying their tangents. Our solver produces desired highlight shapes for a host of lighting environments and anisotropic BRDFs.
Detection and Reconstruction of Freeform Sweeps
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Barton, Michael; Pottmann, Helmut; Wallner, Johannes; B. Levy and J. Kautz
We study the difficult problem of deciding if parts of a freeform surface can be generated, or approximately generated, by the motion of a planar profile through space. While this task is basic for understanding the geometry of shapes as well as highly relevant for manufacturing and building construction, previous approaches were confined to special cases like kinematic surfaces or moulding surfaces. The general case remained unsolved so far. We approach this problem by a combination of local and global methods: curve analysis with regard to movability , curve comparison by common substring search in curvature plots, an exhaustive search through all planar cuts enhanced by quick rejection procedures, the ordering of candidate profiles and finally, global optimization. The main applications of our method are digital reconstruction of CAD models exhibiting sweep patches, and aiding in manufacturing freeform surfaces by pointing out those parts which can be approximated by sweeps.
Automatic Generation of Tourist Brochures
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Birsak, Michael; Musialski, Przemyslaw; Wonka, Peter; Wimmer, Michael; B. Levy and J. Kautz
We present a novel framework for the automatic generation of tourist brochures that include routing instructions and additional information presented in the form of so-called detail lenses. The first contribution of this paper is the automatic creation of layouts for the brochures. Our approach is based on the minimization of an energy function that combines multiple goals: positioning of the lenses as close as possible to the corresponding region shown in an overview map, keeping the number of lenses low, and an efficient numbering of the lenses. The second contribution is a route-aware simplification of the graph of streets used for traveling between the points of interest (POIs). This is done by reducing the graph consisting of all shortest paths through the minimization of an energy function. The output is a subset of street segments that enable traveling between all the POIs without considerable detours, while at the same time guaranteeing a clutter-free visualization.
Perceptual Depth Compression for Stereo Applications
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Pajak, Dawid; Herzog, Robert; Mantiuk, Radoslaw; Didyk, Piotr; Eisemann, Elmar; Myszkowski, Karol; Pulli, Kari; B. Levy and J. Kautz
Conventional depth video compression uses video codecs designed for color images. Given the performance of current encoding standards, this solution seems efficient. However, such an approach suffers from many issues stemming from discrepancies between depth and light perception. To exploit the inherent limitations of human depth perception, we propose a novel depth compression method that employs a disparity perception model. In contrast to previous methods, we account for disparity masking, and model a distinct relation between depth perception and contrast in luminance. Our solution is a natural extension to the H.264 codec and can easily be integrated into existing decoders. It significantly improves both the compression efficiency without sacrificing visual quality of depth of rendered content, and the output of depth-reconstruction algorithms or depth cameras.
3D Timeline: Reverse Engineering of a Part-based Provenance from Consecutive 3D Models
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Dobos, Jozef; Mitra, Niloy J.; Steed, Anthony; B. Levy and J. Kautz
We present a novel tool for reverse engineering of modeling histories from consecutive 3D files based on a timeline abstraction. Although a timeline interface is commonly used in 3D modeling packages for animations, it has not been used on geometry manipulation before. Unlike previous visualization methods that require instrumentation of editing software, our approach does not rely on pre-recorded editing instructions. Instead, each stand-alone 3D file is treated as a keyframe of a construction flow from which the editing provenance is reverse engineered. We evaluate this tool on six complex 3D sequences created in a variety of modeling tools by different professional artists and conclude that it provides useful means of visualizing and understanding the editing history. A comparative user study suggests the tool is well suited for this purpose.
Controlled Metamorphosis Between Skeleton‐Driven Animated Polyhedral Meshes of Arbitrary Topologies
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Kravtsov, Denis; Fryazinov, Oleg; Adzhiev, Valery; Pasko, Alexander; Comninos, Peter; Holly Rushmeier and Oliver Deussen
Enabling animators to smoothly transform between animated meshes of differing topologies is a long‐standing problem in geometric modelling and computer animation. In this paper, we propose a new hybrid approach built upon the advantages of scalar field‐based models (often called implicit surfaces) which can easily change their topology by changing their defining scalar field. Given two meshes, animated by their rigging‐skeletons, we associate each mesh with its own approximating implicit surface. This implicit surface moves synchronously with the mesh. The shape‐metamorphosis process is performed in several steps: first, we collapse the two meshes to their corresponding approximating implicit surfaces, then we transform between the two implicit surfaces and finally we inverse transition from the resulting metamorphosed implicit surface to the target mesh. The examples presented in this paper demonstrating the results of the proposed technique were implemented using an in‐house plug‐in for Maya™.Enabling animators to smoothly transform between animated meshes of differing topologies is a long‐standing problem in geometric modelling and computer animation. In this paper, we propose a new hybrid approach built upon the advantages of scalar field‐based models (often called implicit surfaces) which can easily change their topology by changing their defining scalar field. Given two meshes, animated by their rigging‐skeletons, we associate each mesh with its own approximating implicit surface. This implicit surface moves synchronously with the mesh. The shape‐metamorphosis process is performed in several steps: first, we collapse the two meshes to their corresponding approximating implicit surfaces, then we transform between the two implicit surfaces.
Illustrative Visualization of Molecular Reactions using Omniscient Intelligence and Passive Agents
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Muzic, Mathieu Le; Parulek, Julius; Stavrum, Anne Kristin; Viola, Ivan; H. Carr, P. Rheingans, and H. Schumann
In this paper we propose a new type of a particle systems, tailored for illustrative visualization purposes, in particular for visualizing molecular reactions in biological networks. Previous visualizations of biochemical processes were exploiting the results of agent-based modeling. Such modeling aims at reproducing accurately the stochastic nature of molecular interactions. However, it is impossible to expect events of interest happening at a certain time and location, which is impractical for storytelling. To obtain the means of controlling molecular interactions, we propose to govern passive agents with an omniscient intelligence, instead of giving to the agents the freedom of initiating reaction autonomously. This makes it possible to generate illustrative animated stories that communicate the functioning of the molecular machinery. The rendering performance delivers for interactive framerates of massive amounts of data, based on the dynamic tessellation capabilities of modern graphics cards. Finally, we report an informal expert feedback we obtained from the potential users.
Time Line Cell Tracking for the Approximation of Lagrangian Coherent Structures with Subgrid Accuracy
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Kuhn, A.; Engelke, W.; Rössl, C.; Hadwiger, M.; Theisel, H.; Holly Rushmeier and Oliver Deussen
Lagrangian coherent structures (LCSs) have become a widespread and powerful method to describe dynamic motion patterns in time-dependent flow fields. The standard way to extract LCS is to compute height ridges in the finite-time Lyapunov exponent field. In this work, we present an alternative method to approximate Lagrangian features for 2D unsteady flow fields that achieve subgrid accuracy without additional particle sampling. We obtain this by a geometric reconstruction of the flow map using additional material constraints for the available samples. In comparison to the standard method, this allows for a more accurate global approximation of LCS on sparse grids and for long integration intervals. The proposed algorithm works directly on a set of given particle trajectories and without additional flow map derivatives. We demonstrate its application for a set of computational fluid dynamic examples, as well as trajectories acquired by Lagrangian methods, and discuss its benefits and limitations.Lagrangian Coherent Structures (LCS) have become a widespread and powerful method to describe dynamic motion patterns in time-dependent flow fields. The standard way to extract LCS is to compute height ridges in the Finite Time Lyapunov Exponent (FTLE) field. In this work, we present an alternative method to approximate Lagrangian features for 2D unsteady flow fields that achieves subgrid accuracy without additional particle sampling. We obtain this by a geometric reconstruction of the flow map using additional material constraints for the available samples. The illustration shows four approximations of LCS at different time steps in subgrid accuracy computed from a triangular grid containing 60 times 120 sample points for a heated cylinder simulation.
Coded Exposure HDR Light-Field Video Recording
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Schedl, David C.; Birklbauer, Clemens; Bimber, Oliver; B. Levy and J. Kautz
Capturing exposure sequences to compute high dynamic range (HDR) images causes motion blur in cases of camera movement. This also applies to light-field cameras: frames rendered from multiple blurred HDR lightfield perspectives are also blurred. While the recording times of exposure sequences cannot be reduced for a single-sensor camera, we demonstrate how this can be achieved for a camera array. Thus, we decrease capturing time and reduce motion blur for HDR light-field video recording. Applying a spatio-temporal exposure pattern while capturing frames with a camera array reduces the overall recording time and enables the estimation of camera movement within one light-field video frame. By estimating depth maps and local point spread functions (PSFs) from multiple perspectives with the same exposure, regional motion deblurring can be supported. Missing exposures at various perspectives are then interpolated.
SimSelect: Similarity-based Selection for 3D Surfaces
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Guy, Emilie; Thiery, Jean-Marc; Boubekeur, Tamy; B. Levy and J. Kautz
Surface selection is one of the fundamental interactions in shape modeling. In the case of complex models, this task is often tedious for at least two reasons: firstly the local geometry of a given region may be hard to manually select and needs great accuracy; secondly the selection process may have to be repeated a large number of times for similar regions requiring similar subsequent editing. We propose SimSelect, a new system for interactive selection on 3D surfaces addressing these two issues. We cope with the accuracy issue by classifying selections in different types, namely components, parts and patches for which we independently optimize the selection process. Second, we address the repetitiveness issue by introducing an expansion process based on shape recognition which automatically retrieves potential selections similar to the user-defined one. As a result, our system provides the user with a compact set of simple interaction primitives providing a smooth select-and-edit workflow.
Designing Large-Scale Interactive Traffic Animations for Urban Modeling
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Garcia-Dorado, Ignacio; Aliaga, Daniel G.; Ukkusuri, Satish V.; B. Levy and J. Kautz
Designing and optimizing traffic behavior and animation is a challenging problem of interest to virtual environment content generation and to urban planning and design. While some traffic simulation methods have appeared in computer graphics, most related systems focus on the design of buildings, roads, or cities but without explicitly considering urban traffic. To our knowledge, our work provides the first interactive approach which enables a designer to specify a desired vehicular traffic behavior (e.g., road occupancy, travel time, emissions, etc.) and the system will automatically compute what realistic 3D urban model (e.g., an interconnected network of roads, parcels, and buildings) yields the specified behavior. Our system both altered and improved traffic behavior in novel procedurally-generated cities and in road networks of existing cities. Our urban models contain up to 360 km of roads, 300,000 vehicles, and typically cover four hours of simulated peak traffic time. The typical editing session time to "paint" a new traffic pattern and to compute the new/changed urban model is two to five minutes.
Deformation with Enforced Metrics on Length, Area and Volume
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Jin, Shuo; Zhang, Yunbo; Wang, Charlie C. L.; B. Levy and J. Kautz
Techniques have been developed to deform a mesh with multiple types of constraints. One limitation of prior methods is that the accuracy of demanded metrics on the resultant model cannot be guaranteed. Adding metrics directly as hard constraints to an optimization functional often leads to unexpected distortion when target metrics differ significant from what are on the input model. In this paper, we present an effective framework to deform mesh models by enforcing demanded metrics on length, area and volume. To approach target metrics stably and minimize distortion, an iterative scale-driven deformation is investigated, and a global optimization functional is exploited to balance the scaling effect at different parts of a model. Examples demonstrate that our approach provides a user-friendly tool for designers who are used to semantic input.
Comparative Exploration of Document Collections: a Visual Analytics Approach
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Oelke, Daniela; Strobelt, Hendrik; Rohrdantz, Christian; Gurevych, Iryna; Deussen, Oliver; H. Carr, P. Rheingans, and H. Schumann
We present an analysis and visualization method for computing what distinguishes a given document collection from others. We determine topics that discriminate a subset of collections from the remaining ones by applying probabilistic topic modeling and subsequently approximating the two relevant criteria distinctiveness and characteristicness algorithmically through a set of heuristics. Furthermore, we suggest a novel visualization method called DiTop-View, in which topics are represented by glyphs (topic coins) that are arranged on a 2D plane. Topic coins are designed to encode all information necessary for performing comparative analyses such as the class membership of a topic, its most probable terms and the discriminative relations. We evaluate our topic analysis using statistical measures and a small user experiment and present an expert case study with researchers from political sciences analyzing two real-world datasets.
Rate-distortion Optimized Compression of Motion Capture Data
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Vasa, Libor; Brunnett, Guido; B. Levy and J. Kautz
Lossy compression of motion capture data can alleviate the problems of efficient storage and transmission by exploiting the redundancy and the superfluous precision of the data. When considering the acceptable amount of distortion, perceptual issues have to be taken into account. Current state of the art methods reduce the data rate required for high quality storage of motion capture data using various techniques. Most of them, however, do not use the common tools of general data compression, such as the method of Lagrange multipliers, and thus they obtain sub-optimal results, making it difficult to do a fair comparison of their performance. In this paper, we present a general preprocessing step based on Lagrange multipliers, which allows to rigorously adjust the precision in each of the degrees of freedom of the input data according to the amount of influence the given degree of freedom has on the overall distortion. We then present a simple compression method based on Principal Component Analysis, which in combination with the proposed preprocessing achieves significantly better results than current state of the art methods. It allows optimization with respect to various distortion metrics, and we discuss the choice of the metric in two common but distinct scenarios, proposing a perceptually oriented comparison metric based on the relation of the problem at hand to the problem of compression of dynamic meshes.
Parallel Irradiance Caching for Interactive Monte-Carlo Direct Volume Rendering
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Khlebnikov, Rostislav; Voglreiter, Philip; Steinberger, Markus; Kainz, Bernhard; Schmalstieg, Dieter; H. Carr, P. Rheingans, and H. Schumann
We propose a technique to build the irradiance cache for isotropic scattering simultaneously with Monte Carlo progressive direct volume rendering on a single GPU, which allows us to achieve up to four times increased convergence rate for complex scenes with arbitrary sources of light. We use three procedures that run concurrently on a single GPU. The first is the main rendering procedure. The second procedure computes new cache entries, and the third one corrects the errors that may arise after creation of new cache entries. We propose two distinct approaches to allow massive parallelism of cache entry creation. In addition, we show a novel extrapolation approach which outputs high quality irradiance approximations and a suitable prioritization scheme to increase the convergence rate by dedicating more computational power to more complex rendering areas.
GuideME: Slice-guided Semiautomatic Multivariate Exploration of Volumes
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Zhou, Liang; Hansen, Charles; H. Carr, P. Rheingans, and H. Schumann
Multivariate volume visualization is important for many applications including petroleum exploration and medicine. State-of-the-art tools allow users to interactively explore volumes with multiple linked parameter-space views. However, interactions in the parameter space using trial-and-error may be unintuitive and time consuming. Furthermore, switching between different views may be distracting. In this paper, we propose GuideME: a novel slice-guided semiautomatic multivariate volume exploration approach. Specifically, the approach comprises four stages: attribute inspection, guided uncertainty-aware lasso creation, automated feature extraction and optional spatial fine tuning and visualization. Throughout the exploration process, the user does not need to interact with the parameter views at all and examples of complex real-world data demonstrate the usefulness, efficiency and ease-of-use of our method.
Visual Analysis of Sets of Heterogeneous Matrices Using Projection-Based Distance Functions and Semantic Zoom
(The Eurographics Association and John Wiley and Sons Ltd., 2014) Behrisch, Michael; Davey, James; Fischer, Fabian; Thonnard, Olivier; Schreck, Tobias; Keim, Daniel; Kohlhammer, Jörn; H. Carr, P. Rheingans, and H. Schumann
Matrix visualization is an established technique in the analysis of relational data. It is applicable to large, dense networks, where node-link representations may not be effective. Recently, domains have emerged in which the comparative analysis of sets of matrices of potentially varying size is relevant. For example, to monitor computer network traffic a dynamic set of hosts and their peer-to-peer connections on different ports must be analysed. A matrix visualization focused on the display of one matrix at a time cannot cope with this task. We address the research problem of the visual analysis of sets of matrices. We present a technique for comparing matrices of potentially varying size. Our approach considers the rows and/or columns of a matrix as the basic elements of the analysis. We project these vectors for pairs of matrices into a low-dimensional space which is used as the reference to compare matrices and identify relationships among them. Bipartite graph matching is applied on the projected elements to compute a measure of distance. A key advantage of this measure is that it can be interpreted and manipulated as a visual distance function, and serves as a comprehensible basis for ranking, clustering and comparison in sets of matrices. We present an interactive system in which users may explore the matrix distances and understand potential differences in a set of matrices. A flexible semantic zoom mechanism enables users to navigate through sets of matrices and identify patterns at different levels of detail. We demonstrate the effectiveness of our approach through a case study and provide a technical evaluation to illustrate its strengths.

Browse

Browsing Volume 33 (2014) by Issue Date

Results Per Page

Sort Options