1 / 42

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

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

joanne
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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. Overview • Marching Cubes: • Most cited paper in history of SIGGRAPH • http://www.siggraph.org/conferences/reports/s2004/articles/Visualizing_SIGGRAPH.html from www.nasa.gov from www.openqvis.com from graphics.csie.ntu.edu.tw

  3. Sharp Features Consistent Topology Adaptive Resolution Real-time Problems

  4. Outline Previous work & Problems Solutions Results & Conclusions

  5. Previous work & Problems Solutions Results & Conclusions

  6. Marching Cubes Table • Using binary pattern of eight vertices • Totally 256 cases in 15 classes

  7. Surface extraction from volume data

  8. Consistent Topology Consistent topology • Ambiguity problems • [NIELSON G. M., HAMANN B. 1991] • [NATARAJAN B. K., 1994] • [CHERNYAEV E., 1995], etc.

  9. Adaptive resolution Adaptive Resolution • [WILHELMS J., GELDER A. V.,1992] • [SHU R. et al, 1995], etc.

  10. Adaptive resolution Adaptive Resolution

  11. Crack patching Adaptive Resolution

  12. Sharp Features Sharp feature • [KOBBELT L. P. et al, 2001] • [JU T. et al, 2002]

  13. Sharp Features Hermite data

  14. Realtime

  15. Inter-cell dependency Real-time

  16. Previous work & Problems Solutions Results & Conclusions

  17. Cubical Marching Squares Adaptive Resolution

  18. CMS Algorithm

  19. CMS Algorithm

  20. CMS Algorithm

  21. CMS Algorithm

  22. CMS Algorithm

  23. Separated Joined Consistent Topology Analysis of face ambiguity

  24. Consistent Topology Resolving face ambiguty

  25. Algorithm – CubicalMarchingSquares

  26. Transition Face Adaptive Resolution

  27. Inter-cell independency Real-time

  28. Previous work & Problems Solutions Results & Conclusions

  29. Simulation • Available shapes • generated randomly in a limited space

  30. Average geometric errors

  31. Error distribution Maximum Error Average Error

  32. Comparison Adaptive Resolution Sharp Features Consistent Topology Real-time « MarchingCubes « TopologicalMarchingCubes « « ExtendedMarchingCubes « « DualContouring « « « « CubicalMarchingSquares

  33. Benefits - inter-cell independency 1.Faster 2.Parallelizable 3.Lower Error

  34. Benefits - consistent topology 1. Correct Shape 2. Lower Error

  35. Benefits - consistent topology 1. Correct Shape 2. Lower Error

  36. Benefits – adaptive & crack free 1. Smooth Shape 2. Reduce 3D  2D

  37. Virtual Sculptor

  38. Remeshing

  39. CSG & LOD

  40. 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.

  41. Acceleration using GPU Real-time Packing Computing Unpacking Bus Bus

  42. Future work • Full GPU implementation • Applying CMS to distance fields

More Related