Hierarchical decomposition of datasets on irregular surface meshes

Abstract : In this paper we introduce multiresolution analysis (MRA) algorithms intended to be used in scientific visualiza-tion, 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 connectiv-ity, can be achieved only through the use of non nested approximating spaces, as introduced in the first part.
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01708571
Contributor : Georges-Pierre Bonneau <>
Submitted on : Tuesday, February 13, 2018 - 6:20:32 PM
Last modification on : Thursday, February 15, 2018 - 1:04:57 AM
Long-term archiving on : Monday, May 7, 2018 - 12:40:25 PM

File

bonneau_cgi98.pdf
Files produced by the author(s)

Identifiers

Collections

IMAG | UGA

Citation

Georges-Pierre Bonneau, Alexandre Gerussi. Hierarchical decomposition of datasets on irregular surface meshes. Computer Graphics International, 1998, Hannover, Germany. ⟨10.1109/CGI.1998.694250⟩. ⟨hal-01708571⟩

Share

Metrics

Record views

59

Files downloads

65