This paper defines mesh saliency in a scale-dependent manner using a center-surround operator on Gaussian-weighted mean curvatures to capture what most would classify as visually interesting regions on a mesh.Expand

This paper defines mesh saliency in a scale-dependent manner using a center-surround operator on Gaussian-weighted mean curvatures to capture what most would classify as visually interesting regions on a mesh.Expand

An algorithm for performing view-dependent simplifications of a triangulated polygonal model in real-time, which is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications where there are a limited number of highly complex objects that stay relatively close to the viewer.Expand

This work presents new and efficient algorithms for constructing triangle strips from partially triangulated models, and experimental results showing these strips are on average 15% better than those from previous codes.Expand

We propose the idea of simplification envelopes for generating a hierarchy of level-of-detail approximations for a given polygonal model. Our approach guarantees that all points of an approximation… Expand

MUMmerGPU is a low cost, ultra-fast sequence alignment program designed to handle the increasing volume of data produced by new, high-throughput sequencing technologies, and demonstrates that even memory-intensive applications can run significantly faster on the relatively low-cost GPU than on the CPU.Expand

A cubic‐spline‐based distance metric is proposed that can be used to unify the geometry and topology simplifications by considering the vertex positions and normals in an integrated manner.Expand

This paper presents a visual-saliency-based operator to enhance selected regions of a volume and shows how such an operator is used on a user-specified saliency field to compute an emphasis field.Expand

This work presents a z-buffered image-space-based rendering technique that allows navigation in complex static environments and correctly simulates the kinetic depth effect (parallax), occlusion, and can resolve the missing visibility information by combining z- buffered environment maps from multiple viewpoints.Expand

A fast kNN algorithm is presented that makes use of the locality of successive points whose k nearest neighbors are sought to reduce significantly the time needed to compute the neighborhood needed for the primitive operation as well as enable it to operate in an environment where the data is on disk.Expand