SurfaceNets is a powerful visualization technique typically used to contour non-continuous, discrete, volumetric scalar fields such as segmentation label maps. Label maps are ubiquitous to medical computing, biological studies, and materials characterization, used in applications ranging from anatomical atlas creation to nanotechnology analysis. Due to the uniform spacing of volume data, however, representing data with highly variable resolution is challenging. Consequently we have developed a generalized high-performance, parallel SurfaceNets algorithm that processes unorganized, labeled point clouds. Based on a scalable, meshless Voronoi approach, the algorithm independently processes each Voronoi hull in parallel using a hierarchical neighborhood point search metric. By employing novel topological constructs, the resulting meshless tessellation can be readily transformed into a connected conformal mesh, from which multiple, valid contour surfaces can be simultaneously extracted and smoothed. Additional contributions include a general API for locating points proximal to Voronoi hulls; the definition of topological coordinates used to detect and eliminate numerical degeneracies, merge coincident points, rapidly produce the dual Delaunay triangulation, and build smoothing stencils; and the construction of a Voronoi adjacency graph along with associated necessary conditions to ensure the generation of valid tessellations. Characterization of parallel performance is also quantified, including producing Voronoi and Delaunay tessellations of 128 million hulls and more than 750 million tetrahedra. A software implementation is available from the open source the Visualization Toolkit (VTK) system at vtk.org.

Unstructured volumetric meshes serve as fundamental data representations in various scientific simulations and analyses. They play a crucial role in representing complex computational domains and are essential for important numerical techniques, such as finite element analysis. Whenever such a mesh is read from a file, streamed in-situ, or generated by algorithms, scientific visualization libraries rely on calculating the external surface of a geometry, named "external facelist", to produce a polygonal mesh for rendering. Consequently, external facelist calculation has become one of the most widely used algorithms in the scientific visualization domain, necessitating optimal performance. In this paper, we explore relevant work on external facelist calculation algorithms in two common visualization libraries, VTK and Viskores, assess their performance and memory constraints, and introduce a novel memory-aware external facelist calculation algorithm employing an atomic hash counting approach. This algorithm fully leverages Viskores' data-parallel primitive operations, facilitating its execution across diverse many-core architectures. Our algorithm features the lowest memory footprint on the GPU and the second-lowest on the CPU among all evaluated methods, and it also delivers the fastest performance on both CPU and GPU. It has been made available under an open-source license in the VTK and Viskores visualization systems.

Augmented reality (AR) offers promising opportunities to support movement-based activities, such as personal training or physical therapy, with real-time, spatially-situated visual cues. While many approaches leverage AR to guide motion, existing design guidelines focus on simple, upper-body movements within the user's field of view. We lack evidence-based design recommendations for guiding more diverse scenarios involving movements with varying levels of visibility and direction. We conducted an experiment to investigate how different visual encodings and perspectives affect motion guidance performance and usability, using three exercises that varied in visibility and planes of motion. Our findings reveal significant differences in preference and performance across designs. Notably, the best perspective varied depending on motion visibility and showing more information about the overall motion did not necessarily improve motion execution. We provide empirically-grounded guidelines for designing immersive, interactive visualizations for motion guidance to support more effective AR systems.

Steerable needles are minimally invasive devices that enable novel medical procedures by following curved paths to avoid critical anatomical obstacles. We introduce a new start pose robustness metric for steerable needle motion plans. A steerable needle deployment typically consists of a physician manually placing a steerable needle at a precomputed start pose on the surface of tissue and handing off control to a robot, which then autonomously steers the needle through the tissue to the target. The handoff between humans and robots is critical for procedure success, as even small deviations from a planned start pose change the steerable needle's reachable workspace. Our metric is based on a novel geometric method to efficiently compute how far the physician can deviate from the planned start pose in both position and orientation such that the steerable needle can still reach the target. We evaluate our metric through simulation in liver and lung scenarios. Our evaluation shows that our metric can be applied to plans computed by different steerable needle motion planners and that it can be used to efficiently select plans with large safe start regions.