Isabelle Sivignon

From MaRDI portal
Person:244974

Available identifiers

zbMath Open sivignon.isabelleMaRDI QIDQ244974

List of research outcomes





PublicationDate of PublicationType
\((k-2)\)-linear connected components in hypergraphs of rank \(k\)2024-09-06Paper
(k-2)-linear connected components in hypergraphs of rank k2023-07-13Paper
An update on the coin-moving game on the square grid2023-07-13Paper
Exact and optimal conversion of a hole-free 2\textsc{d} digital object into a union of balls in polynomial time2023-06-02Paper
Maker-Breaker is solved in polynomial time on hypergraphs of rank 32022-09-26Paper
Average Curve of n Digital Curves2019-10-16Paper
\((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity2019-03-13Paper
Representation of Imprecise Digital Objects2016-07-15Paper
A note on the computation of the fraction of smallest denominator in between two irreducible fractions2016-02-12Paper
Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity2015-02-18Paper
Algorithms for Fast Digital Straight Segments Union2014-09-15Paper
Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment2013-05-31Paper
Optimal Covering of a Straight Line Applied to Discrete Convexity2013-05-31Paper
Faithful polygonal representation of the convex and concave parts of a digital curve2011-08-10Paper
A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance2011-05-19Paper
Towards an invertible Euclidean reconstruction of a discrete object.2010-01-05Paper
New results about digital intersections.2010-01-05Paper
What does digital straightness tell about digital convexity?2009-12-11Paper
Hierarchical discrete medial axis for sphere-tree construction2009-12-11Paper
On Three Constrained Versions of the Digital Circular Arc Recognition Problem2009-12-01Paper
Measure of circularity for parts of digital boundaries and its fast computation2009-10-15Paper
Minimum decomposition of a digital surface into digital plane segments is NP-hard2009-03-04Paper
Finding a minimum medial axis of a discrete shape is NP-hard2008-11-12Paper
Duality and Geometry Straightness, Characterization and Envelope2008-04-17Paper
Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification2008-04-17Paper
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard2008-04-17Paper
Digital plane preimage structure2007-05-29Paper
On digital plane preimage structure2005-11-07Paper
Discrete Geometry for Computer Imagery2005-09-13Paper
Combinatorial Image Analysis2005-08-12Paper
Decomposition of a three-dimensional discrete object surface into discrete plane pieces2004-12-02Paper
Digital Intersections: minimal carrier, connectivity, and periodicity properties2004-11-12Paper
https://portal.mardi4nfdi.de/entity/Q44190092003-07-31Paper

Research outcomes over time

This page was built for person: Isabelle Sivignon