• DocumentCode
    2185170
  • Title

    Dual marching cubes

  • Author

    Nielson, Gregory M.

  • Author_Institution
    Arizona Univ., Tucson, AZ, USA
  • fYear
    2004
  • fDate
    10-15 Oct. 2004
  • Firstpage
    489
  • Lastpage
    496
  • Abstract
    We present the definition and computational algorithms for a new class of surfaces which are dual to the isosurface produced by the widely used marching cubes (MC) algorithm. These new isosurfaces have the same separating properties as the MC surfaces but they are comprised of quad patches that tend to eliminate the common negative aspect of poorly shaped triangles of the MC isosurfaces. Based upon the concept of this new dual operator, we describe a simple, but rather effective iterative scheme for producing smooth separating surfaces for binary, enumerated volumes which are often produced by segmentation algorithms. Both the dual surface algorithm and the iterative smoothing scheme are easily implemented.
  • Keywords
    computational geometry; graph theory; image segmentation; mesh generation; solid modelling; surface fitting; computational algorithms; dual graph; dual marching cubes; dual surface algorithm; iterative smoothing scheme; segmentation algorithms; triangular mesh; Chromium; Computational geometry; Computer graphics; Isosurfaces; Iterative algorithms; Lattices; Smoothing methods; Solid modeling; USA Councils; Visualization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Visualization, 2004. IEEE
  • Print_ISBN
    0-7803-8788-0
  • Type

    conf

  • DOI
    10.1109/VISUAL.2004.28
  • Filename
    1372234