1

(k − 2)-linear connected components in hypergraphs of rank k
F. Galliot, S. Gravier, I. Sivignon
PDF Cite
Exact and Optimal Conversion of a Hole-free 2D Digital Object into a Union of Balls in Polynomial Time
Isabelle Sivignon
PDF Cite Slides
Exact and Optimal Conversion of a Hole-free 2D Digital Object into a Union of Balls in Polynomial Time
Average Curve of n Digital Curves
Isabelle Sivignon
PDF Cite
Ensuring k-coverage in Low-Power Wide Area Networks for Internet of Things
Zhuocheng Li, Tuong-Bach Nguyen, Quentin Lampin, Isabelle Sivignon, Steeve Zozor
PDF Cite
Epsilon-covering is NP-complete
Tuong-Bach Nguyen, Isabelle Sivignon Dominique Attali
PDF Cite
Epsilon-covering: a greedy optimal algorithm for simple shapes
Tuong-Bach Nguyen, Isabelle Sivignon
PDF Cite
Representation of Imprecise Digital Objects
Isabelle Sivignon
PDF Cite
Algorithms for Fast Digital Straight Segments Union
Isabelle Sivignon
PDF Cite
Optimal Covering of a Straight Line Applied to Discrete Convexity
Jean-Marc Chassery, Isabelle Sivignon
PDF Cite
Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment
Isabelle Sivignon
PDF Cite