Fast and Exact Fiber Surfaces for Tetrahedral Meshes

Isosurfaces are fundamental geometrical objects for the analysis and visualization of volumetric scalar fields. Recent work has generalized them to bivariate volumetric fields with fiber surfaces, the pre-image of polygons in range space. However, the existing algorithm for their computation is approximate, and is limited to closed polygons. Moreover, its runtime performance does not allow instantaneous updates of the fiber surfaces upon user edits of the polygons. Overall, these limitations prevent a reliable and interactive exploration of the space of fiber surfaces. This paper introduces the first algorithm for the exact computation of fiber surfaces in tetrahedral meshes. It assumes no restriction on the topology of the input polygon, handles degenerate cases and better captures sharp features induced by polygon bends. The algorithm also allows visualization of individual fibers on the output surface, better illustrating their relationship with data features in range space. To enable truly interactive exploration sessions, we further improve the runtime performance of this algorithm. In particular, we show that it is trivially parallelizable and that it scales nearly linearly with the number of cores. Further, we study acceleration data-structures both in geometrical domain and range space and we show how to generalize interval trees used in isosurface extraction to fiber surface extraction. Experiments demonstrate the superiority of our algorithm over previous work, both in terms of accuracy and running time, with up to two orders of magnitude speedups. This improvement enables interactive edits of range polygons with instantaneous updates of the fiber surface for exploration purpose. A VTK-based reference implementation is provided as additional material to reproduce our results.

[1]  Dirk J. Lehmann,et al.  Discontinuities in Continuous Scatterplots , 2010 .

[2]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[3]  Julia Contreras-García,et al.  Revealing noncovalent interactions. , 2010, Journal of the American Chemical Society.

[4]  Roger Crawfis,et al.  Isosurface construction in any dimension using convex hulls , 2004, IEEE Transactions on Visualization and Computer Graphics.

[5]  Charles D. Hansen,et al.  Isosurfacing in span space with utmost efficiency (ISSUE) , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[6]  Jack Snoeyink,et al.  Artifacts caused by simplicial subdivision , 2006, IEEE Transactions on Visualization and Computer Graphics.

[7]  James T. Kajiya,et al.  Ray tracing complex scenes , 1986, SIGGRAPH.

[8]  Paolo Cignoni,et al.  Reconstruction of topologically correct and adaptive trilinear isosurfaces , 2000, Comput. Graph..

[9]  J. Wilhelms,et al.  Octrees for faster isosurface generation , 1992, TOGS.

[10]  Valerio Pascucci,et al.  Topology Verification for Isosurface Extraction , 2012, IEEE Transactions on Visualization and Computer Graphics.

[11]  Daniel Weiskopf,et al.  Continuous Scatterplots , 2008, IEEE Transactions on Visualization and Computer Graphics.

[12]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

[13]  Paolo Cignoni,et al.  Speeding Up Isosurface Extraction Using Interval Trees , 1997, IEEE Trans. Vis. Comput. Graph..

[14]  Osamu Saeki,et al.  Topology of Singular Fibers of Differentiable Maps , 2004, Lecture notes in mathematics.

[15]  Helwig Hauser,et al.  Visualization and Visual Analysis of Multifaceted Scientific Data: A Survey , 2013, IEEE Transactions on Visualization and Computer Graphics.

[16]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[17]  Valerio Pascucci,et al.  Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.

[18]  Robert Michael Kirby,et al.  Verifiable Visualization for Isosurface Extraction , 2009, IEEE Transactions on Visualization and Computer Graphics.

[19]  Dirk J. Lehmann,et al.  Discontinuities in Continuous Scatter Plots , 2010, IEEE Transactions on Visualization and Computer Graphics.

[20]  Jules Bloomenthal,et al.  Polygonization of implicit surfaces , 1988, Comput. Aided Geom. Des..

[21]  Gregory M. Nielson,et al.  On Marching Cubes , 2003, IEEE Trans. Vis. Comput. Graph..

[22]  Paolo Cignoni,et al.  Tetrahedra Based Volume Visualization , 1997, VisMath.

[23]  P. Shirley,et al.  A polygonal approximation to direct scalar volume rendering , 1990, VVS.

[24]  David C. Banks,et al.  Counting cases in marching cubes: toward a generic algorithm for producing substitopes , 2003, IEEE Visualization, 2003. VIS 2003..

[25]  Nelson L. Max Hexahedron Projection for Curvilinear Grids , 2007, J. Graph. Tools.

[26]  Aaron Knoll,et al.  Fiber Surfaces: Generalizing Isosurfaces to Bivariate Data , 2015, Comput. Graph. Forum.

[27]  Hong Yi,et al.  A survey of the marching cubes algorithm , 2006, Comput. Graph..

[28]  Wenping Wang,et al.  Generalized Voronoi Diagram Computation on GPU , 2011, 2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering.

[29]  Anna Vilanova,et al.  Visualization of boundaries in volumetric data sets using LH histograms , 2006, IEEE Transactions on Visualization and Computer Graphics.

[30]  David J. Duke,et al.  Joint Contour Nets , 2014, IEEE Transactions on Visualization and Computer Graphics.

[31]  Kwan-Liu Ma,et al.  RGVis: region growing based techniques for volume visualization , 2003, 11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings..

[32]  B. Natarajan On generating topologically consistent isosurfaces from uniform samples , 1994, The Visual Computer.

[33]  Victoria Interrante,et al.  Conveying the 3D Shape of Smoothly Curving Transparent Surfaces via Texture , 1997, IEEE Trans. Vis. Comput. Graph..

[34]  David C. Banks,et al.  Complex-valued contour meshing , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[35]  Alexander Keller,et al.  Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays , 2008, Comput. Graph. Forum.