Isabelle Sivignon

Available identifiers

zbMath Open sivignon.isabelleMaRDI QIDQ244974

List of research outcomes

Publication	Date of Publication	Type
\((k-2)\)-linear connected components in hypergraphs of rank \(k\)	2024-09-06	Paper
(k-2)-linear connected components in hypergraphs of rank k	2023-07-13	Paper
An update on the coin-moving game on the square grid	2023-07-13	Paper
Exact and optimal conversion of a hole-free 2\textsc{d} digital object into a union of balls in polynomial time	2023-06-02	Paper
Maker-Breaker is solved in polynomial time on hypergraphs of rank 3	2022-09-26	Paper
Average Curve of n Digital Curves	2019-10-16	Paper
\((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity	2019-03-13	Paper
Representation of Imprecise Digital Objects	2016-07-15	Paper
A note on the computation of the fraction of smallest denominator in between two irreducible fractions	2016-02-12	Paper
Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity	2015-02-18	Paper
Algorithms for Fast Digital Straight Segments Union	2014-09-15	Paper
Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment	2013-05-31	Paper
Optimal Covering of a Straight Line Applied to Discrete Convexity	2013-05-31	Paper
Faithful polygonal representation of the convex and concave parts of a digital curve	2011-08-10	Paper
A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance	2011-05-19	Paper
Towards an invertible Euclidean reconstruction of a discrete object.	2010-01-05	Paper
New results about digital intersections.	2010-01-05	Paper
What does digital straightness tell about digital convexity?	2009-12-11	Paper
Hierarchical discrete medial axis for sphere-tree construction	2009-12-11	Paper
On Three Constrained Versions of the Digital Circular Arc Recognition Problem	2009-12-01	Paper
Measure of circularity for parts of digital boundaries and its fast computation	2009-10-15	Paper
Minimum decomposition of a digital surface into digital plane segments is NP-hard	2009-03-04	Paper
Finding a minimum medial axis of a discrete shape is NP-hard	2008-11-12	Paper
Duality and Geometry Straightness, Characterization and Envelope	2008-04-17	Paper
Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification	2008-04-17	Paper
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard	2008-04-17	Paper
Digital plane preimage structure	2007-05-29	Paper
On digital plane preimage structure	2005-11-07	Paper
Discrete Geometry for Computer Imagery	2005-09-13	Paper
Combinatorial Image Analysis	2005-08-12	Paper
Decomposition of a three-dimensional discrete object surface into discrete plane pieces	2004-12-02	Paper
Digital Intersections: minimal carrier, connectivity, and periodicity properties	2004-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q4419009	2003-07-31	Paper

Research outcomes over time

This page was built for person: Isabelle Sivignon