A survey of the marching cubes algorithm

نویسندگان

  • Timothy S. Newman
  • Hong Yi
چکیده

A survey of the development of the marching cubes algorithm [W. Lorensen, H. Cline, Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics 1987; 21(4):163–9], a well-known cell-by-cell method for extraction of isosurfaces from scalar volumetric data sets, is presented. The paper’s primary aim is to survey the development of the algorithm and its computational properties, extensions, and limitations (including the attempts to resolve its limitations). A rich body of publications related to this aim are included. Representative applications and spin-off work are also considered and related techniques are briefly discussed. r 2006 Elsevier Ltd. All rights reserved.

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

ثبت نام

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

منابع مشابه

Quality Isosurface Mesh Generation Using an Extended Marching Cubes Lookup Table

The Marching Cubes Algorithm may return degenerate, zero area isosurface triangles, and often returns isosurface triangles with small areas, edges or angles. We show how to avoid both problems using an extended Marching Cubes lookup table. As opposed to the conventional Marching Cubes lookup table, the extended lookup table differentiates scalar values equal to the isovalue from scalar values g...

متن کامل

Surface Construction Analysis using Marching Cubes

This paper presents an analysis of the algorithms used for generating 3D structures from 2D CT-Scan Datasets. This is achieved by developing an implementation of Marching Cubes, a surface construction algorithm that’s currently the standard used for 3D surface construction in the medical visualization industry.

متن کامل

Cubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data

In this paper, we present a new method for surface extraction from volume data which preserves sharp features, maintains consistent topology and generates surface adaptively without crack patching. Our approach is based on the marching cubes algorithm, a popular method to convert volumetric data to polygonal meshes. The original marching cubes algorithm suffers from problems of topological inco...

متن کامل

GPU Optimized Marching Cubes Algorithm for Handling Very Large, Temporal Datasets

In this article is presented an efficient implementation of the Marching Cubes Algorithm using nVidia’s CUDA technology, which can handle datasets that are so large that they cannot be loaded into the working memory of the used computer. Two kinds of data are considered: a single 3D grid that is too large to fit in memory and many, temporal 3D grids that individually fit in memory, but combined...

متن کامل

Adaptive cube tessellation for topologically correct isosurfaces

Three dimensional datasets representing scalar fields are frequently rendered using isosurfaces. For datasets arranged as a cubic lattice, the marching cubes algorithm is the most used isosurface extraction method. However, the marching cubes algorithm produces some ambiguities which have been solved using different approaches that normally imply a more complex process. One of them is to tessel...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Computers & Graphics

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2006