Marching Cubes in an Unsigned Distance Field for Surface Reconstruction from Unorganized Point Sets

نویسندگان

  • John Congote
  • Aitor Moreno
  • Iñigo Barandiaran
  • Javier Barandiarán
  • Jorge Posada
  • Oscar E. Ruiz
چکیده

Surface reconstruction from unorganized point set is a common problem in computer graphics. Generation of the signed distance field from the point set is a common methodology for the surface reconstruction. The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned nature of the distance. We propose an extension to the marching cubes algorithm allowing the reconstruction of 0-level iso-surfaces in an unsigned distance field. We calculate more information inside each cell of the marching cubes lattice and then we extract the intersection points of the surface within the cell then we identify the marching cubes case for the triangulation. Our algorithm generates good surfaces but the presence of ambiguities in the case selection generates some topological mistakes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GPU Local Triangulation: an interpolating surface reconstruction algorithm

A GPU capable method for surface reconstruction from unorganized point clouds without additional information, called GLT (GPU Local Triangulation), is presented. The main objective of this research is the generation of a GPU interpolating reconstruction based on local Delaunay triangulations, inspired by a pre-existing reconstruction algorithm. Current graphics hardware accelerated algorithms a...

متن کامل

Adaptive Triangulation Of Objects Reconstructed From Multiple Range Images

When reconstructing objects from multiple range images one has to deal with the problem of large data sets. In our approach, the surface itself is implicitly defined by a signed distance function. The distance function is derived from the range images which are assumed to be already registered. A triangulated model is generated from a rough approximation of the object using the marching-cubes a...

متن کامل

Robust segmentation of anatomical structures with deformable surfaces and marching cubes

Computer assisted medical applications require often the reconstruction of anatomical structures to compute parameters useful for diagnosis or interventional planning. From CT and MRI datasets it is possible to obtain surface models of the organs of interest with a variety of algorithms, like Marching Cubes, level sets or deformable parametric surfaces. Each technique has advantages but also dr...

متن کامل

An Efficient Surface Reconstruction Pipeline for Particle-Based Fluids

In this paper we present an efficient surface reconstruction pipeline for particle-based fluids such as smoothed particle hydrodynamics. After the scalar field computation and the marching cubes based triangulation, we post process the surface mesh by applying surface decimation and subdivision algorithms. In comparison to existing approaches, the decimation step alleviates the particle alignme...

متن کامل

Voxel Surfels: Rapid Visualization and Meshification of point cloud ensembles

Conversion of unorganized point clouds to surface reconstructions is increasingly required in the mobile robotics perception processing pipeline, particularly with the rapid adoption of RGB-D (color and depth) image sensors. Many contemporary methods stem from the work in the computer graphics community in order to handle the point clouds generated by tabletop scanners in a batch-like manner. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010