Considering adjacent sets for computing the visibility region - Equipe ROBotics for EXploration
Pré-Publication, Document De Travail Année : 2024

Considering adjacent sets for computing the visibility region

Résumé

This paper explores the problem of the paving of the union of adjacent contractors. The focus is first put on the analysis of the topology of a set operator, which can be stable or not stable. Then, depending on the stability of the union operator, solutions are proposed to avoid fake boundaries in stable and non-stable union of sets. For stable union of sets, a boundary preserving form will be developed to add a set overlapping the fake boundary in the expression of the union, whereas for non-stable union of sets, a boundary approach will be developed to avoid fake boundaries. Some problem specific solutions are also developed to avoid fake boundaries. As an example, an enhancement of the separator on the visibility constraint is proposed. This avoids fake boundaries while characterizing the set of non-visible points from an observation point relative to a polygon.
Fichier principal
Vignette du fichier
preprint.pdf (490.38 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04847934 , version 1 (19-12-2024)

Identifiants

  • HAL Id : hal-04847934 , version 1

Citer

Quentin Brateau, Fabrice Le Bars, Luc Jaulin. Considering adjacent sets for computing the visibility region. 2024. ⟨hal-04847934⟩
0 Consultations
0 Téléchargements

Partager

More