Hybrid Polygon-Point Rendering of Singular and Non-Manifold Implicit Surfaces

A hybrid polygons-points algorithm based on a hierarchical decomposition of the bounding volume using an octree spatial data structure, and testing cell occupation with interval arithmetic is given. Polygons are produced where curvature in occupied cells is low and points are used where curvature is high. As a result, points are rendered around extreme features and polygons around regular features. Using this approach implicit surfaces of high complexity, such as recursively defined curvature surfaces, are rendered. A discussion of the implementation is given for a GPU version of the algorithm and a comparison with GPU ray-casting is made. As the approach uses subdivision and it can be used for surface modelling. An advantage of the approach is the few artefacts that occur with singular points, cusps, rays and curves of self intersection. Production of antialiased animations and multiple views of the surface can be faster than in ray-casting. The algorithm is robust, renders singular and non-manifold surface and the algorithm works for algebraic and non-algebraic surfaces.

• Publication year

  2019

• Venue

  2019 23rd International Conference in Information Visualization – Part II

• Publication date

  2019-07-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/IV-2.2019.00039
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Survey on Implicit Surface Polygonization

  2015cited by this paper
• Visualizing Nonmanifold and Singular Implicit Surfaces with Point Clouds

  2012cited by this paper
• Beam Casting Implicit Surfaces on the GPU with Interval Arithmetic

  2011cited by this paper
• Data-Parallel Octrees for Surface Reconstruction

  2011cited by this paper
• Real-Time Ray Tracing of Implicit Surfaces on the GPU

  2010cited by this paper
• Fast Ray Tracing of Arbitrary Implicit Surfaces with Interval and Affine Arithmetic

  2009cited by this paper
• Real-Time Antialiasing of Edges and Contours of Point Rendered Implicit Surfaces

  2008cited by this paper
• Interactive Ray Tracing of Arbitrary Implicits with SIMD Interval Arithmetic

  2007cited by this paper
• Real-time GPU rendering of piecewise algebraic surfaces

  2006cited by this paper
• Graphics using Implicit Surfaces with Interval Arithmetic based Recursive Voxelization

  2003cited by this paper
• Point‐Based Rendering of Non‐Manifold Surfaces

  2003cited by this paper
• Visualisation of implicit surfaces

  2001influential reference
• Cutting cubesvisualizing implicit surfaces by adaptive polygonization

  1993cited by this paper
• Robust ray intersection with interval arithmetic

  1990cited by this paper
• Applications of spatial data structures

  1989cited by this paper
• Polygonization of implicit surfaces

  1988influential reference
• Marching cubes: A high resolution 3D surface construction algorithm

  1987cited by this paper
• Illumination for computer generated pictures

  1975cited by this paper

• Singularity Computation for Rational Parametric Surfaces Using Moving Planes

  2022cites this paper
• 2019 23rd International Conference in Information Visualization – Part II

  2019cites this paper