Pressing: Smooth Isosurfaces with Flats from Binary Grids
暂无分享,去创建一个
Jarek Rossignac | Carlos Andújar | Jason Williams | Pere Brunet | Antoni Chica | Isabel Navazo | Alvar Vinacua | J. Rossignac | I. Navazo | P. Brunet | A. Chica | Jason Williams | À. Vinacua | C. Andújar
[1] Jacques-Olivier Lachaud. Topologically defined iso-surfaces , 1996, DGCI.
[2] Gregory M. Nielson,et al. Dual marching cubes , 2004, IEEE Visualization 2004.
[3] Michael Garland,et al. Hierarchical face clustering on polygonal surfaces , 2001, I3D '01.
[4] Leif Kobbelt,et al. Automatic restoration of polygon models , 2005, TOGS.
[5] Michael Garland,et al. Surface simplification using quadric error metrics , 1997, SIGGRAPH.
[6] Bernd Hamann,et al. Visualizing and modeling scattered multivariate data , 1991, IEEE Computer Graphics and Applications.
[7] Dinesh Manocha,et al. Topology preserving surface extraction using adaptive subdivision , 2004, SGP '04.
[8] Sarah F. Frisken. Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data , 1998, MICCAI.
[9] Tao Ju,et al. Dual contouring of hermite data , 2002, ACM Trans. Graph..
[10] Adam Huang,et al. Shrouds: Optimal Separating Surfaces for Enumerated Volumes , 2003, VisSym.
[11] A Sheeer. Model Simpliication for Meshing Using Face Clustering , 2000 .
[12] Marco Attene,et al. Edge-Sharpener: Recovering Sharp Features in Triangulations of non-adaptively re-meshed surfaces , 2003, Symposium on Geometry Processing.
[13] Mario Botsch,et al. Feature sensitive surface extraction from volume data , 2001, SIGGRAPH.
[14] Bing-Yu Chen,et al. Cubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data , 2005, Comput. Graph. Forum.
[15] Paolo Cignoni,et al. Reconstruction of topologically correct and adaptive trilinear isosurfaces , 2000, Comput. Graph..
[16] Marco Attene,et al. Sharpen&Bend: recovering curved sharp edges in triangle meshes produced by feature-insensitive sampling , 2005, IEEE Transactions on Visualization and Computer Graphics.
[17] Yutaka Ohtake,et al. Mesh Optimization for Polygonized Isosurfaces , 2001, Comput. Graph. Forum.
[18] Russell H. Taylor,et al. Superfaces: polyhedral approximation with bounded error , 1994, Medical Imaging.
[19] Jarek Rossignac,et al. Computing Maximal Tiles and Application to Impostor‐Based Simplification , 2004, Comput. Graph. Forum.
[20] Jarek Rossignac,et al. Optimizing the topological and combinatorial complexity of isosurfaces , 2005, Comput. Aided Des..
[21] Frédo Durand,et al. Billboard clouds for extreme model simplification , 2003, ACM Trans. Graph..
[22] Ken Brodlie,et al. Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing , 2003, IEEE Trans. Vis. Comput. Graph..
[23] Gregory M. Nielson,et al. On Marching Cubes , 2003, IEEE Trans. Vis. Comput. Graph..
[24] Pascal Frey. Generation and adaptation of computational surface meshes from discrete anatomical data , 2004 .
[25] William E. Lorensen,et al. Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.
[26] Alla Sheffer,et al. Model simplification for meshing using face clustering , 2001, Comput. Aided Des..
[27] Karl Heinz Höhne,et al. High quality rendering of attributed volume data , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).
[28] Mark Meyer,et al. Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.
[29] Roberto Scopigno,et al. Discretized Marching Cubes , 1994, Proceedings Visualization '94.
[30] Pierre Alliez,et al. Variational shape approximation , 2004, ACM Trans. Graph..
[31] Sarah Gibson. Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data , 1998 .
[32] R. Whitaker. Reducing Aliasing Artifacts in Iso-Surfaces of Binary Volumes , 2000, 2000 IEEE Symposium on Volume Visualization (VV 2000).
[33] Gabriel Taubin,et al. A signal processing approach to fair surface design , 1995, SIGGRAPH.
[34] Pere Brunet,et al. Approximation of a Variable Density Cloud of Points by Shrinking a Discrete Membrane , 2005, Comput. Graph. Forum.