Abstract
A major impediment to the implementation of visualization algorithms on very-large unstructured scientific data sets is the suitable internal representation of the data. Not only must we represent the data elements themselves, but we must also represent the connectivity or topological relationships between the data. We present three data structures for unstructured meshes that are designed to fully represent the topological connectivity in the mesh, but also minimize the data storage requirements in representing the mesh. The key idea is to represent the topology of the mesh by the use of a single data item — the lath — which can be used to encapsulate the topological relationships within the mesh. We present and analyze algorithms that query the spatial relations and properties of these data structures, and analyze the data structures of the dual mesh induced by each.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ala, S. R. Design methodology of boundary data structures. Internat. J. Comput. Geom. Appl. 1, 3 (1991), 207–226.
Baumgart, B. G. Geometric modeling for computer vision. AIM-249, STA-CS-74-463, CS Dept, Stanford U., Oct. 1974.
Bertram, M. Multiresolution Modeling for Scientific Visualization. PhD thesis, University of California, Davis, 2000.
Bertram, M., Duchaineau, M. A., Hamann, B., and Joy, K. I. Bicubic subdivision-surface wavelets for large-scale isosurface representation and visualization. Proceedings of IEEE Visualization 2000 (Oct. 2000), 389–396.
Catmull, E., and Clark, J. Recursively generated B-spline surfaces on arbitrary topological meshes. Computer-Aided Design 10 (Sept. 1978), 350–355.
De Floriani, L., and Puppo, E. Hierarchical triangulation for multiresolution surface description geometric design. ACM Transactions on Graphics 14, 4 (Oct. 1995), 363–411.
Doo, D. A subdivision algorithm for smoothing down irregularly shaped polyhedrons. In Proced. Int’l Conf. Ineractive Techniques in Computer Aided Design (1978), pp. 157–165. Bologna, Italy, IEEE Computer Soc.
Doo, D., and Sabin, M. Behaviour of recursive division surfaces near extraordinary points. Computer-Aided Design 10 (Sept. 1978), 356–360.
Eastman, C. M. Introduction to Computer Aided Design, Course Notes, Carnegie-Mellon University, Pittsburg, PA, 1982.
Garland, M., and Heckbert, P. Surface simplification using quadric error metrics. Proceedings of SIGGRAPH’97 (1997), 209–215.
Gieng, T., Joy, K. I., Hamann, B., Schussman, G., and Trotts, I. Smooth hierarchical surface triangulations. In Proceedings of Visualization’ 97 (Oct. 1997), H. Hagen and R. Yagel, Eds., IEEE Computer Society, pp. 379–386.
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 (Apr. 1998), 145–161.
Hall, M., and Warren, J. Adaptive polygonalization of implicitly defined surfaces. IEEE Computer Graphics and Applications 10, 6 (Nov. 1990), 33–
Hoppe, H. Progressive meshes. In SIGGRAPH 96 Conference Proceedings (Aug. 1996), H. Rushmeier, Ed., Annual Conference Series, ACM SIGGRAPH, Addison Wesley, pp. 99–108. held in New Orleans, Louisiana, 04–09 August 1996.
Kalay, Y. E. Modeling Objects and Environments. John Wiley and Sons, 1989.
Mantyla, M. An Introduction to Solid Modeling. Computer Science Press, Rockville, Md, 1988.
Renze, K. J., and Oliver, J. H. Generalized surface and volume decimation for unstructured tessellated domains. In VRAIS’ 96 (IEEE Virtual Reality Annual Intl. Symp.) (Mar. 1996), pp. 24–32.
Schussman, S., Bertram, M., Hamann, B., and Joy, K. I. Hierarchical data representations based on planar voronoi diagrams. In Proceedings of the Joint Eurographics and IEEE TVCG Conference on Visualization (2000), R. van Liere, I. Hermann, and W. Ribarsky, Eds., pp. 63–72.
Thompson, J. F., and Hamann, B. A survey of grid generation techniques and systems with emphasis on recent developments. Surveys on Mathematics for Industry 6 (1997), 289–310.
Weiler, K. J. Topological structures for geometric modeling. Ph.d. thesis, Rensselaer Polytechnic Institute, Aug. 1986.
Woo, T. C., and Wolter, J. D. A constant expected time, linear storage data structure for representing three-dimensional objects. IEEE Transactions on Systems, Man and Cybernetics SMC-14 (May 1984), 510–515.
Xia, J. C., and Varshney, A. Dynamic view-dependent simplification for polygonal models. In IEEE Visualization’ 96 (Oct. 1996), IEEE. ISBN 0-89791-864-9.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joy, K.I., Legakis, J., MacCracken, R. (2003). Data Structures for Multiresolution Representation of Unstructured Meshes. In: Farin, G., Hamann, B., Hagen, H. (eds) Hierarchical and Geometrical Methods in Scientific Visualization. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55787-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-55787-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62801-6
Online ISBN: 978-3-642-55787-3
eBook Packages: Springer Book Archive