1624 results
Search Results
Now showing 1 - 10 of 1624
Item Challenges in the Digitisation of a High-reflective Artwork(The Eurographics Association, 2021) Catalano, Chiara Eva; Brunetto, Erika; Mortara, Michela; Pizzi, Corrado; Hulusic, Vedad and Chalmers, AlanIn this paper we report about the photogrammetric acquisition and reconstruction of a contemporary artwork, performed by offthe- shelf software. The ceramic piece of art is "Il Libro d'Oro del Terzo Paradiso" ("The Golden Book of the Third Paradise") by Michelangelo Pistoletto, accessed and studied in the framework of a regional project. This artefact is particularly challenging. On the one hand, it is golden coated and, as such, highly reflective. Hence, images are likely to suffer from highlight spots, shadows or self-reflections, and the reconstructed point cloud is typically noisy. On the other hand, the object exhibits simple geometry, mainly composed of planar surfaces, and is highly symmetric; however, it possesses detail features and undercuts. The symmetric nature of the object and reflections misled the image alignment, and the noise in the data turned out to be of the same scale as the detail features. We will discuss all the steps of the process, aimed at obtaining a high quality and accurate 3D model using low-cost tools.Item Fast Updates for Least-Squares Rotational Alignment(The Eurographics Association and John Wiley & Sons Ltd., 2021) Zhang, Jiayi Eris; Jacobson, Alec; Alexa, Marc; Mitra, Niloy and Viola, IvanAcross computer graphics, vision, robotics and simulation, many applications rely on determining the 3D rotation that aligns two objects or sets of points. The standard solution is to use singular value decomposition (SVD), where the optimal rotation is recovered as the product of the singular vectors. Faster computation of only the rotation is possible using suitable parameterizations of the rotations and iterative optimization. We propose such a method based on the Cayley transformations. The resulting optimization problem allows better local quadratic approximation compared to the Taylor approximation of the exponential map. This results in both faster convergence as well as more stable approximation compared to other iterative approaches. It also maps well to AVX vectorization. We compare our implementation with a wide range of alternatives on real and synthetic data. The results demonstrate up to two orders of magnitude of speedup compared to a straightforward SVD implementation and a 1.5-6 times speedup over popular optimized code.Item Quad Layouts via Constrained T-Mesh Quantization(The Eurographics Association and John Wiley & Sons Ltd., 2021) Lyon, Max; Campen, Marcel; Kobbelt, Leif; Mitra, Niloy and Viola, IvanWe present a robust and fast method for the creation of conforming quad layouts on surfaces. Our algorithm is based on the quantization of a T-mesh, i.e. an assignment of integer lengths to the sides of a non-conforming rectangular partition of the surface. This representation has the benefit of being able to encode an infinite number of layout connectivity options in a finite manner, which guarantees that a valid layout can always be found. We carefully construct the T-mesh from a given seamless parametrization such that the algorithm can provide guarantees on the results' quality. In particular, the user can specify a bound on the angular deviation of layout edges from prescribed directions. We solve an integer linear program (ILP) to find a coarse quad layout adhering to that maximal deviation. Our algorithm is guaranteed to yield a conforming quad layout free of T-junctions together with bounded angle distortion. Our results show that the presented method is fast, reliable, and achieves high quality layouts.Item Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets(The Eurographics Association, 2021) Scheibel, Willy; Weyand, Christopher; Bethge, Joseph; Döllner, Jürgen; Agus, Marco and Garth, Christoph and Kerren, AndreasHilbert and Moore treemaps are based on the same named space-filling curves to lay out tree-structured data for visualization. One main component of them is a partitioning subroutine, whose algorithmic complexity poses problems when scaling to industry-sized datasets. Further, the subroutine allows for different optimization criteria that result in different layout decisions. This paper proposes conceptual and algorithmic improvements to this partitioning subroutine. Two measures for the quality of partitioning are proposed, resulting in the min-max and min-variance optimization tasks. For both tasks, linear-time algorithms are presented that find an optimal solution. The implementation variants are evaluated with respect to layout metrics and run-time performance against a previously available greedy approach. The results show significantly improved run time and no deterioration in layout metrics, suggesting effective use of Hilbert and Moore treemaps for datasets with millions of nodes.Item A context-aware immersive interface for teleoperation of mobile robots(The Eurographics Association, 2020) Quintas, João; Almeida, Luís; Sousa, Elísio; Menezes, Paulo; Dias, Paulo and Menezes, PauloIn this paper we present a context-aware immersive teleoperation interface to assist operators during navigation tasks. This new interface strategy aims to address the problems associated with mental overload, often experienced by operators of teleoperated devices. Our approach simplifies the high complexity of information displayed in control rooms. Our approach includes a context-based human-robot interaction framework that detects relevant information and automatically adapts the displayed interface in virtual windshield. Results showed that the proposed approach enhances user immersion while maximizes task performances and minimizes the operator physical and cognitive workload.Item Stable and Efficient Differential Estimators on Oriented Point Clouds(The Eurographics Association and John Wiley & Sons Ltd., 2021) Lejemble, Thibault; Coeurjolly, David; Barthe, Loïc; Mellado, Nicolas; Digne, Julie and Crane, KeenanPoint clouds are now ubiquitous in computer graphics and computer vision. Differential properties of the point-sampled surface, such as principal curvatures, are important to estimate in order to locally characterize the scanned shape. To approximate the surface from unstructured points equipped with normal vectors, we rely on the Algebraic Point Set Surfaces (APSS) [GG07] for which we provide convergence and stability proofs for the mean curvature estimator. Using an integral invariant viewpoint, this first contribution links the algebraic sphere regression involved in the APSS algorithm to several surface derivatives of different orders. As a second contribution, we propose an analytic method to compute the shape operator and its principal curvatures from the fitted algebraic sphere. We compare our method to the state-of-the-art with several convergence and robustness tests performed on a synthetic sampled surface. Experiments show that our curvature estimations are more accurate and stable while being faster to compute compared to previous methods. Our differential estimators are easy to implement with little memory footprint and only require a unique range neighbors query per estimation. Its highly parallelizable nature makes it appropriate for processing large acquired data, as we show in several real-world experiments.Item Virtual Dance Museum: the Case of Greek/Cypriot Folk Dancing(The Eurographics Association, 2021) Aristidou, Andreas; Andreou, Nefeli; Charalambous, Loukas; Yiannakidis, Anastasios; Chrysanthou, Yiorgos; Hulusic, Vedad and Chalmers, AlanIn this paper, we have designed and developed a virtual dance museum to provide the technological tools that allow for widely educating the public, most specifically the youngest generations, about the story, costumes, music, and history of our dances. The holistic documentation of our intangible cultural heritage creations is a critical necessity for the preservation and the continuity of our identity as Europeans. In that direction, we have employed a specially designed relational database schema that holistically structures the information within the database, and is ideal for archiving, presenting, further analyzing, and re-using dance motion data. Data have been retargeted to a virtual character, dressed with traditional uniform and simulated to achieve realism. The users can view and interact with the archived data using advanced 3D character visualization in three ways: via an online 3D virtual environment; in virtual reality using headset; and in augmented reality, where the 3D characters can co-inhabit the real world. Our museum is publicly accessible, and also enables motion data reusability, facilitating dance learning applications through gamification.Item UnityPIC: Unity Point-Cloud Interactive Core(The Eurographics Association, 2021) Wu, Yaocheng; Vo, Huy; Gong, Jie; Zhu, Zhigang; Larsen, Matthew and Sadlo, FilipIn this work, we present Unity Point-Cloud Interactive Core, a novel interactive point cloud rendering pipeline for the Unity Development Platform. The goal of the proposed pipeline is to expedite the development process for point cloud applications by encapsulating the rendering process as a standalone component, while maintaining flexibility through an implementable interface. The proposed pipeline allows for rendering arbitrarily large point clouds with improved performance and visual quality. First, a novel dynamic batching scheme is proposed to address the adaptive point sizing problem for level-of-detail (LOD) point cloud structures. Then, an approximate rendering algorithm is proposed to reduce overdraw by minimizing the overall number of fragment operations through an intermediate occlusion culling pass. For the purpose of analysis, the visual quality of renderings is quantified and measured by comparing against a high-quality baseline. In the experiments, the proposed pipeline maintains above 90 FPS for a 20 million point budget while achieving greater than 90% visual quality during interaction when rendering a point-cloud with more than 20 billion points.Item Structure and Empathy in Visual Data Storytelling: Evaluating their Influence on Attitude(The Eurographics Association and John Wiley & Sons Ltd., 2020) Liem, Johannes; Perin, Charles; Wood, Jo; Viola, Ivan and Gleicher, Michael and Landesberger von Antburg, TatianaIn the visualization community, it is often assumed that visual data storytelling increases memorability and engagement, making it more effective at communicating information. However, many assumptions about the efficacy of storytelling in visualization lack empirical evaluation. Contributing to an emerging body of work, we study whether selected techniques commonly used in visual data storytelling influence people's attitudes towards immigration. We compare (a) personal visual narratives designed to generate empathy; (b) structured visual narratives of aggregates of people; and (c) an exploratory visualization without narrative acting as a control condition. We conducted two crowdsourced between-subject studies comparing the three conditions, each with 300 participants. To assess the differences in attitudes between conditions, we adopted established scales from the social sciences used in the European Social Survey (ESS). Although we found some differences between conditions, the effects on people's attitudes are smaller than we expected. Our findings suggest that we need to be more careful when it comes to our expectations about the effects visual data storytelling can have on attitudes.Item From Noon to Sunset: Interactive Rendering, Relighting, and Recolouring of Landscape Photographs by Modifying Solar Position(© 2021 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd, 2021) Türe, Murat; Çıklabakkal, Mustafa Ege; Erdem, Aykut; Erdem, Erkut; Satılmış, Pinar; Akyüz, Ahmet Oguz; Benes, Bedrich and Hauser, HelwigImage editing is a commonly studied problem in computer graphics. Despite the presence of many advanced editing tools, there is no satisfactory solution to controllably update the position of the sun using a single image. This problem is made complicated by the presence of clouds, complex landscapes, and the atmospheric effects that must be accounted for. In this paper, we tackle this problem starting with only a single photograph. With the user clicking on the initial position of the sun, our algorithm performs several estimation and segmentation processes for finding the horizon, scene depth, clouds, and the sky line. After this initial process, the user can make both fine‐ and large‐scale changes on the position of the sun: it can be set beneath the mountains or moved behind the clouds practically turning a midday photograph into a sunset (or vice versa). We leverage a precomputed atmospheric scattering algorithm to make all of these changes not only realistic but also in real‐time. We demonstrate our results using both clear and cloudy skies, showing how to add, remove, and relight clouds, all the while allowing for advanced effects such as scattering, shadows, light shafts, and lens flares.