Browsing by Author "Chen, Guoning"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Curve Complexity Heuristic KD-trees for Neighborhood-based Exploration of 3D Curves
    (The Eurographics Association and John Wiley & Sons Ltd., 2021) Lu, Yucheng; Cheng, Luyu; Isenberg, Tobias; Fu, Chi-Wing; Chen, Guoning; Liu, Hui; Deussen, Oliver; Wang, Yunhai; Mitra, Niloy and Viola, Ivan
    We introduce the curve complexity heuristic (CCH), a KD-tree construction strategy for 3D curves, which enables interactive exploration of neighborhoods in dense and large line datasets. It can be applied to searches of k-nearest curves (KNC) as well as radius-nearest curves (RNC). The CCH KD-tree construction consists of two steps: (i) 3D curve decomposition that takes into account curve complexity and (ii) KD-tree construction, which involves a novel splitting and early termination strategy. The obtained KD-tree allows us to improve the speed of existing neighborhood search approaches by at least an order of magnitude (i. e., 28× for KNC and 12× for RNC with 98% accuracy) by considering local curve complexity. We validate this performance with a quantitative evaluation of the quality of search results and computation time. Also, we demonstrate the usefulness of our approach for supporting various applications such as interactive line queries, line opacity optimization, and line abstraction.
  • No Thumbnail Available
    Item
    Hexahedral Meshing With Varying Element Sizes
    (© 2017 The Eurographics Association and John Wiley & Sons Ltd., 2017) Xu, Kaoji; Gao, Xifeng; Deng, Zhigang; Chen, Guoning; Chen, Min and Zhang, Hao (Richard)
    Hexahedral (or Hex‐) meshes are preferred in a number of scientific and engineering simulations and analyses due to their desired numerical properties. Recent state‐of‐the‐art techniques can generate high‐quality hex‐meshes. However, they typically produce hex‐meshes with uniform element sizes and thus may fail to preserve small‐scale features on the boundary surface. In this work, we present a new framework that enables users to generate hex‐meshes with varying element sizes so that small features will be filled with smaller and denser elements, while the transition from smaller elements to larger ones is smooth, compared to the octree‐based approach. This is achieved by first detecting regions of interest (ROIs) of small‐scale features. These ROIs are then magnified using the as‐rigid‐as‐possible deformation with either an automatically determined or a user‐specified scale factor. A hex‐mesh is then generated from the deformed mesh using existing approaches that produce hex‐meshes with uniform‐sized elements. This initial hex‐mesh is then mapped back to the original volume before magnification to adjust the element sizes in those ROIs. We have applied this framework to a variety of man‐made and natural models to demonstrate its effectiveness.Hexahedral (or Hex‐) meshes are preferred in a number of scientific and engineering simulations and analyses due to their desired numerical properties. Recent state‐of‐the‐art techniques can generate high‐quality hex‐meshes. However, they typically produce hex‐meshes with uniform element sizes and thus may fail to preserve small‐scale features on the boundary surface. In this work, we present a new framework that enables users to generate hex‐meshes with varying element sizes so that small features will be filled with smaller and denser elements, while the transition from smaller elements to larger ones is smooth, compared to the octree‐based approach.
  • Thumbnail Image
    Item
    Physics‐based Pathline Clustering and Exploration
    (© 2021 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd, 2021) Nguyen, Duong B.; Zhang, Lei; Laramee, Robert S.; Thompson, David; Monico, Rodolfo Ostilla; Chen, Guoning; Benes, Bedrich and Hauser, Helwig
    Most existing unsteady flow visualization techniques concentrate on the depiction of geometric patterns in flow, assuming the geometry information provides sufficient representation of the underlying physical characteristics, which is not always the case. To address this challenge, this work proposes to analyse the time‐dependent characteristics of the physical attributes measured along pathlines which can be represented as a series of time activity curves (TAC). We demonstrate that the temporal trends of these TACs can convey the relation between pathlines and certain well‐known flow features (e.g. vortices and shearing layers), which enables us to select pathlines that can effectively represent the physical characteristics of interest and their temporal behaviour in the unsteady flow. Inspired by this observation, a new TAC‐based unsteady flow visualization and analysis framework is proposed. The centre of this framework is a new similarity measure that compares the similarity of two TACs, from which a new spatio‐temporal, hierarchical clustering that classifies pathlines based on their physical attributes, and a TAC‐based pathline exploration and selection strategy are proposed. A visual analytic system incorporating the TAC‐based pathline clustering and exploration is developed, which also provides new visualizations to support the user exploration of unsteady flow using TACs. This visual analytic system is applied to a number of unsteady flow in 2D and 3D to demonstrate its utility. The new system successfully reveals the detailed structure of vortices, the relation between shear layer and vortex formation, and vortex breakdown, which are difficult to convey with conventional methods.