Conferences and Journals


March 31 – IEEE VAST/InfoVis/SciVis

April (odd numbered years) – TopoInVis

Late September – IEEE Pacific Visualization

Early December – EG EuroVis

Rolling – IEEE Transactions on Visualization and Computer Graphics (TVCG)

IEEE Vis paper list since 1990 and acceptance rates



January – SIGRRAPH

February – Computer Graphics International

Virtual Reality Software and Technology (VRST)


March – Shape Modeling International (SMI)

July – ACM-SIAM Symposium on Discrete Algorithms (SODA)

August – Symposium on Simplicity in Algorithms (SOSA)

December – Symposium on Computational Geometry (SoCG)

Computer Aided Design

January – CAD Conference and Exhibition

Rolling – Computer Aided Design and Applications

A hybrid solution to parallel calculation of augmented join trees of scalar fields in any dimension

Scalar fields are used to describe a variety of data from photographs, to laser scans, to x-ray, CT or MRI scans of machine parts and are invaluable for a variety of tasks, such as fatigue detection in parts. Analyzing scalar fields can be quite challenging due to their size, complexity, and the need to understand both local and global details in context. Join trees are a data structure used to capture the geometric properties of scalar fields, including local minima, local maxima, and saddle points. Unfortunately, computing these trees is expensive, and their incremental construction makes parallel computation nontrivial. We introduce an approach that combines three strategies, pruning, spatial-domain parallelization, and value-domain parallelization, to parallelize join tree construction using OpenCL. The resulting implementation shows a significant speedup, making computation of trees on large data practical on even modest commodity hardware.

A hybrid solution to parallel calculation of augmented join trees of scalar fields in any dimension
P Rosen, J Tu, LA Piegl
Computer-Aided Design and Applications 15 (4), 610-618