Cubical marching squares adaptive feature preserving surface extraction from volume data
Sponsored Links
This presentation is the property of its rightful owner.
1 / 42

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


  • 282 Views
  • Uploaded on
  • Presentation posted in: General

Cubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data. Chien-Chang Ho, Fu-Che Wu, Bing-Yu Chen, Yung-Yu Chuang, Ming Ouhyoung National Taiwan University. Overview. Marching Cubes: Most cited paper in history of SIGGRAPH

Download Presentation

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

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Cubical Marching Squares: Adaptive Feature PreservingSurface Extraction from Volume Data

Chien-Chang Ho, Fu-Che Wu, Bing-Yu Chen, Yung-Yu Chuang, Ming Ouhyoung

National Taiwan University


Overview

  • Marching Cubes:

    • Most cited paper in history of SIGGRAPH

    • http://www.siggraph.org/conferences/reports/s2004/articles/Visualizing_SIGGRAPH.html

from www.nasa.govfrom www.openqvis.comfrom graphics.csie.ntu.edu.tw


Sharp Features

Consistent

Topology

Adaptive Resolution

Real-time

Problems


Outline

Previous work

& Problems

Solutions

Results &

Conclusions


Previous work

& Problems

Solutions

Results &

Conclusions


Marching Cubes Table

  • Using binary pattern of eight vertices

  • Totally 256 cases in 15 classes


Surface extraction from volume data


Consistent

Topology

Consistent topology

  • Ambiguity problems

    • [NIELSON G. M., HAMANN B. 1991]

    • [NATARAJAN B. K., 1994]

    • [CHERNYAEV E., 1995], etc.


Adaptive resolution

Adaptive Resolution

  • [WILHELMS J., GELDER A. V.,1992]

  • [SHU R. et al, 1995], etc.


Adaptive resolution

Adaptive Resolution


Crack patching

Adaptive Resolution


Sharp Features

Sharp feature

  • [KOBBELT L. P. et al, 2001]

  • [JU T. et al, 2002]


Sharp Features

Hermite data


Realtime


Inter-cell dependency

Real-time


Previous work

& Problems

Solutions

Results &

Conclusions


Cubical Marching Squares

Adaptive Resolution


CMS Algorithm


CMS Algorithm


CMS Algorithm


CMS Algorithm


CMS Algorithm


Separated

Joined

Consistent

Topology

Analysis of face ambiguity


Consistent

Topology

Resolving face ambiguty


Algorithm – CubicalMarchingSquares


Transition Face

Adaptive Resolution


Inter-cell independency

Real-time


Previous work

& Problems

Solutions

Results &

Conclusions


Simulation

  • Available shapes

  • generated randomly in a limited space


Average geometric errors


Error distribution

Maximum Error

Average Error


Comparison

Adaptive Resolution

Sharp Features

Consistent

Topology

Real-time

«

MarchingCubes

«

TopologicalMarchingCubes

«

«

ExtendedMarchingCubes

«

«

DualContouring

«

«

«

«

CubicalMarchingSquares


Benefits - inter-cell independency

1.Faster 2.Parallelizable 3.Lower Error


Benefits - consistent topology

1. Correct Shape 2. Lower Error


Benefits - consistent topology

1. Correct Shape 2. Lower Error


Benefits – adaptive & crack free

1. Smooth Shape 2. Reduce 3D  2D


Virtual Sculptor


Remeshing


CSG & LOD


Adaptive Resolution

Consistent

Topology

Sharp Features

Real-time

Conclusions

  • Inter-cell dependency is eliminated.

  • Sharp features are well preserved.

  • Topologies are well preserved by examining the sharp features.

  • Our method generates surface adaptively without cracks.

  • Computation can be accelerated using programmable graphic hardware.

  • It is easy to incorporate our algorithm into the existing marching cubes implementations.


Acceleration using GPU

Real-time

Packing

Computing

Unpacking

Bus

Bus


Future work

  • Full GPU implementation

  • Applying CMS to distance fields


  • Login