Isabelle Sivignon

CoRR, 2023

(k-2)-linear connected components in hypergraphs of rank k.

[BibT_eX]

[DOI]

Florian Galliot

Sylvain Gravier

CoRR, 2023

2022

Structural tools for the Maker-Breaker game. Application to hypergraphs of rank 3: strategies and tractability.

[BibT_eX]

[DOI]

Florian Galliot

Sylvain Gravier

CoRR, 2022

Exact and Optimal Conversion of a Hole-free 2d Digital Object into a Union of Balls in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry and Mathematical Morphology, 2022

2020

Efficient distance transformation for path-based metrics.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2020

2019

(δ, ε)-Ball Approximation of a Shape: Definition and Complexity.

[BibT_eX]

[DOI]

Dominique Attali

Tuong-Bach Nguyen

Discret. Comput. Geom., 2019

Average Curve of n Digital Curves.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2019

2017

Ensuring k-coverage in Low-Power Wide Area Networks for Internet of Things.

[BibT_eX]

[DOI]

Proceedings of the 2017 International Conference on Computing, 2017

2016

A note on the computation of the fraction of smallest denominator in between two irreducible fractions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Representation of Imprecise Digital Objects.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2016

Epsilon-covering: a greedy optimal algorithm for simple shapes.

[BibT_eX]

Tuong Nguyen

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification Under the Fréchet Distance.

[BibT_eX]

[DOI]

Image Process. Line, 2014

Algorithms for Fast Digital Straight Segments Union.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2014

2013

Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2013

Optimal Covering of a Straight Line Applied to Discrete Convexity.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2013

2011

Faithful polygonal representation of the convex and concave parts of a digital curve.

[BibT_eX]

[DOI]

Pattern Recognit., 2011

Measure of straight lines for digital contour analysis.

[BibT_eX]

[DOI]

Int. J. Imaging Syst. Technol., 2011

2010

Measure of circularity for parts of digital boundaries and its fast computation.

[BibT_eX]

[DOI]

Pattern Recognit., 2010

2009

Discrete Geometry for Computer Imagery.

[BibT_eX]

[DOI]

Pattern Recognit., 2009

Automatic computation of pebble roundness using digital imagery and discrete geometry.

[BibT_eX]

[DOI]

Comput. Geosci., 2009

Minimum decomposition of a digital surface into digital plane segments is NP-hard.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Introduction.

[BibT_eX]

[DOI]

Comput. Graph., 2009

What Does Digital Straightness Tell about Digital Convexity?

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

Measure of Straight Lines and its Applications in Digital Geometry.

[BibT_eX]

Proceedings of the Progress in Combinatorial Image Analysis. Proceedings of IWCIA 2009 Special Track on Applications, 2009

Hierarchical Discrete Medial Axis for Sphere-Tree Construction.

[BibT_eX]

[DOI]

Alain Broutta

Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

On Three Constrained Versions of the Digital Circular Arc Recognition Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

Finding a minimum medial axis of a discrete shape is NP-hard.

[BibT_eX]

[DOI]

Jérôme Hulin

Theor. Comput. Sci., 2008

Test and Measure of Circularity for Digital Curves.

[BibT_eX]

Proceedings of the 2008 International Conference on Image Processing, 2008

Robust decomposition of a digital curve into convex and concave parts.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Pattern Recognition (ICPR 2008), 2008

2007

Reversible vectorisation of 3D digital planar curves and applications.

[BibT_eX]

[DOI]

Image Vis. Comput., 2007

Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Image Analysis and Processing (ICIAP 2007), 2007

2006

Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

Duality and Geometry Straightness, Characterization and Envelope.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

2005

Discrete analytical curve reconstruction without patches.

[BibT_eX]

[DOI]

Image Vis. Comput., 2005

Reversible Polygonalization of a 3D Planar Discrete Curve: Application on Discrete Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004

Digital Intersections: minimal carrier, connectivity, and periodicity properties.

[BibT_eX]

[DOI]

Graph. Model., 2004

Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces.

[BibT_eX]

[DOI]

Algorithmica, 2004

Discrete Surface Segmentation into Discrete Planes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

2003

Digital plane preimage structure.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

New Results about Digital Intersections.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 11th International Conference, 2003

Towards an Invertible Euclidean Reconstruction of a Discrete Object.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 11th International Conference, 2003

2002

From Digital Plane Segmentation to Polyhedral Representation.

[BibT_eX]

[DOI]