Digital Geometry Fundaments: Application to Plane Recognition. - Jean-Marc Chassery; Florent Dupont; Isabelle Sivignon; Joëlle Vittone (ICIAP, 2001)

From Digital Plane Segmentation to Polyhedral Representation. - Isabelle Sivignon; David Coeurjolly (Theoretical Foundations of Computer Vision, 2002)

Towards an Invertible Euclidean Reconstruction of a Discrete Object. - Rodolphe Breton; Isabelle Sivignon; Florent Dupont; Eric Andres (DGCI, 2003)

New Results about Digital Intersections. - Isabelle Sivignon; Florent Dupont; Jean-Marc Chassery (DGCI, 2003)

Discrete Surface Segmentation into Discrete Planes. - Isabelle Sivignon; Florent Dupont; Jean-Marc Chassery (IWCIA, 2004)

Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces. - Isabelle Sivignon; Florent Dupont; Jean-Marc Chassery (Algorithmica, 2004)

Digital Intersections: minimal carrier, connectivity, and periodicity properties. - Isabelle Sivignon; Florent Dupont; Jean-Marc Chassery (Graph. Model., 2004)

Reversible Polygonalization of a 3D Planar Discrete Curve: Application on Discrete Surfaces. - Isabelle Sivignon; Florent Dupont; Jean-Marc Chassery (DGCI, 2005)

On digital plane preimage structure. - David Coeurjolly; Isabelle Sivignon; Florent Dupont; Fabien Feschet; Jean-Marc Chassery (Discret. Appl. Math., 2005)

Discrete analytical curve reconstruction without patches. - Isabelle Sivignon; Rodolphe Breton; Florent Dupont; Eric Andres (Image Vis. Comput., 2005)

Duality and Geometry Straightness, Characterization and Envelope. - Jean-Marc Chassery; David Coeurjolly; Isabelle Sivignon (DGCI, 2006)

Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification. - David Coeurjolly; Florent Dupont; Laurent Jospin; Isabelle Sivignon (DGCI, 2006)

Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard. - Isabelle Sivignon; David Coeurjolly (DGCI, 2006)

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

Reversible vectorisation of 3D digital planar curves and applications. - Isabelle Sivignon; Florent Dupont; Jean-Marc Chassery (Image Vis. Comput., 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)

Finding a minimum medial axis of a discrete shape is NP-hard. - David Coeurjolly; Jérôme Hulin; Isabelle Sivignon (Theor. Comput. Sci., 2008)

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

Hierarchical Discrete Medial Axis for Sphere-Tree Construction. - Alain Broutta; David Coeurjolly; Isabelle Sivignon (IWCIA, 2009)

Measure of Straight Lines and its Applications in Digital Geometry. - David Coeurjolly; Isabelle Sivignon (IWCIA Special Track on Applications, 2009)

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

Introduction. - David Coeurjolly; Isabelle Sivignon; Florent Dupont (Comput. Graph., 2009)

Minimum decomposition of a digital surface into digital plane segments is NP-hard. - Isabelle Sivignon; David Coeurjolly (Discret. Appl. Math., 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)

Discrete Geometry for Computer Imagery. - Isabelle Sivignon; David Coeurjolly; Laure Tougne (Pattern Recognit., 2009)

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

Measure of straight lines for digital contour analysis. - David Coeurjolly; Isabelle Sivignon (Int. J. Imaging Syst. Technol., 2011)

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

Optimal Covering of a Straight Line Applied to Discrete Convexity. - Jean-Marc Chassery; Isabelle Sivignon (DGCI, 2013)

Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment. - Isabelle Sivignon (DGCI, 2013)

Algorithms for Fast Digital Straight Segments Union. - Isabelle Sivignon (DGCI, 2014)

A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification Under the Fréchet Distance. - Isabelle Sivignon (Image Process. Line, 2014)

Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity. - Isabelle Sivignon (Discret. Appl. Math., 2015)

Epsilon-covering: a greedy optimal algorithm for simple shapes. - Tuong Nguyen; Isabelle Sivignon (CCCG, 2016)

Representation of Imprecise Digital Objects. - Isabelle Sivignon (DGCI, 2016)

A note on the computation of the fraction of smallest denominator in between two irreducible fractions. - Isabelle Sivignon (Discret. Appl. Math., 2016)

Ensuring k-coverage in Low-Power Wide Area Networks for Internet of Things. - Zhuocheng Li; Tuong-Bach Nguyen; Quentin Lampin; Isabelle Sivignon; Steeve Zozor (ICNC, 2017)

Average Curve of n Digital Curves. - Isabelle Sivignon (DGCI, 2019)

(δ, ε)-Ball Approximation of a Shape: Definition and Complexity. - Dominique Attali; Tuong-Bach Nguyen; Isabelle Sivignon (Discret. Comput. Geom., 2019)

Efficient distance transformation for path-based metrics. - David Coeurjolly; Isabelle Sivignon (Comput. Vis. Image Underst., 2020)

Exact and Optimal Conversion of a Hole-free 2d Digital Object into a Union of Balls in Polynomial Time. - Isabelle Sivignon (DGMM, 2022)

Structural tools for the Maker-Breaker game. Application to hypergraphs of rank 3: strategies and tractability. - Florian Galliot; Sylvain Gravier; Isabelle Sivignon (CoRR, 2022)

An update on the coin-moving game on the square grid. - Florian Galliot; Sylvain Gravier; Isabelle Sivignon (CoRR, 2023)

(k - 2)-linear connected components in hypergraphs of rank k. - Florian Galliot; Sylvain Gravier; Isabelle Sivignon (Discret. Math. Theor. Comput. Sci., 2023)

Note about the complexity of the acyclic orientation with parity constraint problem. - Sylvain Gravier; Matthieu Petiteau; Isabelle Sivignon (CoRR, 2025)