The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] marching cubes(2hit)

1-2hit
  • Real-Time Spatial Surface Modeling System Using Wand Traversal Patterns of Grid Edges

    Harksu KIM  Dongtaek KIM  Jaeeung LEE  Youngho CHAI  

     
    PAPER-Human-computer Interaction

      Vol:
    E94-D No:8
      Page(s):
    1620-1627

    This paper presents a grid-based, real-time surface modeling algorithm in which the generation of a precise 3D model is possible by considering the user's intention during the course of the spatial input. In order to create the corresponding model according to the user's input data, plausible candidates of wand traversal patterns of grid edges are defined by considering the sequential and directional characteristics of the wand input. The continuity of the connected polygonal surfaces, including the octree space partitioning, is guaranteed without the extra crack-patching algorithm and the pre-defined patterns. Furthermore, the proposed system was shown to be a suitable and effective surface generation tool for the spatial sketching system. It is not possible to implement the unusual input intention of the 3D spatial sketching system using the conventional Marching Cubes algorithm.

  • Shrink-Wrapped Isosurface from Cross Sectional Images

    Young Kyu CHOI  James K. HAHN  

     
    PAPER-Computer Graphics

      Vol:
    E90-D No:12
      Page(s):
    2070-2076

    This paper addresses a new surface reconstruction scheme for approximating the isosurface from a set of tomographic cross sectional images. Differently from the novel Marching Cubes (MC) algorithm, our method does not extract the iso-density surface (isosurface) directly from the voxel data but calculates the iso-density point (isopoint) first. After building a coarse initial mesh approximating the ideal isosurface by the cell-boundary representation, it metamorphoses the mesh into the final isosurface by a relaxation scheme, called shrink-wrapping process. Compared with the MC algorithm, our method is robust and does not make any cracks on surface. Furthermore, since it is possible to utilize lots of additional isopoints during the surface reconstruction process by extending the adjacency definition, theoretically the resulting surface can be better in quality than the MC algorithm. According to experiments, it is proved to be very robust and efficient for isosurface reconstruction from cross sectional images.