Our polygons/points method is octree based, uses interval and point sampling of the surface curvature to drive the subdivision, and uses a pruning algorithm to generate points that are rendered where the surface curvature is high, or around non-manifold features. This approach allows us to visualise both manifold and non-manifold implicit surfaces of high complexity. We discuss necessary modifications of the dual grid method to polygonise the surfaces. The main advantage of the dual grid is that cracks do not form between shared plotting node faces that are at different depths. Polygons are formed as a mixture of triangles and quadrilaterals. We also discuss improvements to the grid so that slither triangles do not form. We render a variety...
A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The...
Algorithms of trimming implicit surfaces yielding surface sheets and stripes are presented. These tw...
Both object modeling and visualization belong to the fundamental tasks of the computer graphics. In ...
We discuss the polygonisation and rendering of non-manifold implicit surfaces using adaptive octree ...
We are concerned with producing high quality images of implicit surfaces, in particular those with n...
We use octree spatial subdivision to generate point clouds on complex non-manifold implicit surfaces...
A hybrid polygons-points algorithm based on a hierarchical decomposition of the bounding volume usin...
This thesis addresses several visualisation problems for non-manifold and singular implicit algebra...
We are concerned with producing high quality images of parametric and implicit surfaces, in particul...
We discuss the polygonisation and rendering of implicit surfaces through the adaptive subdivision of...
We discuss the polygonization and rendering of implicit surfaces through the adaptive subdivision of...
We present a method for contouring an implicit function using a grid topologically dual to structure...
grantor: University of TorontoIn order to efficiently render implicit surfaces with a proj...
We present point based rendering techniques that render various types of contours as constant width ...
The article presents algorithms for rendering the intersection curves of implicit surfaces. The algo...
A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The...
Algorithms of trimming implicit surfaces yielding surface sheets and stripes are presented. These tw...
Both object modeling and visualization belong to the fundamental tasks of the computer graphics. In ...
We discuss the polygonisation and rendering of non-manifold implicit surfaces using adaptive octree ...
We are concerned with producing high quality images of implicit surfaces, in particular those with n...
We use octree spatial subdivision to generate point clouds on complex non-manifold implicit surfaces...
A hybrid polygons-points algorithm based on a hierarchical decomposition of the bounding volume usin...
This thesis addresses several visualisation problems for non-manifold and singular implicit algebra...
We are concerned with producing high quality images of parametric and implicit surfaces, in particul...
We discuss the polygonisation and rendering of implicit surfaces through the adaptive subdivision of...
We discuss the polygonization and rendering of implicit surfaces through the adaptive subdivision of...
We present a method for contouring an implicit function using a grid topologically dual to structure...
grantor: University of TorontoIn order to efficiently render implicit surfaces with a proj...
We present point based rendering techniques that render various types of contours as constant width ...
The article presents algorithms for rendering the intersection curves of implicit surfaces. The algo...
A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The...
Algorithms of trimming implicit surfaces yielding surface sheets and stripes are presented. These tw...
Both object modeling and visualization belong to the fundamental tasks of the computer graphics. In ...