Abstract
Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two requirements: (1) minimum mean square error and (2) fixed reduction ratio between levels, this paper first transforms the MRQSA problem into the problem of solving a sequence of near-Toeplitz tridiagonal linear systems. Employing the matrix perturbation technique, the MRQSA problem can be solved using about 24mn floating-point operations, i.e. linear time, if we are given a polygonal surface with (2m−1)×(2n−1) points. A numerical stability analysis is also given. To the best of our knowledge, this is the first time that such a linear algebra approach has been used for solving the MRQSA problem. Some experimental results are carried out to demonstrate the applicability of the proposed method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bartels, R. H., Beatty, J. C. and Barsky, B. A.: An Introduction to Splines for Use in Computer Graphics and Geometric Modeling, Morgan Kaufmann, San Mateo, CA, 1987.
Berg, M. and Dobrindt, K. T. G.: On levels of detail in terrains, Technical Report, Utrecht University, 1995.
Bern, M. and Eppstein, D.: Mesh generation and optimal triangulation, In: F. K. Hwang and D. Z. Du (eds), Computing in Euclidean Geometry, World Scientific, Singapore, 1992.
Chan, K. W. and Chin, F.: Optimal multiresolution polygonal approximation, In: The Third Annual International Conference COCOON'97, 1997, pp. 32–41.
Cheng, F. and Goshtasby, A.: A parallel B-spline surface fitting algorithm, ACM Trans. Graphics 8(1) (1989), 41–50.
Cheng, F., Wasilkowski, G.W., Wang, J., Zhang, C. and Wang, W.: Parallel B-spline surface interpolation on a mesh-connected processor array, J. Parallel Distributed Comput. 24(2) (1995), 224–229.
Chung, K. L. and Yan, W. M.: Parallel B-spline surface fitting on mesh-connected computers, J. Parallel Distributed Comput. 35 (1996), 205–210.
Foley, J. D., van Dam, A., Feiner, S. K. and Hughes, J. F.: Computer Graphics: Principles and Practice, 2nd edn, Chapter 11: Representing Curves and Surfaces, Addison-Wesley, Reading, Mass., 1996.
Gieng, T. S., Hamann, B., Joy, K. I., Schussman, G. L. and Trotts, I. J.: Constructing hierarchies for triangle meshes, IEEE Trans. Visualization Comput. Graphics 4(2) (1998), 145–161.
Gross, M. H., Staadt, O. G. and Gatti, R.: Efficient triangular surface approximations using wavelets and quadtree data structures, IEEE Trans. Visualization Comput. Graphics 2(2) (1996), 130–143.
Hearn, D. and Baker, M. P.: Computer Graphics, 2nd edn, Chapter 10: Three-dimensional Object Representations, Prentice-Hall, Englewood Cliffs, 1994.
Heighway, E.: A mesh generator for automatically subdividing irregular polygons into quadrilaterals, IEEE Trans. Magnetics 19(6) (1983), 2535–2538.
Ho-Le, K.: Finite element mesh generation methods: A review and classification, Computer Aided Design 20 (1988), 27–38.
Joe, B.: Quadrilateral mesh generation in polygonal regions, Computer Aided Design 27(3) (1995), 209–222.
Lubiw, A.: Decomposing polygonal regions into convex quadrilaterals, Proc. 1st ACM Sympos. Computational Geometry, 1985, pp. 97–106.
Ramaswami, S., Ramos, P. and Toussaint, G.: Converting triangulations to quadrangulations, Comput. Geom. 9 (1998), 257–276.
Watt, A. and Policarpo, F.: The Computer Image, Chapter 2: Representation and Modeling of Three-dimensional Objects, Addison-Wesley, 1999.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chung, KL., Yan, WM. & Wu, JG. Optimal Hierarchies for Quadrilateral Surfaces. Journal of Mathematical Modelling and Algorithms 1, 283–300 (2002). https://doi.org/10.1023/A:1021603330228
Issue Date:
DOI: https://doi.org/10.1023/A:1021603330228