We describe a method for computing an implicit function that represents a surface by its zero level set, given a set of points scattered over the surface and associated with surface normal vectors. This implicit funct...
详细信息
We describe a method for computing an implicit function that represents a surface by its zero level set, given a set of points scattered over the surface and associated with surface normal vectors. This implicit function is defined as a linear combination of compactly supported radial basis functions. Our method is suitable for testing whether a given point is interior or exterior to the surface, previously only associated with globally supported or globally regularized radial basis functions. We use a two-level interpolation approach. In the coarse scale interpolation, we set basis function centers by a grid that covers the enlarged bounding box of the given point set and compute their signed distances to the underlying surface using local quadratic approximations of the nearest surface points. Then a fitting to the residual errors on the surface points and additional off-surface points is performed with fine scale basis functions. The final function is the sum of the two intermediate functions and is a good approximation of the signed distance field to the surface in the bounding box. Examples of surface reconstruction and set operations between shapes are provided.
An ideal triangle mesh compression technology would simultaneously support the following objectives: (1) progressive refinements of the received mesh during decompression, (2) nearly optimal compression ratios for bot...
详细信息
An ideal triangle mesh compression technology would simultaneously support the following objectives: (1) progressive refinements of the received mesh during decompression, (2) nearly optimal compression ratios for both geometry and connectivity, and (3) in-line, real-time decompression algorithms for hardware or software implementations. Because these three objectives impose contradictory constraints, previously reported efforts have focused primarily on one (sometimes two) of these objectives. The SQUEEZE technique introduced in this paper addresses all three constraints simultaneously, and attempts to provide the best possible compromise. For a mesh of T triangles, SQUEEZE compresses the connectivity to 3.7T bits, which is competitive with the best progressive compression techniques reported so far. The geometric prediction error encoding technique introduced in this paper leads to a geometry compression that is improved by 20% over that of previous schemes. Our initial implementation on a 300-MHz CPU achieved a decompression rate of up to 46,000 triangles per second. SQUEEZE downloads a model through a number of successive refinement stages, providing the benefit of progressivity.
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed for situations where visual informatio...
详细信息
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed for situations where visual information such as images is also present at each node and must be displayed. This paper presents MoireGraphs to address this need. MoireGraphs combine a new focus+context radial graph layout with a suite of interaction techniques (focus strength changing, radial rotation, level highlighting, secondary foci, animated transitions and node information) to assist in the exploration of graphs with visual nodes. The method is scalable to hundreds of displayed visual nodes.
作者:
Skala, VaclavThe University of West Bohemia
Faculty of Applied Sciences Department .of Computer Science and Engineering Center of Computer Graphics and Visualization Univerzitni 8 PlzenCZ 30614 Czech Republic
Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational compl...
详细信息
The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linea...
详细信息
We introduce a continuous global optimization method to the field of surface reconstruction from discrete noisy cloud of points with weak information on orientation. The proposed method uses an energy functional combi...
详细信息
High-resolution image collections pose unique challenges to analysts tasked with managing the associated data assets and deriving new information from them. While significant progress has been made towards rapid autom...
详细信息
High-resolution image collections pose unique challenges to analysts tasked with managing the associated data assets and deriving new information from them. While significant progress has been made towards rapid automated filtering, alignment, segmentation, characterization, and feature identification from image collections, the extraction of new insights still strongly depends on human intervention. In real-time capture and immediate-mode analysis environments where image data has to be continuously and interactively processed, a broad set of challenges in the image-driven verification and analysis cycle have to be addressed. A framework for interactive and intuitive inspection of large, high-resolution image data sets is presented, leveraging the strength of the human visual system for large-scale image processing. A case study is provided for an X-ray radiography system, covering the scanner-to-screen data management and representation pipeline, resulting in a visual analytics environment enabling analytical reasoning by means of interactive and intuitive visualization.
Volume up scaling enlarges the size of a volume to make feature analysis more accurate and efficient. Linear interpolation, widely used in volume up scaling, result in jagged artifacts around features and losses of hi...
详细信息
Volume up scaling enlarges the size of a volume to make feature analysis more accurate and efficient. Linear interpolation, widely used in volume up scaling, result in jagged artifacts around features and losses of high-frequency components. Based on the example-based up scaling framework, this paper presents a new high-quality volume up scaling technique, predicting the high-frequency components by searching for the best matched patch in the input volume. As each slice can be taken as an image, the existing image up scaling technique based on the local self-similarity assumption can be directly applied to achieve slice up scaling. We further validate that the local self-similarity assumption is still valid for 3D volumes, and we extend this technique to 3D volume up scaling, i.e., isotropic volume up scaling. We compare our volume up scaling technique with traditional linear and cubic spline interpolations, and demonstrate that our method can generate a higher quality volume with better shape and details preserved. The proposed volume up scaling technique is well suitable for legacy low-resolution volumes to improve their visual qualities in visualization and analysis.
visualization of particle traces provides intuitive and efficient means for the exploration and analysis of complex vector fields. The paper presents a method suitable for the real-time visualization of arbitrarily la...
详细信息
ISBN:
(纸本)0780372239
visualization of particle traces provides intuitive and efficient means for the exploration and analysis of complex vector fields. The paper presents a method suitable for the real-time visualization of arbitrarily large time-varying vector fields in virtual environments. We describe an out-of-core scheme in which two distinct pre-processing and rendering components enable real-time data streaming and visualization. The presented approach yields low-latency application start-up times and small memory footprints. The described system was used to implement a "volumetric fog lance," which can emit up to 60000 particles into a flow field while maintaining an interactive frame rate of 60 frames per second. All algorithms were specifically designed to support commodity hardware. The proof-of-concept system is running on a low-cost Linux workstation equipped with a 120 GB E-IDE RAID (redundant array of inexpensive disk) system.
暂无评论