Abstract. This paper presents a novel way of identifying and illustrating the accuracy in the par... more Abstract. This paper presents a novel way of identifying and illustrating the accuracy in the particle tracing method for flow visualization. We make use of explicit Runge-Kutta methods for particle tracing in steady velocity fields, and describe three approaches to estimate the ...
Contouring remains a major application of computer graphics.Contours are typically modelled, firs... more Contouring remains a major application of computer graphics.Contours are typically modelled, first as conic sections, and then asstraight-line approximations to the conics. In this paper, it is shownhow the accuracy of this straight-line approximation can be indicated.In addition, a refinement is proposed that yields a better straight-lineapproximation without major cost overhead.1 IntroductionAccuracy in data visualization is often a neglected issue.
This chapter describes ways in which contouring and isosurfacing techniques for 3D computer graph... more This chapter describes ways in which contouring and isosurfacing techniques for 3D computer graphics have evolved. In particular, we show how they are strongly intertwined and how they have moved from being non-interactive to interactive processes, making them appropriate for the kinds of dynamic representation required for geovisualization. The analysis relies upon data defined on a regular, rectilinear grid, and a bilinear or trilinear data model within each 2D or 3D cell. Exploring Geovisualization J. Dykes, A.M. MacEachren, M.-J. Kraak (Editors) q
IEEE Transactions on Visualization and Computer Graphics, 2003
In this paper we present an algorithm that accelerates 3D texturebased volume rendering of large ... more In this paper we present an algorithm that accelerates 3D texturebased volume rendering of large and sparse data sets. A hierarchical data structure (known as AMR tree) consisting of nested uniform grids is employed in order to efficiently encode regions of interest. The hierarchies resulting from this kind of space partitioning yield a good balance between the amount of volume to render and the number of texture bricks -a prerequisite for fast rendering.
Abstract. This paper presents a novel way of identifying and illustrating the accuracy in the par... more Abstract. This paper presents a novel way of identifying and illustrating the accuracy in the particle tracing method for flow visualization. We make use of explicit Runge-Kutta methods for particle tracing in steady velocity fields, and describe three approaches to estimate the ...
Contouring remains a major application of computer graphics.Contours are typically modelled, firs... more Contouring remains a major application of computer graphics.Contours are typically modelled, first as conic sections, and then asstraight-line approximations to the conics. In this paper, it is shownhow the accuracy of this straight-line approximation can be indicated.In addition, a refinement is proposed that yields a better straight-lineapproximation without major cost overhead.1 IntroductionAccuracy in data visualization is often a neglected issue.
This chapter describes ways in which contouring and isosurfacing techniques for 3D computer graph... more This chapter describes ways in which contouring and isosurfacing techniques for 3D computer graphics have evolved. In particular, we show how they are strongly intertwined and how they have moved from being non-interactive to interactive processes, making them appropriate for the kinds of dynamic representation required for geovisualization. The analysis relies upon data defined on a regular, rectilinear grid, and a bilinear or trilinear data model within each 2D or 3D cell. Exploring Geovisualization J. Dykes, A.M. MacEachren, M.-J. Kraak (Editors) q
IEEE Transactions on Visualization and Computer Graphics, 2003
In this paper we present an algorithm that accelerates 3D texturebased volume rendering of large ... more In this paper we present an algorithm that accelerates 3D texturebased volume rendering of large and sparse data sets. A hierarchical data structure (known as AMR tree) consisting of nested uniform grids is employed in order to efficiently encode regions of interest. The hierarchies resulting from this kind of space partitioning yield a good balance between the amount of volume to render and the number of texture bricks -a prerequisite for fast rendering.
Uploads
Papers by Adriano Lopes