@conference {13317,
	title = {Multiresolution tetrahedral meshes: an analysis and a comparison},
	booktitle = {Shape Modeling International, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {83 - 91},
	abstract = {We deal with the problem of analyzing and visualizing large-size volume data sets. To this aim, we consider multiresolution representations based on a decomposition of the field domain into tetrahedral cells. We compare two types of multiresolution representations that differ on the rule applied to refine an initial coarse mesh: one is based on tetrahedron bisection, and one based on vertex split. The two representations can be viewed as instances of a common multiresolution model, that we call a multiresolution mesh. Encoding data structures for the two representations are briefly described. An experimental comparison on structured volume data sets is presented},
	keywords = {(computer, bisection;vertex, cells;tetrahedron, data, generation;rendering, geometry;data, graphics);solid, meshes;rendering;tetrahedral, modelling;, refinement;multiresolution, representations;multiresolution, sets;mesh, split;computational, structures;data, tetrahedral, visualisation;mesh, visualization;experiment;large-size, volume},
	doi = {10.1109/SMI.2002.1003532},
	author = {Danovaro,E. and De Floriani, Leila and Lee,M. and Samet, Hanan}
}
@article {17969,
	title = {Adaptive real-time level-of-detail based rendering for polygonal models},
	journal = {Visualization and Computer Graphics, IEEE Transactions on},
	volume = {3},
	year = {1997},
	month = {1997/06//apr},
	pages = {171 - 183},
	abstract = {We present an algorithm for performing adaptive real-time level-of-detail-based rendering for triangulated polygonal models. The simplifications are dependent on viewing direction, lighting, and visibility and are performed by taking advantage of image-space, object-space, and frame-to-frame coherences. In contrast to the traditional approaches of precomputing a fixed number of level-of-detail representations for a given object, our approach involves statically generating a continuous level-of-detail representation for the object. This representation is then used at run time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications, where there are a limited number of highly complex objects that stay relatively close to the viewer. Our approach is applicable for scalar (such as distance from the viewer) as well as vector (such as normal direction) attributes},
	keywords = {(computer, adaptive, attributes;scientific, attributes;view-dependent, coherence;image-space;lighting;multiresolution, direction;visibility;computational, geometry;data, graphics);, hierarchies;object-space;run, hierarchies;triangulated, level-of-detail, models;vector, polygonal, real-time, refinement;triangle, rendering;displayed, simplifications;viewing, systems;rendering, time;scalar, triangles;frame-to-frame, visualisation;real-time, visualization;selective},
	isbn = {1077-2626},
	doi = {10.1109/2945.597799},
	author = {Xia,J. C and El-Sana,J. and Varshney, Amitabh}
}
@conference {17961,
	title = {Controlled simplification of genus for polygonal models},
	booktitle = {Visualization {\textquoteright}97., Proceedings},
	year = {1997},
	month = {1997/10//},
	pages = {403 - 410},
	abstract = {Genus-reducing simplifications are important in constructing multiresolution hierarchies for level-of-detail-based rendering, especially for datasets that have several relatively small holes, tunnels, and cavities. We present a genus-reducing simplification approach that is complementary to the existing work on genus-preserving simplifications. We propose a simplification framework in which genus-reducing and genus-preserving simplifications alternate to yield much better multiresolution hierarchies than would have been possible by using either one of them. In our approach we first identify the holes and the concavities by extending the concept of alpha;-hulls to polygonal meshes under the L<sub> infin;</sub> distance metric and then generate valid triangulations to fill them.},
	keywords = {(computer, /spl, alpha/-hulls;L/sub, distance, framework;small, geometry;controlled, geometry;data, graphics);, hierarchies;object, holes;triangulations;tunnels;computational, infin//, meshes;polygonal, metric;cavities;computational, models;simplification, rendering;multiresolution, representations;polygonal, simplification;datasets;genus-preserving, simplifications;genus-reducing, simplifications;level-of-detail-based, visualisation;rendering},
	doi = {10.1109/VISUAL.1997.663909},
	author = {El-Sana,J. and Varshney, Amitabh}
}
