20 citations · 21 across the 4 of their papers we have counts for
5 papers
How to~Peel Fully Convex Digital Sets
Fabien Feschet, Jacques-Olivier Lachaud
Full convexity is an interesting alternative to classical digital convexity since it guarantees connectedness and even simple connectedness in digital spaces Z d , for any dimensio…
Shadoks Approach to Parallel Reconfiguration of Triangulations
Guilherme D. da Fonseca, Fabien Feschet, Yan Gerard
We describe the methods used by Team Shadoks to win the CG:SHOP 2026 Challenge on parallel reconfiguration of planar triangulations. An instance is a collection of triangulations o…
Robust reconstructions by multi-scale/irregular tangential covering
Antoine Vacavant, Bertrand Kerautret, Fabien Feschet
In this paper, we propose an original manner to employ a tangential cover algorithm - minDSS - in order to geometrically reconstruct noisy digital contours. To do so, we exploit th…
The Saturated Subpaths Decomposition in Z 2 : a short note on generalized Tangential Cover
Fabien Feschet
In this short note, we generalized the Tangential Cover used in Digital Geometry in order to use very general geometric predicates. We present the required notions of saturated …
Maximal digital straight segments and convergence of discrete geometric estimators
F. De Vieilleville, Jacques-Olivier Lachaud, F. Feschet
Discrete geometric estimators approach geometric quantities on digitized shapes without any knowledge of the continuous shape. A classical yet difficult problem is to show that an…