• DocumentCode
    2300787
  • Title

    Approximation of isosurface in the Marching Cube: ambiguity problem

  • Author

    Matveyev, Sergey V.

  • Author_Institution
    Dept. of Comput. Sci., Inst. for High Energy Phys., Moscow, Russia
  • fYear
    1994
  • fDate
    17-21 Oct 1994
  • Firstpage
    288
  • Lastpage
    292
  • Abstract
    The purpose of the article is the consideration of the problem of ambiguity over the faces arising in the Marching Cube algorithm. The article shows that for unambiguous choice of the sequence of the points of intersection of the isosurface with edges confining the face it is sufficient to sort them along one of the coordinates. It also presents the solution of this problem inside the cube. Graph theory methods are used to approximate the isosurface inside the cell
  • Keywords
    computational geometry; data visualisation; graph theory; surface fitting; Marching Cube; ambiguity problem; coordinates; graph theory methods; isosurface approximation; unambiguous choice; Bismuth; Computer science; Equations; Graph theory; Interpolation; Isosurfaces; Joining processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Visualization, 1994., Visualization '94, Proceedings., IEEE Conference on
  • Conference_Location
    Washington, DC
  • Print_ISBN
    0-8186-6627-7
  • Type

    conf

  • DOI
    10.1109/VISUAL.1994.346307
  • Filename
    346307