An adaptive graph for volumetric mesh visualization

  • Robaina D
  • Kischinhevsky M
  • Gonzaga De Oliveira S
 et al. 
  • 3


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


This work presents an adaptive strategy in order to visualize volumetric data generated from numerical simulations of partial differential equations. The mesh is represented by a graph data structure. Moreover, the Autonomous Leaves Graph is extended to the three-dimensional case. This scheme intends to achieve better transversal cost than a tree-like (e.g., bintree, quadtree and octree) space arrangement approach. Furthermore, this strategy intends to reduce the computational cost of constructing the discretization and the visualization of data. The total-ordering of the mesh volumes used in the discretization and the visualization processes is by the 3D Modified Hilbert space-filling Curve. To evaluate the performance, the strategy is applied on a Heat Conduction simulation problem using finite difference discretizations and the experimental results are discussed. Comparisons are made between numerical results obtained when using the Hilbert Curve and its modified version. In addition, experiments are shown when visualization is made from inside and outside the volume. The results expose the efficiency of using this strategy.

Author-supplied keywords

  • Adaptive mesh refinement
  • Autonomous leaves graph
  • Heat conduction simulation
  • Space-filling curve
  • Volumetric visualization

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Diogo T. Robaina

  • Mauricio Kischinhevsky

  • Sanderson L. Gonzaga De Oliveira

  • Diego N. Brandão

  • Esteban Clua

  • Anselmo Montenegro

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free