Evolution of T-spline level sets for meshing non-uniformly sampled and incomplete data

  • Authors:
  • Huaiping Yang;Bert Jüttler

  • Affiliations:
  • Johannes Kepler University, Institute of Applied Geometry, 4040, Linz, Austria;Johannes Kepler University, Institute of Applied Geometry, 4040, Linz, Austria

  • Venue:
  • The Visual Computer: International Journal of Computer Graphics
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Given a large set of unorganized point sample data, we propose a new framework for computing a triangular mesh representing an approximating piecewise smooth surface. The data may be non-uniformly distributed, noisy, and may contain holes. This framework is based on the combination of two types of surface representations, triangular meshes and T-spline level sets, which are implicit surfaces defined by refinable spline functions allowing T-junctions. Our method contains three main steps. Firstly, we construct an implicit representation of a smooth (C 2 in our case) surface, by using an evolution process of T-spline level sets, such that the implicit surface captures the topology and outline of the object to be reconstructed. The initial mesh with high quality is obtained through the marching triangulation of the implicit surface. Secondly, we project each data point to the initial mesh, and get a scalar displacement field. Detailed features will be captured by the displaced mesh. Finally, we present an additional evolution process, which combines data-driven velocities and feature-preserving bilateral filters, in order to reproduce sharp features. We also show that various shape constraints, such as distance field constraints, range constraints and volume constraints can be naturally added to our framework, which is helpful to obtain a desired reconstruction result, especially when the given data contains noise and inaccuracies.