We present a new visualization approach based on procedural grid generation for scattered data sets. Instead of pre-computing triangulations for a given set of levels in a data hierarchy, a triangulation within a specified region of interest (ROI) is computed by considering scattered data of a pre-computed scattered data hierarchy. By choosing an appropriate level in the hierarchy the number of samples representing the data set in the ROI can be kept sufficiently small to interactively generate a triangulation and a visualization of the data within the ROI. This allows one to generate the triangulation on-the-fly during the visualization process
We present a highly efficient, automatice method for the generation of hierarhical surface triangula...
Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. H...
This dissertation focuses on the processing, manipulation and rendering of complex data structures i...
From state-of-the-art visualization algorithms, we distill six working principles which are, by hypo...
In this chapter, visualization is used to evaluate the performance of global-scale computational alg...
In many applications one is concerned with the approximation of functions from a finite set of given...
Scattered data collected at sample points may be used to determine simple functions to best fit the ...
Hierarchies of plane graphs, called graph pyramids, can be used for collecting, storing, and analyzi...
SUMMARY: A generic visualization framework should allow for the specification of arbitrary visualiza...
Context. Triangulated irregular network (TIN) can produce terrain meshes with a reduced triangle cou...
We present a new approach for managing the multiresolution representation of discrete topographic su...
High-dimensional data is challenging to visualize. To gain some insight in the field, there has been...
n this thesis the triangulation is treated as a general-purpose visual representation by investigati...
This paper outlines a simple and fast method for conversion of unstructured triangulations to connec...
We are beginning to see an overload in the amount of information packed into a given visualization. ...
We present a highly efficient, automatice method for the generation of hierarhical surface triangula...
Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. H...
This dissertation focuses on the processing, manipulation and rendering of complex data structures i...
From state-of-the-art visualization algorithms, we distill six working principles which are, by hypo...
In this chapter, visualization is used to evaluate the performance of global-scale computational alg...
In many applications one is concerned with the approximation of functions from a finite set of given...
Scattered data collected at sample points may be used to determine simple functions to best fit the ...
Hierarchies of plane graphs, called graph pyramids, can be used for collecting, storing, and analyzi...
SUMMARY: A generic visualization framework should allow for the specification of arbitrary visualiza...
Context. Triangulated irregular network (TIN) can produce terrain meshes with a reduced triangle cou...
We present a new approach for managing the multiresolution representation of discrete topographic su...
High-dimensional data is challenging to visualize. To gain some insight in the field, there has been...
n this thesis the triangulation is treated as a general-purpose visual representation by investigati...
This paper outlines a simple and fast method for conversion of unstructured triangulations to connec...
We are beginning to see an overload in the amount of information packed into a given visualization. ...
We present a highly efficient, automatice method for the generation of hierarhical surface triangula...
Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. H...
This dissertation focuses on the processing, manipulation and rendering of complex data structures i...