Adaptative cubical grid forisosurface extraction

GRAPP 2009 - Proceedings of the 4th International Conference on Computer Graphics Theory and Applications

Volumn , Issue , 2009, Pages 21-26

  Congote, John ^a   Moreno, Aitor ^b   Barandiaran, Inigo ^b   Barandiaran, Javier ^b   Ruiz, Oscar E ^a  

^a UNIVERSIDAD EAFIT   (Colombia)

^b VICOMTECH   (Spain)

Author keywords

Adaptive isosurface extraction; Adaptive tessellation; Isosurfaces; Marching cubes; Volume Warping

Indexed keywords

ADAPTIVE ISOSURFACE EXTRACTION; ADAPTIVE TESSELLATION; ISOSURFACES; MARCHING CUBES; VOLUME WARPING;

COMPUTER GRAPHICS; GEOMETRY; WEAVING;

ALGORITHMS;

EID: 67650563988     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Balmelli, L., Morris, C. J., Taubin, G., and Bernardini, F. (2002). Volume warping for adaptive isosurface ex-traction. In Proceedings ofthe conference on Visual-ization 02, pages 467-174. IEEE Computer Society.
2. Carr, J. C, Beatson, R. K., Cherrie, J. B., Mitchell, T. J., Fright, W. R., McCallum, B. C, and Evans, T. R. (2001). Reconstruction and representation of 3d ob-jects with radial basis functions. In SIGGRAPH '01: Proceedings ofthe 28th annual conference on Computer graphics and Interactive techniques, pages 67-76, New York, NY, USA. ACM. (Pubitemid 33047291)
3. Chernvaev, E. (1995). Marching cubes 33: Construction of topologicallv coiTect isosurfaces. Technical report, Technical Report CERN CN 95-117
4. Frisken, S. F., Frisken, S. E, Perry, R. N., Perry, R. N., Rockvvood, A. R, Rockvvood, A. R, Jones, T. R., and Jones, T. R. (2000). Adaptivelv sampled distance fields: A general representation of shape for computer graphics. pages 249-254.
5. Kimura, A., Takama, Y., Yamazoe, Y, Tanaka, S., and Tanaka, H. T. (2004). Parallel volume segmentation with tetrahedral adaptive grid. ICPR, 02:281-286.
6. Krek, P. (2005). Flow reduction marching cubes algo-rithm. In Proceedings of ICCVG 2004, pages 100-106. Springer Verlag.
7. Levviner, T., Lopes, H., Vieira, A., and Tavares, G. (2003). Efficient implementation of marching cubes' cases with topological guarantees. Journal of Graphics Tools, 8(2): 1-15.
8. Lorensen, W. E. and Cline, H. E. (1987). Marching cubes: A high resolution 3d surface construction algorithm. S1GGRAPHComput. Graph., 21(4): 169-1169
9. Morse, B. S., Yoo, T. S., Rheingans, R, Chen, D. T., and Subramanian, K. R. (2005). Interpolating implicit surfaces from scattered surface data using compactly supported radial basis functions. In SIGGRAPH '05: ACMSIGGRAPH2005 Courses, page 78, New York, NY, USA. ACM.
10. Nevvman, T. S. and Yi, H. (2006). A survey of the marching cubes algorithm. Computers & Graphics, 30(5):854-879. (Pubitemid 44573407)
11. Oscar E. Ruiz, Miguel Granados, C. C. (2005). Fea-driven geometric modelling for meshless methods. In Virtual Concept 2005, pages 1-8.
12. Paiva, A., Lopes, H., Levviner, T., and de Figueiredo, L. H. (2006). Robust adaptive meshes for implicit surfaces. S1BGRAPI, 0:205-212. (Pubitemid 47515410)
13. Schaefer, S. and Warren, J. (2004). Dual marching cubes: Primal contouring of dual grids. In PG '04: Proceed-ings ofthe Computer Graphics and Applications, 12th Pacific Conference, pages 70-76, Washington, DC, USA. IEEE Computer Society. (Pubitemid 40540303)
14. Shekhar, R., Fayyad, E., Yagel, R., and Cornhill, J. F. (1996). Octree-based decimation of marching cubes surfaces. In VIS '96: Proceedings ofthe 7th conference on Visualization '96, pages 335-ff., Los Alami-tos, CA, USA. IEEE Computer Society Press.
15. Weber, G. H., Kreylos, O., Ligocki, T. J., Shalf, J. M., Hamann, B., and Joy, K. I. (2001). Extraction of crack-free isosurfaces from adaptive mesh refinement data. In Data Visualization 2001 (Proceedings of Vis-Sym '01), pages 25-34. Springer Verlag.