Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis. - Tristan Roussillon; Laure Tougne; Isabelle Sivignon (ICIAP, 2007)

Robust decomposition of a digital curve into convex and concave parts. - Tristan Roussillon; Isabelle Sivignon; Laure Tougne (ICPR, 2008)

Test and Measure of Circularity for Digital Curves. - Tristan Roussillon; Isabelle Sivignon; Laure Tougne (IPCV, 2008)

On Three Constrained Versions of the Digital Circular Arc Recognition Problem. - Tristan Roussillon; Laure Tougne; Isabelle Sivignon (DGCI, 2009)

What Does Digital Straightness Tell about Digital Convexity? - Tristan Roussillon; Laure Tougne; Isabelle Sivignon (IWCIA, 2009)

Automatic computation of pebble roundness using digital imagery and discrete geometry. - Tristan Roussillon; Hervé Piégay; Isabelle Sivignon; Laure Tougne; Franck Lavigne (Comput. Geosci., 2009)

Algorithmes d'extraction de modèles géométriques discrets pour la représentation robuste des formes. (Recognition algorithms of digital geometric patterns for robust shape representation). - Tristan Roussillon (2009)

Measure of circularity for parts of digital boundaries and its fast computation. - Tristan Roussillon; Isabelle Sivignon; Laure Tougne (Pattern Recognit., 2010)

Analytical Description of Digital Circles. - Eric Andres; Tristan Roussillon (DGCI, 2011)

Delaunay Properties of Digital Straight Segments. - Tristan Roussillon; Jacques-Olivier Lachaud (DGCI, 2011)

Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs. - Tristan Roussillon; Jacques-Olivier Lachaud (IWCIA, 2011)

Unsupervised Polygonal Reconstruction of Noisy Contours by a Discrete Irregular Approach. - Antoine Vacavant; Tristan Roussillon; Bertrand Kerautret (IWCIA, 2011)

Faithful polygonal representation of the convex and concave parts of a digital curve. - Tristan Roussillon; Isabelle Sivignon (Pattern Recognit., 2011)

A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours. - Antoine Vacavant; Tristan Roussillon; Bertrand Kerautret; Jacques-Olivier Lachaud (Comput. Vis. Image Underst., 2013)

Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties. - Jean-Luc Toutant; Eric Andres; Tristan Roussillon (Discret. Appl. Math., 2013)

2D Topological Map Isomorphism for Multi-Label Simple Transformation Definition. - Guillaume Damiand; Tristan Roussillon; Christine Solnon (DGCI, 2014)

An Arithmetical Characterization of the Convex Hull of Digital Straight Segments. - Tristan Roussillon (DGCI, 2014)

Euclidean farthest-point Voronoi diagram of a digital edge. - Tristan Roussillon (Discret. Appl. Math., 2015)

Computation of the Normal Vector to a Digital Plane by Sampling Significant Points. - Jacques-Olivier Lachaud; Xavier Provençal; Tristan Roussillon (DGCI, 2016)

An output-sensitive algorithm to compute the normal vector of a digital plane. - Jacques-Olivier Lachaud; Xavier Provençal; Tristan Roussillon (Theor. Comput. Sci., 2016)

Heat Kernel Laplace-Beltrami Operator on Digital Surfaces. - Thomas Caissard; David Coeurjolly; Jacques-Olivier Lachaud; Tristan Roussillon (DGCI, 2017)

Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-scale/Irregular Geometric Representation and Generalized Linear Programming. - Antoine Vacavant; Bertrand Kerautret; Tristan Roussillon; Fabien Feschet (DGCI, 2017)

Two Plane-Probing Algorithms for the Computation of the Normal Vector to a Digital Plane. - Jacques-Olivier Lachaud; Xavier Provençal; Tristan Roussillon (J. Math. Imaging Vis., 2017)

Characterization of Bijective Digitized Rotations on the Hexagonal Grid. - Kacper Pluta; Tristan Roussillon; David Coeurjolly; Pascal Romon; Yukiko Kenmochi; Victor Ostromoukhov (J. Math. Imaging Vis., 2018)

Digital Plane Recognition with Fewer Probes. - Tristan Roussillon; Jacques-Olivier Lachaud (DGCI, 2019)

Laplace-Beltrami Operator on Digital Surfaces. - Thomas Caissard; David Coeurjolly; Jacques-Olivier Lachaud; Tristan Roussillon (J. Math. Imaging Vis., 2019)

An Optimized Framework for Plane-Probing Algorithms. - Jacques-Olivier Lachaud; Jocelyn Meyron; Tristan Roussillon (J. Math. Imaging Vis., 2020)

A New Lattice-Based Plane-Probing Algorithm. - Jui-Ting Lu; Tristan Roussillon; David Coeurjolly (DGMM, 2022)

Approximation of Digital Surfaces by a Hierarchical Set of Planar Patches. - Jocelyn Meyron; Tristan Roussillon (DGMM, 2022)

Combinatorial Generation of Planar Sets. - Tristan Roussillon (J. Math. Imaging Vis., 2023)

Decomposition of Rational Discrete Planes. - Tristan Roussillon; Sébastien Labbé 001 (DGMM, 2024)

Delaunay property and proximity results of the L-algorithm for digital plane probing. - Jui-Ting Lu; Tristan Roussillon; Jacques-Olivier Lachaud; David Coeurjolly (Theor. Comput. Sci., 2024)

Decomposition of Rational Discrete Hyperplanes. - Tristan Roussillon (J. Math. Imaging Vis., 2025)