Isabelle Sivignon

dblp:25/3967 · DBLP profile ↗
← Back
20ranked-venue papers
9as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 7 · 2 first-authorTheory of computation · 7 · 4 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Note about the complexity of the acyclic orientation with parity constraint problem
Sylvain Gravier, Matthieu Petiteau, Isabelle Sivignon
Discret. Appl. Math.3
2020 Efficient distance transformation for path-based metrics
David Coeurjolly, Isabelle Sivignon
Comput. Vis. Image Underst.2
2019 (δ, ε)-Ball Approximation of a Shape: Definition and Complexity
Dominique Attali, Tuong-Bach Nguyen, Isabelle Sivignon
Discret. Comput. Geom.3
2016 A note on the computation of the fraction of smallest denominator in between two irreducible fractions
Isabelle Sivignon
Discret. Appl. Math.1
2015 Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity
Isabelle Sivignon
Discret. Appl. Math.1
2011 Faithful polygonal representation of the convex and concave parts of a digital curve
Tristan Roussillon, Isabelle Sivignon
Pattern Recognit.2
2010 Measure of circularity for parts of digital boundaries and its fast computation
Tristan Roussillon, Isabelle Sivignon, Laure Tougne
Pattern Recognit.2
2009 Hierarchical Discrete Medial Axis for Sphere-Tree Construction
Alain Broutta, David Coeurjolly, Isabelle Sivignon
IWCIA3
2009 What Does Digital Straightness Tell about Digital Convexity?
Tristan Roussillon, Laure Tougne, Isabelle Sivignon
IWCIA3
2009 Introduction
David Coeurjolly, Isabelle Sivignon, Florent Dupont
Comput. Graph.2
2009 Minimum decomposition of a digital surface into digital plane segments is NP-hard
Isabelle Sivignon, David Coeurjolly
Discret. Appl. Math.1
2009 Discrete Geometry for Computer Imagery
Isabelle Sivignon, David Coeurjolly, Laure Tougne
Pattern Recognit.1
2008 Robust decomposition of a digital curve into convex and concave parts
abstract
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in discrete and computational geometry: convex hull computation and Pickpsilas formula.
Tristan Roussillon, Isabelle Sivignon, Laure Tougne
ICPR2
2008 Finding a minimum medial axis of a discrete shape is NP-hard
David Coeurjolly, Jérôme Hulin, Isabelle Sivignon
Theor. Comput. Sci.3
2007 Reversible vectorisation of 3D digital planar curves and applications
Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
Image Vis. Comput.1
2005 On digital plane preimage structure
David Coeurjolly, Isabelle Sivignon, Florent Dupont, Fabien Feschet, Jean-Marc Chassery
Discret. Appl. Math.2
2005 Discrete analytical curve reconstruction without patches
Isabelle Sivignon, Rodolphe Breton, Florent Dupont, Eric Andres
Image Vis. Comput.1
2004 Discrete Surface Segmentation into Discrete Planes
Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
IWCIA1
2004 Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces
Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
Algorithmica1
2004 Digital Intersections: minimal carrier, connectivity, and periodicity properties
Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
Graph. Model.1