Title: Hierarchical decomposition of datasets on irregular surface meshes
(GP. Bonneau, A. Gerussi)

red line


In this paper we introduce multiresolution analysis (MRA) algorithms intended to be used in scientific visualization, and based on a non-nested set of approximating spaces. The need for non nested spaces arises from the fact that the required scaling functions do not fulfill any refinement equation. Therefore we introduce in the first part the concept of approximated refinement equation, that allows to generalize the filter bank and exact reconstruction algorithms. The second part shows how this concept enables to define a MRA scheme for piecewise constant data defined on an arbitrary planar or spherical triangular mesh. The ability to deal with arbitrary triangular meshes, without subdivision connectivity, can be achieved only through the use of non nested approximating spaces, as introduced in the first part.

Reference: CGI'98 Proceedings, Hannover, November 98

Download full paper (gziped-postscript, 1.2M)

Copyright 1998 IEEE. Published in the Proceedings of CGI'98, 22 June 1998 in Hannover, Germany. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl. 732-562-3966.

red line

Dot    Return to George-Pierre Bonneau's homepage.