Guaranteed set computation with subpavings

Abstract : This paper is about the approximate representation of compact sets using subpavings, i.e., unions of non-overlapping boxes, and about computation on these sets, with particular attention to implementation issues. Some basic operations such as evaluating the intersection or union of two subpavings, or testing whether a box belongs to a subpaving are first presented. The binary tree structure used to describe subpavings then allows a simple implementation of these tasks by recursive algorithms. Algorithms are presented to evaluate the inverse and direct images of a set described by a subpaving. In both cases, a subpaving is obtained that is guaranteed to contain the actual inverse or direct image of the initial subpaving. The effectiveness of these algorithms in characterizing possibly nonconvex on even nonconnected stes is finally illustrated by simple examples.
Type de document :
Communication dans un congrès
W. KRAEMER and J.W. GUDENBERG, Kluwer Academic Publishers, Boston/Dordrecht/London. SCAN-Interval 2000, Sep 2000, Karlsrhue, Germany. pp.191-204, 2000
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00845053
Contributeur : Marie-Françoise Gerard <>
Soumis le : mardi 16 juillet 2013 - 13:49:37
Dernière modification le : vendredi 7 décembre 2018 - 01:48:11
Document(s) archivé(s) le : jeudi 17 octobre 2013 - 04:16:46

Fichiers

Scan2000_KIEFFER.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00845053, version 1

Citation

Michel Kieffer, Luc Jaulin, Isabelle Braems, Eric Walter. Guaranteed set computation with subpavings. W. KRAEMER and J.W. GUDENBERG, Kluwer Academic Publishers, Boston/Dordrecht/London. SCAN-Interval 2000, Sep 2000, Karlsrhue, Germany. pp.191-204, 2000. 〈hal-00845053〉

Partager

Métriques

Consultations de la notice

616

Téléchargements de fichiers

102