Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas
Contributor : Marie-Françoise Gerard <>
Submitted on : Tuesday, July 16, 2013 - 1:49:37 PM
Last modification on : Saturday, April 25, 2020 - 4:16:09 PM
Document(s) archivé(s) le : Thursday, October 17, 2013 - 4:16:46 AM


Files produced by the author(s)


  • HAL Id : hal-00845053, version 1


Michel Kieffer, Luc Jaulin, Isabelle Braems, Eric Walter. Guaranteed set computation with subpavings. SCAN-Interval 2000, Sep 2000, Karlsrhue, Germany. pp.191-204. ⟨hal-00845053⟩



Record views


Files downloads