We propose a parallel method for computing local Laplacian curvature flows for triangular meshes. Laplace operator is widely used in mesh processing for mesh fairing, noise removal or curvature estimation. If the Laplacian flow is used in global sense constraining a whole mesh with an iterative weighted linear system, it can be used even for mesh contraction. However, numerical solution of such a global linear system is computationally expensive. Therefore, we have developed a method to compute such an iterative linear system using only local neighbourhoods of each vertex in parallel. Parallel computation of local linear systems is performed on GPU using OpenCL. We have evaluated speedups of the parallelization using both local and global Laplacian flows. We show test cases, where the parallel local method can be used for mesh fairing. In contrary, we also investigate and outline a fail case, where the local Laplacian flow cannot be used. When the local Laplacian flow has problems with global convergence, we offer a global parallelization of the linear system solving as an alternative.
{"title":"Parallelization of Mesh Contraction and Fairing using OpenCL","authors":"Martin Madaras, R. Durikovic","doi":"10.1145/2508244.2508250","DOIUrl":"https://doi.org/10.1145/2508244.2508250","url":null,"abstract":"We propose a parallel method for computing local Laplacian curvature flows for triangular meshes. Laplace operator is widely used in mesh processing for mesh fairing, noise removal or curvature estimation. If the Laplacian flow is used in global sense constraining a whole mesh with an iterative weighted linear system, it can be used even for mesh contraction. However, numerical solution of such a global linear system is computationally expensive. Therefore, we have developed a method to compute such an iterative linear system using only local neighbourhoods of each vertex in parallel. Parallel computation of local linear systems is performed on GPU using OpenCL. We have evaluated speedups of the parallelization using both local and global Laplacian flows. We show test cases, where the parallel local method can be used for mesh fairing. In contrary, we also investigate and outline a fail case, where the local Laplacian flow cannot be used. When the local Laplacian flow has problems with global convergence, we offer a global parallelization of the linear system solving as an alternative.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127580655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Amirkhanov, C. Heinzl, Christoph Kuhn, J. Kastner, E. Gröller
Metrology through geometric dimensioning and tolerancing is an important instrument applied for industrial manufacturing and quality control. Typically tactile or optical coordinate measurement machines (CMMs) are used to perform dimensional measurements. In recent years industrial 3D X-ray computed tomography (3DXCT) has been increasingly applied for metrology due to the development of XCT systems with higher accuracy and their ability to capture both internal and external structures of a specimen within one scan. Using 3DXCT the location of the specimen surface is estimated based on the scanned attenuation coefficients. As opposed to tactile or optical measurement techniques, the surface is not explicit and implies a certain positional uncertainty depending on artifacts and noise in the scan data and the used surface extraction algorithm. Moreover, conventional XCT measurement software does not consider uncertainty in the data. In this work we present techniques which account for uncertainty arising in the XCT metrology data flow. Our technique provides the domain experts with uncertainty visualizations, which extend the XCT metrology workflow on different levels. The developed techniques are integrated into a tool utilizing linked views, smart 3D tolerance tagging and plotting functionalities. The presented system is capable of visualizing the uncertainty of measurements on various levels-of-detail. Commonly known geometric tolerance indications are provided as smart tolerance tags. Finally, we incorporate the uncertainty of the data as a context in commonly used measurement plots. The proposed techniques provide an augmented insight into the reliability of geometric tolerances while maintaining the daily workflow of domain specialists, giving the user additional information on the nature of areas with high uncertainty. The presented techniques are evaluated based on domain experts feedback in collaboration with our company partners.
{"title":"Fuzzy CT Metrology: Dimensional Measurements on Uncertain Data","authors":"A. Amirkhanov, C. Heinzl, Christoph Kuhn, J. Kastner, E. Gröller","doi":"10.1145/2508244.2508255","DOIUrl":"https://doi.org/10.1145/2508244.2508255","url":null,"abstract":"Metrology through geometric dimensioning and tolerancing is an important instrument applied for industrial manufacturing and quality control. Typically tactile or optical coordinate measurement machines (CMMs) are used to perform dimensional measurements. In recent years industrial 3D X-ray computed tomography (3DXCT) has been increasingly applied for metrology due to the development of XCT systems with higher accuracy and their ability to capture both internal and external structures of a specimen within one scan. Using 3DXCT the location of the specimen surface is estimated based on the scanned attenuation coefficients. As opposed to tactile or optical measurement techniques, the surface is not explicit and implies a certain positional uncertainty depending on artifacts and noise in the scan data and the used surface extraction algorithm. Moreover, conventional XCT measurement software does not consider uncertainty in the data. In this work we present techniques which account for uncertainty arising in the XCT metrology data flow. Our technique provides the domain experts with uncertainty visualizations, which extend the XCT metrology workflow on different levels. The developed techniques are integrated into a tool utilizing linked views, smart 3D tolerance tagging and plotting functionalities. The presented system is capable of visualizing the uncertainty of measurements on various levels-of-detail. Commonly known geometric tolerance indications are provided as smart tolerance tags. Finally, we incorporate the uncertainty of the data as a context in commonly used measurement plots. The proposed techniques provide an augmented insight into the reliability of geometric tolerances while maintaining the daily workflow of domain specialists, giving the user additional information on the nature of areas with high uncertainty. The presented techniques are evaluated based on domain experts feedback in collaboration with our company partners.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127059843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Martina Bátorová, Miroslava Valíková, P. Chalmovianský
The topology and structure of the ADE singularities in terms of their topological invariants are recalled. A representation of these curves as Riemann surfaces is used to propose a novel technique of visualization of multivalued complex functions. Here, not only the entire domain is displayed, but also the method of domain coloring is extended via utilizing a specific height function. The method is applied in order to show the structure of singularities and to resolve them. A sequence of 1-parameter deformations is used, each causing Milnor number to drop by one up to regularity. The changes in the internal structure are interpreted and the whole process is visualized via computer animation.
{"title":"Desingularization of ADE Singularities via Deformation","authors":"Martina Bátorová, Miroslava Valíková, P. Chalmovianský","doi":"10.1145/2508244.2508249","DOIUrl":"https://doi.org/10.1145/2508244.2508249","url":null,"abstract":"The topology and structure of the ADE singularities in terms of their topological invariants are recalled. A representation of these curves as Riemann surfaces is used to propose a novel technique of visualization of multivalued complex functions. Here, not only the entire domain is displayed, but also the method of domain coloring is extended via utilizing a specific height function. The method is applied in order to show the structure of singularities and to resolve them. A sequence of 1-parameter deformations is used, each causing Milnor number to drop by one up to regularity. The changes in the internal structure are interpreted and the whole process is visualized via computer animation.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131315334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Belma Ramic-Brkic, A. Chalmers, Aida Sadzak, K. Debattista, Saida Sultanic
The cross-modal interaction between vision and other senses is a key part of how we perceive the real world. Significant stimulation to hearing, sense of smell, taste or touch can reduce the cognitive resources the brain is able to allocate to sight, and thus limit what the Human Visual System (HVS) can actually perceive at that moment. Selective rendering is able to exploit such knowledge of the HVS, to render those parts of a virtual environment a viewer is attending to at a high quality and the rest of the scene at a much lower quality, and thus at a substantially reduced rendering time, without the viewer being aware of this quality difference. This paper investigates how the presence of the modalities of sound, smell and ambient temperature in a virtual environment significantly affects a viewer's ability to perceive the quality of the graphics used for that environment. Experiments were run with a total of 356 participants to determine the graphics quality thresholds across the different cross-modal interactions. The results revealed a significant effect of strong perfume, high temperature and audio noise on perceived rendering quality. Under given conditions, this particular combination of modalities can be thus exploited when rendering virtual environments, to substantially reduce rendering time without any loss in the user's perception of delivered visual quality.
{"title":"Exploring multiple modalities for selective rendering of virtual environments","authors":"Belma Ramic-Brkic, A. Chalmers, Aida Sadzak, K. Debattista, Saida Sultanic","doi":"10.1145/2508244.2508256","DOIUrl":"https://doi.org/10.1145/2508244.2508256","url":null,"abstract":"The cross-modal interaction between vision and other senses is a key part of how we perceive the real world. Significant stimulation to hearing, sense of smell, taste or touch can reduce the cognitive resources the brain is able to allocate to sight, and thus limit what the Human Visual System (HVS) can actually perceive at that moment. Selective rendering is able to exploit such knowledge of the HVS, to render those parts of a virtual environment a viewer is attending to at a high quality and the rest of the scene at a much lower quality, and thus at a substantially reduced rendering time, without the viewer being aware of this quality difference. This paper investigates how the presence of the modalities of sound, smell and ambient temperature in a virtual environment significantly affects a viewer's ability to perceive the quality of the graphics used for that environment. Experiments were run with a total of 356 participants to determine the graphics quality thresholds across the different cross-modal interactions. The results revealed a significant effect of strong perfume, high temperature and audio noise on perceived rendering quality. Under given conditions, this particular combination of modalities can be thus exploited when rendering virtual environments, to substantially reduce rendering time without any loss in the user's perception of delivered visual quality.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126027594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We introduce a new parametric approach to noisy three-dimensional data smoothing founded on a special representation of bivariate polynomials that uses reference points. The model in construction has to fulfill the quasi-smooth condition which can be easily ensured by proper allocation and assessment of reference points as well as some additional coefficient constraints. The estimate of approximants is considered for a two-part model. The proposed model offers a reasonable compromise between accuracy and smoothness. We plan to confirm this statement by putting our approach to the test along with a B-spline based one.
{"title":"Smoothing in 3D with reference points and polynomials","authors":"I. Szabó, C. Török","doi":"10.1145/2508244.2508248","DOIUrl":"https://doi.org/10.1145/2508244.2508248","url":null,"abstract":"We introduce a new parametric approach to noisy three-dimensional data smoothing founded on a special representation of bivariate polynomials that uses reference points. The model in construction has to fulfill the quasi-smooth condition which can be easily ensured by proper allocation and assessment of reference points as well as some additional coefficient constraints. The estimate of approximants is considered for a two-part model. The proposed model offers a reasonable compromise between accuracy and smoothness. We plan to confirm this statement by putting our approach to the test along with a B-spline based one.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114254080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kanita Karaduzovic Hadziabdic, Jasminka Hasic Telalovic, Rafał K. Mantiuk
High dynamic range (HDR) images can be generated by capturing a sequence of low dynamic range (LDR) images of the same scene with different exposures and then merging those images to create an HDR image. During capturing of LDR images, any changes in the scene or slightest camera movement results in ghost artifacts in the resultant HDR image. Over the past few years many algorithms have been proposed to produce ghost free HDR images of dynamic scenes. In this study we performed subjective psychophysical experiments to evaluate four algorithms for removing ghost artifacts in the final HDR image. To our best knowledge, no evaluation of deghosting algorithms for HDR imaging has been published. Thus, the aim of this paper is not only to evaluate different ghost removal algorithms but also to introduce a methodology to evaluate such algorithms and to present some of the challenges that exist in evaluating ghost removal algorithms in HDR images. Optical flow algorithms have been shown to produce successful results in aligning input images before merging them into an HDR image. As a result one of the state-of-the-art deghosting algorithm for HDR image alignment is based on optical flow. To test the limits of the evaluated deghosting algorithms the scenes used in our experiments were selected following the criteria proposed by Baker et al. [2011], which is considered as de facto standard for evaluating optical flow methodologies. The scenes used in the experiments serve to provide challenges that need to be dealt with by not only algorithms based on optical flow methodologies but also by other ghost removal algorithms for HDR imaging. The results reveal the scenes for which the evaluated algorithms fail and may serve as a guide for future research in this area.
{"title":"Comparison of Deghosting Algorithms for Multi-exposure High Dynamic Range Imaging","authors":"Kanita Karaduzovic Hadziabdic, Jasminka Hasic Telalovic, Rafał K. Mantiuk","doi":"10.1145/2508244.2508247","DOIUrl":"https://doi.org/10.1145/2508244.2508247","url":null,"abstract":"High dynamic range (HDR) images can be generated by capturing a sequence of low dynamic range (LDR) images of the same scene with different exposures and then merging those images to create an HDR image. During capturing of LDR images, any changes in the scene or slightest camera movement results in ghost artifacts in the resultant HDR image. Over the past few years many algorithms have been proposed to produce ghost free HDR images of dynamic scenes. In this study we performed subjective psychophysical experiments to evaluate four algorithms for removing ghost artifacts in the final HDR image. To our best knowledge, no evaluation of deghosting algorithms for HDR imaging has been published. Thus, the aim of this paper is not only to evaluate different ghost removal algorithms but also to introduce a methodology to evaluate such algorithms and to present some of the challenges that exist in evaluating ghost removal algorithms in HDR images. Optical flow algorithms have been shown to produce successful results in aligning input images before merging them into an HDR image. As a result one of the state-of-the-art deghosting algorithm for HDR image alignment is based on optical flow. To test the limits of the evaluated deghosting algorithms the scenes used in our experiments were selected following the criteria proposed by Baker et al. [2011], which is considered as de facto standard for evaluating optical flow methodologies. The scenes used in the experiments serve to provide challenges that need to be dealt with by not only algorithms based on optical flow methodologies but also by other ghost removal algorithms for HDR imaging. The results reveal the scenes for which the evaluated algorithms fail and may serve as a guide for future research in this area.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127229823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present a case study on how, given some reasonable assumptions, a sky dome model originally developed for terrestrial Predictive Rendering purposes can be re-used to give a scientifically plausible first impression of what outdoor scenes on earth-like exoplanets with a similar atmospheric structure would look like. On this very specific type of exoplanet, humans could reasonably be expected to survive without a space suit, and life-forms very similar to those found on Earth could theoretically evolve. This makes a simulation of typical outdoor lighting on this kind of planet interesting for various scientific (speculative exo-biological simulations) and not so scientific ("realistic" science fiction movie settings) reasons. If the properties of the exoplanet itself are restricted to resemble Earth, the remaining free parameter are the sun(s) which the exoplanet orbits. In the course of our case study, we found that even for fairly different star types, the overall appearance of the sky does not change as much as one might assume at first. Also, even the skies of Earth-like worlds that orbit binary stars would have a fairly normal appearance, although specific oddities can be observed.
{"title":"Predicting Sky Dome Appearance on Earth-like Extrasolar Worlds","authors":"A. Wilkie, Lukas Hosek","doi":"10.1145/2508244.2508263","DOIUrl":"https://doi.org/10.1145/2508244.2508263","url":null,"abstract":"In this paper, we present a case study on how, given some reasonable assumptions, a sky dome model originally developed for terrestrial Predictive Rendering purposes can be re-used to give a scientifically plausible first impression of what outdoor scenes on earth-like exoplanets with a similar atmospheric structure would look like. On this very specific type of exoplanet, humans could reasonably be expected to survive without a space suit, and life-forms very similar to those found on Earth could theoretically evolve. This makes a simulation of typical outdoor lighting on this kind of planet interesting for various scientific (speculative exo-biological simulations) and not so scientific (\"realistic\" science fiction movie settings) reasons.\u0000 If the properties of the exoplanet itself are restricted to resemble Earth, the remaining free parameter are the sun(s) which the exoplanet orbits. In the course of our case study, we found that even for fairly different star types, the overall appearance of the sky does not change as much as one might assume at first. Also, even the skies of Earth-like worlds that orbit binary stars would have a fairly normal appearance, although specific oddities can be observed.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128268272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Since the beginning of the new century an increasing amount of smartphones sold every year causes a strong interest in the interactive mobile guides (travel, museum guides) utilizing the visual recognition of interesting objects. In our paper we focus on a special class of objects -- fine art paintings. We introduce new pipeline of visual recognition employing both local and global image features. In the recognition process we firstly sort the database of Originals, the high quality paintings based on the global feature extracted from the photograph of a painting and then match the local feature descriptors for efficient recognition. Our approach achieves the speed up of the recognition process by minimizing the number local feature comparisons.
{"title":"Combination of Global and Local Features for Efficient Classification of Paintings","authors":"Z. Haladová, E. Sikudová","doi":"10.1145/2508244.2508246","DOIUrl":"https://doi.org/10.1145/2508244.2508246","url":null,"abstract":"Since the beginning of the new century an increasing amount of smartphones sold every year causes a strong interest in the interactive mobile guides (travel, museum guides) utilizing the visual recognition of interesting objects. In our paper we focus on a special class of objects -- fine art paintings. We introduce new pipeline of visual recognition employing both local and global image features. In the recognition process we firstly sort the database of Originals, the high quality paintings based on the global feature extracted from the photograph of a painting and then match the local feature descriptors for efficient recognition. Our approach achieves the speed up of the recognition process by minimizing the number local feature comparisons.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"17 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116774406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Charly Collin, Ke Chen, Ajit Hakke Patil, S. Pattanaik, K. Bouatouch
This paper presents an accurate method to compute the bidirectional reflectance distribution function (BRDF) due to subsurface scattering inside the material of the objects. This computation requires iterating over the different lighting directions, and solving the integro-differential equation of light transport (scattering and absorption). Solving the light transport equation is expensive, and solving it independently for different directions adds even further to the expense. However most of the computations are very similar between directions. We make use of Green's function of the transport problem to have a better separation between computations that are independent of incident directions from those that are dependent. This allows us to avoid as much repetition in the computations as possible, thus gives us a faster BRDF computation method without any loss of accuracy. We validate our method against a standard light transport solver and use it to compute BRDF for a variety of materials.
{"title":"Green's function solution to subsurface light transport for BRDF computation","authors":"Charly Collin, Ke Chen, Ajit Hakke Patil, S. Pattanaik, K. Bouatouch","doi":"10.1145/2508244.2508260","DOIUrl":"https://doi.org/10.1145/2508244.2508260","url":null,"abstract":"This paper presents an accurate method to compute the bidirectional reflectance distribution function (BRDF) due to subsurface scattering inside the material of the objects. This computation requires iterating over the different lighting directions, and solving the integro-differential equation of light transport (scattering and absorption). Solving the light transport equation is expensive, and solving it independently for different directions adds even further to the expense. However most of the computations are very similar between directions. We make use of Green's function of the transport problem to have a better separation between computations that are independent of incident directions from those that are dependent. This allows us to avoid as much repetition in the computations as possible, thus gives us a faster BRDF computation method without any loss of accuracy. We validate our method against a standard light transport solver and use it to compute BRDF for a variety of materials.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114862192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Multiple everyday life situations involve cavity flows. Because of its unstable aspect, this phenomenon represents an issue of the utmost seriousness for physicists. This paper describes the design of a system dedicated to interactive analysis of results of CFD (Computational Fluid Dynamics) simulations. This approach aims at assisting expert users in their analysis in a virtual immersive environment. The proposed solution counts two main steps. In the first one, while moving a 3D cursor, the user explores the space of the simulation in order to locate potential areas of interest. During this exploration, for each position of the cursor, the flowlines starting from the vicinity of this position are rendered in real time. Based on his/her expertise, the user has to decide which areas may present a particular interest for the geometry (morphology) of the flow. Each area selected in the first step is examined in detail in the second step. During this second step a single flowline (detailing the variation of the flow velocity) starting from the position selected by the user is rendered. This step helps at clarifying, analyzing in detail, a characteristic sensed by the intermediate of the first step. Here, instead of an algorithm, the expert user has to decide whether the rendered flowline is relevant or not for the construction of the geometry of the flow. All the flowlines selected by the user are the elements that constitute the geometry of the studied flow.
{"title":"Interactive analysis of cavity-flows in a virtual environment","authors":"B. Ménélas","doi":"10.1145/2448531.2448535","DOIUrl":"https://doi.org/10.1145/2448531.2448535","url":null,"abstract":"Multiple everyday life situations involve cavity flows. Because of its unstable aspect, this phenomenon represents an issue of the utmost seriousness for physicists. This paper describes the design of a system dedicated to interactive analysis of results of CFD (Computational Fluid Dynamics) simulations. This approach aims at assisting expert users in their analysis in a virtual immersive environment. The proposed solution counts two main steps. In the first one, while moving a 3D cursor, the user explores the space of the simulation in order to locate potential areas of interest. During this exploration, for each position of the cursor, the flowlines starting from the vicinity of this position are rendered in real time. Based on his/her expertise, the user has to decide which areas may present a particular interest for the geometry (morphology) of the flow. Each area selected in the first step is examined in detail in the second step. During this second step a single flowline (detailing the variation of the flow velocity) starting from the position selected by the user is rendered. This step helps at clarifying, analyzing in detail, a characteristic sensed by the intermediate of the first step. Here, instead of an algorithm, the expert user has to decide whether the rendered flowline is relevant or not for the construction of the geometry of the flow. All the flowlines selected by the user are the elements that constitute the geometry of the studied flow.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115604954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：