Isabelle Sivignon

53 papers B 1C 3Misc 3Journal 26Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Note about the complexity of the acyclic orientation with parity constraint problem. Discret. Appl. Math. Sylvain Gravier, Matthieu Petiteau, Isabelle Sivignon
2026	J	`jnl`	Some polynomial classes for the acyclic orientation with parity constraint problem. CoRR Sylvain Gravier, Matthieu Petiteau, Isabelle Sivignon
2025	—	`conf`	Conversion of a Digital Object into a Finite Set of Balls: Complexity. DGMM Isabelle Sivignon
2025	J	`jnl`	Note about the complexity of the acyclic orientation with parity constraint problem. CoRR Sylvain Gravier, Matthieu Petiteau, Isabelle Sivignon
2023	J	`jnl`	(k - 2)-linear connected components in hypergraphs of rank k. Discret. Math. Theor. Comput. Sci. Florian Galliot, Sylvain Gravier, Isabelle Sivignon
2023	J	`jnl`	(k-2)-linear connected components in hypergraphs of rank k. CoRR Florian Galliot, Sylvain Gravier, Isabelle Sivignon
2023	J	`jnl`	An update on the coin-moving game on the square grid. CoRR Florian Galliot, Sylvain Gravier, Isabelle Sivignon
2022	—	`conf`	Exact and Optimal Conversion of a Hole-free 2d Digital Object into a Union of Balls in Polynomial Time. DGMM Isabelle Sivignon
2022	J	`jnl`	Structural tools for the Maker-Breaker game. Application to hypergraphs of rank 3: strategies and tractability. CoRR Florian Galliot, Sylvain Gravier, Isabelle Sivignon
2020	J	`jnl`	Efficient distance transformation for path-based metrics. Comput. Vis. Image Underst. David Coeurjolly, Isabelle Sivignon
2019	J	`jnl`	(δ, ε)-Ball Approximation of a Shape: Definition and Complexity. Discret. Comput. Geom. Dominique Attali, Tuong-Bach Nguyen, Isabelle Sivignon
2019	—	`conf`	Average Curve of n Digital Curves. DGCI Isabelle Sivignon
2017	Misc	`conf`	Ensuring k-coverage in Low-Power Wide Area Networks for Internet of Things. ICNC Zhuocheng Li, Tuong-Bach Nguyen, Quentin Lampin, Isabelle Sivignon, Steeve Zozor
2016	J	`jnl`	A note on the computation of the fraction of smallest denominator in between two irreducible fractions. Discret. Appl. Math. Isabelle Sivignon
2016	—	`conf`	Epsilon-covering: a greedy optimal algorithm for simple shapes. CCCG Tuong Nguyen, Isabelle Sivignon
2016	—	`conf`	Representation of Imprecise Digital Objects. DGCI Isabelle Sivignon
2015	J	`jnl`	Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity. Discret. Appl. Math. Isabelle Sivignon
2014	J	`jnl`	A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification Under the Fréchet Distance. Image Process. Line Isabelle Sivignon
2014	—	`conf`	Algorithms for Fast Digital Straight Segments Union. DGCI Isabelle Sivignon
2013	—	`conf`	Optimal Covering of a Straight Line Applied to Discrete Convexity. DGCI Jean-Marc Chassery, Isabelle Sivignon
2013	—	`conf`	Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment. DGCI Isabelle Sivignon
2011	—	`conf`	A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance. DGCI Isabelle Sivignon
2011	J	`jnl`	Faithful polygonal representation of the convex and concave parts of a digital curve. Pattern Recognit. Tristan Roussillon, Isabelle Sivignon
2011	J	`jnl`	Measure of straight lines for digital contour analysis. Int. J. Imaging Syst. Technol. David Coeurjolly, Isabelle Sivignon
2010	J	`jnl`	Measure of circularity for parts of digital boundaries and its fast computation. Pattern Recognit. Tristan Roussillon, Isabelle Sivignon, Laure Tougne
2009	J	`jnl`	Automatic computation of pebble roundness using digital imagery and discrete geometry. Comput. Geosci. Tristan Roussillon, Hervé Piégay, Isabelle Sivignon, Laure Tougne, Franck Lavigne
2009	J	`jnl`	Discrete Geometry for Computer Imagery. Pattern Recognit. Isabelle Sivignon, David Coeurjolly, Laure Tougne
2009	C	`conf`	Hierarchical Discrete Medial Axis for Sphere-Tree Construction. IWCIA Alain Broutta, David Coeurjolly, Isabelle Sivignon
2009	J	`jnl`	Introduction. Comput. Graph. David Coeurjolly, Isabelle Sivignon, Florent Dupont
2009	—	`conf`	Measure of Straight Lines and its Applications in Digital Geometry. IWCIA Special Track on Applications David Coeurjolly, Isabelle Sivignon
2009	J	`jnl`	Minimum decomposition of a digital surface into digital plane segments is NP-hard. Discret. Appl. Math. Isabelle Sivignon, David Coeurjolly
2009	—	`conf`	On Three Constrained Versions of the Digital Circular Arc Recognition Problem. DGCI Tristan Roussillon, Laure Tougne, Isabelle Sivignon
2009	C	`conf`	What Does Digital Straightness Tell about Digital Convexity? IWCIA Tristan Roussillon, Laure Tougne, Isabelle Sivignon
2008	—	`ed.`	Discrete Geometry for Computer Imagery, 14th IAPR International Conference, DGCI 2008, Lyon, France, April 16-18, 2008. Proceedings DGCI David Coeurjolly, Isabelle Sivignon, Laure Tougne, Florent Dupont
2008	J	`jnl`	Finding a minimum medial axis of a discrete shape is NP-hard. Theor. Comput. Sci. David Coeurjolly, Jérôme Hulin, Isabelle Sivignon
2008	B	`conf`	Robust decomposition of a digital curve into convex and concave parts. ICPR Tristan Roussillon, Isabelle Sivignon, Laure Tougne
2008	—	`conf`	Test and Measure of Circularity for Digital Curves. IPCV Tristan Roussillon, Isabelle Sivignon, Laure Tougne
2007	Misc	`conf`	Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis. ICIAP Tristan Roussillon, Laure Tougne, Isabelle Sivignon
2007	J	`jnl`	Reversible vectorisation of 3D digital planar curves and applications. Image Vis. Comput. Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
2006	—	`conf`	Duality and Geometry Straightness, Characterization and Envelope. DGCI Jean-Marc Chassery, David Coeurjolly, Isabelle Sivignon
2006	—	`conf`	Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard. DGCI Isabelle Sivignon, David Coeurjolly
2006	—	`conf`	Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification. DGCI David Coeurjolly, Florent Dupont, Laurent Jospin, Isabelle Sivignon
2005	J	`jnl`	Discrete analytical curve reconstruction without patches. Image Vis. Comput. Isabelle Sivignon, Rodolphe Breton, Florent Dupont, Eric Andres
2005	J	`jnl`	On digital plane preimage structure. Discret. Appl. Math. David Coeurjolly, Isabelle Sivignon, Florent Dupont, Fabien Feschet, Jean-Marc Chassery
2005	—	`conf`	Reversible Polygonalization of a 3D Planar Discrete Curve: Application on Discrete Surfaces. DGCI Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
2004	J	`jnl`	Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces. Algorithmica Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
2004	J	`jnl`	Digital Intersections: minimal carrier, connectivity, and periodicity properties. Graph. Model. Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
2004	C	`conf`	Discrete Surface Segmentation into Discrete Planes. IWCIA Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
2003	J	`jnl`	Digital plane preimage structure. Electron. Notes Discret. Math. David Coeurjolly, Isabelle Sivignon, Florent Dupont, Fabien Feschet, Jean-Marc Chassery
2003	—	`conf`	New Results about Digital Intersections. DGCI Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery
2003	—	`conf`	Towards an Invertible Euclidean Reconstruction of a Discrete Object. DGCI Rodolphe Breton, Isabelle Sivignon, Florent Dupont, Eric Andres
2002	—	`conf`	From Digital Plane Segmentation to Polyhedral Representation. Theoretical Foundations of Computer Vision Isabelle Sivignon, David Coeurjolly
2001	Misc	`conf`	Digital Geometry Fundaments: Application to Plane Recognition. ICIAP Jean-Marc Chassery, Florent Dupont, Isabelle Sivignon, Joëlle Vittone