 |
|
|
|
| HAL : hal-00023087, version 1 |
| DOI : 10.1016/j.dam.2005.02.024 |
| Fiche détaillée |  Récupérer au format |
|
|
| Discrete Applied Mathematics 151 (2005) 106-121 |
|
|
|
|
| Salient and reentrant points of discrete sets |
|
|
| Alain Daurat 1Maurice Nivat 2 |
|
|
| (2005) |
|
|
|
| The border-salient and reentrant points of a discrete set are special points of the border of the set. When they are given with multiplicity they completely characterize the set, and without multiplicity they characterize the set if all its 8-components are 4-connected. The inner-salient and reentrant are defined similarly to the border ones, but we show that, in general, they do not characterize the set, even if this set is 4-simply connected. We also show that the genus of a set can be easily computed from the number of salient and reentrant points. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire des Sciences de l'Image, de l'Informatique et de la Télédétection (LSIIT) |
|
|
|
CNRS : UMR7005 – Université Louis Pasteur - Strasbourg I |
|
|
| 2 : | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) |
|
|
|
CNRS : UMR7089 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Mathématique discrète |
|
|
| Discrete sets – Salient points – Reentrant points – Corners |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00023087, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00023087 | |
| oai:hal.archives-ouvertes.fr:hal-00023087 | |
| Contributeur : Alain Daurat | |
| Soumis le : Mercredi 19 Avril 2006, 23:49:53 | |
| Dernière modification le : Jeudi 20 Avril 2006, 07:02:06 | |
