Epsilon-covering: a greedy optimal algorithm for simple shapes

Tuong-Bach Nguyen 1 Isabelle Sivignon 1
1 GIPSA-AGPIG - AGPIG
GIPSA-DIS - Département Images et Signal
Abstract : Unions of balls are widely used shape representations. Given a shape, computing a union of balls that is both accurate in some sense and of small cardinality is thus a challenging problem. In this work, accuracy is ensured by imposing that the union of balls, called covering, is included in the shape and covers a parameterized core set (namely the erosion) of the shape. For a family of simple shapes, we propose a polynomial-time greedy algorithm that computes a covering of minimum cardi-nality for a given shape.
Type de document :
Communication dans un congrès
Canadian Conference on Computational Geometry, Aug 2016, Vancouver, Canada
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01400434
Contributeur : Isabelle Sivignon <>
Soumis le : lundi 21 novembre 2016 - 23:18:13
Dernière modification le : jeudi 24 novembre 2016 - 10:45:56
Document(s) archivé(s) le : mardi 21 mars 2017 - 11:28:47

Fichier

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

Identifiants

  • HAL Id : hal-01400434, version 1

Collections

Citation

Tuong-Bach Nguyen, Isabelle Sivignon. Epsilon-covering: a greedy optimal algorithm for simple shapes. Canadian Conference on Computational Geometry, Aug 2016, Vancouver, Canada. <hal-01400434>

Partager

Métriques

Consultations de
la notice

148

Téléchargements du document

58