- 1.CIGNONI, P., DE FLORIANI, L., MONTONI, C., PUPPO, E., AND SCOPIGNO, R. Multiresolution modeling and visualization of volume data based on simplicial complexes. In 1994 Symposium on Volume Visualization (Oct. 1994), A. Kaufman and W. Krueger, Eds., ACM SIGGRAPH, pp. 19-26. Google ScholarDigital Library
- 2.COHEN, J., VARSHNEY, A., MANOCHA, D., TURK, G., WEBER, H., AGARWAL, P., BROOKS, JR., F. P., AND WRIt3HT, W. Simplification envelopes. In SIGGRAPH 96 Conference Proceedings (Aug. 1996), H. Rushmeier, Ed., Annual Conference Series, ACM SIGGRAPH, Addison Wesley, pp. 119-128. Google ScholarDigital Library
- 3.GARLAND, M., AND HECKBERT, P. S. Surface simplification using quadric error metrics, in SIGGRAPH 97 Conference Proceedings(Aug. 1997), T. Whirred, Ed., Annual Conference Series, ACM S1GGRAPH, Addison Wesley, pp. 209-216. Google ScholarDigital Library
- 4.GIENG, T. S., HAMANN, B., JOY, K. {., SCHUSSMAN, G. L., AND TROTTS, i. J. Smooth hierarchical surface triangulations. In Proceedings of Visualization 97 (Oct. 1997), H. Hagen and R. Yagel, Eds., IEEE Computer Society Press, Los Alamitos, California, pp. 379-386. Google ScholarDigital Library
- 5.GIENG, T. S., HAMANN, B., JoY, K. I., SCHUSSMAN, G. L., AND TROTTS, I. J. Constructing hierarchies for triangle meshes. IEEE Transactions on Visualization and Computer Graphics 4, 2 (1998), (to appear). Google ScholarDigital Library
- 6.HAMANN, B. A data reduction scheme for triangulated surfaces. ComputerAided Geometric Design II (1994), 197-214. Google ScholarDigital Library
- 7.HAMANN, B., AND CHEN, J.-L. Data point selection for piecewise linear curve approximation. Computer-Aided Geometric Design 11, 3 (June 1994), 289-301. Google ScholarDigital Library
- 8.HAMANN, B., AND JORDAN, B. Triangulations from repeated bisection. In Mathematical Methods for Curves and Surfaces !i, M. Da~hlen, T. Lyche, and L. Schumacker, Eds. Vanderbilt University Press, Nashville, Tennessee, 1998, pp. 229-236. Google Scholar
- 9.HOPPE, H. Progressive meshes. In SIGGRAPH 96 Conference Proceedings (Aug. 1996), H. Rushmeier, Ed., Annual Conference Series, ACM SIGGRAPH, Addison Wesley, pp. 99-108. Google ScholarDigital Library
- 10.HOPPE, H. View-dependent refinement of progressive meshes. In SIGGRAPH 97 Conference Proceedings (Aug. 1997), T. Whitted, Ed., Annual Conference Series, ACM SIG- GRAPH, Addison Wesley, pp. 189-198. Google ScholarDigital Library
- 11.HOPPE, H., DEROSE, T., DUCHAMP, T., MCDONALD, J., AND STUETZLE, W. Mesh optimization. In Computer Graphics (SIGGRAPH '93 Proceedings) (Aug. 1993), J. T. Kajiya, Ed., vol. 27, pp. 19-26. Google ScholarDigital Library
- 12.KAUFMAN, A. E. Volume visualization. ACM Computing Surveys 28, I (Mar. 1996), 165-167. Google ScholarDigital Library
- 13.KLEIN, R., LIEBICH, G., AND STRASSER, W. Mesh reduction with error control. In Proceedings of lEEE Visualization '96 (Oct. 1996), IEEE Computer Society Press, Los Alamitos, California, pp. 311-318. Google ScholarDigital Library
- 14.NIELSON, G., MtJLLER, H., AND HAGEN, H., Eds. Scientific Visualization: Overviews, Methodologies, and Techniques. Academic Press, 1997.Google Scholar
- 15.PoPOVff:, J., AND HOPPE, H. Progressive simplicial complexes. In SIGGRAPH 97 Conference Proceedings (Aug. 1997), T. Whitted, Ed., Annual Conference Series, ACM SIG- GRAPH, Addison Wesley, pp. 217-224. Google ScholarDigital Library
- 16.RENZE, K. J., AND OLIVER, J. H. Generalized unstructured decimation. IEEE Computer Graphics & Applications 16, 6 (Nov. 1996), 24--32. Google ScholarDigital Library
- 17.SCHRoEDER, W. J., ZARGE, J. A., AND LORENSEN, W. E. Decimation of triangle meshes. In Computer Graphics (SIG- GRAPH '92 Proceedings) (July 1992), E. E. Catmull, Ed., vol. 26, pp. 65-70. Google ScholarDigital Library
- 18.XIA, J. C., AND VARSHNEY, A. Dynamic view-dependent simplification for polygonal models. In Proceedings oflEEE Visualization '96 (Oct. 1996), IEEE Computer Society Press, Los Alamitos, California, pp. 327-334. Google ScholarDigital Library
Index Terms
- Simplification of tetrahedral meshes
Recommendations
Simplification of Tetrahedral Meshes with Error Bounds
We present a method for the construction of multiple levels of tetrahedral meshes approximating a trivariate scalar-valued function at different levels of detail. Starting with an initial, high-resolution triangulation of a three-dimensional region, we ...
On a Construction of a Hierarchy of Best Linear Spline Approximations Using Repeated Bisection
We present a method for the construction of hierarchies of single-valued functions in one, two, and three variables. The input to our method is a coarse decomposition of the compact domain of a function in the form of an interval (univariate case), ...
Streaming Simplification of Tetrahedral Meshes
Unstructured tetrahedral meshes are commonly used in scientific computing to represent scalar, vector, and tensor fields in three dimensions. Visualization of these meshes can be difficult to perform interactively due to their size and complexity. By ...
Comments