Publications

(2023). Géométrie discrète. Revue 1024 (in french).

PDF Cite

(2023). (k-2)-linear connected components in hypergraphs of rank k. Journal of Discrete Mathematics and Theoretical Computer Science.

PDF Cite URL

(2022). Maker-Breaker is solved in polynomial time on hypergraphs of rank 3. Submitted to Journal of Combinatorial Theory, Series A..

Cite URL

(2022). Exact and Optimal Conversion of a Hole-free 2D Digital Object into a Union of Balls in Polynomial Time. Discrete Geometry and Mathematical Morphology - 21th IAPR International Conference, DGMM 2022, Strasbourg, France.

PDF Cite Slides

(2022). (k − 2)-linear connected components in hypergraphs of rank k. International Conference on Graph Theory.

PDF Cite

(2020). Efficient distance transformation for path-based metrics. Computer Vision and Image Understanding.

PDF Cite URL

(2019). Average Curve of n Digital Curves. Discrete Geometry for Computer Imagery - 19th IAPR International Conference, DGCI 2016, Nantes, France, April 18-20, 2016. Proceedings.

PDF Cite

(2019). (delta,epsilon)-Ball Approximation of a Shape: Definition and Complexity. Discrete & Computational Geometry.

PDF Cite

(2017). Ensuring k-coverage in Low-Power Wide Area Networks for Internet of Things. 2017 International Conference on Computing, Networking and Communications, ICNC 2017, Silicon Valley, CA, USA, January 26-29, 2017.

PDF Cite

(2016). Representation of Imprecise Digital Objects. Discrete Geometry for Computer Imagery - 19th IAPR International Conference, DGCI 2016, Nantes, France, April 18-20, 2016. Proceedings.

PDF Cite

(2016). Epsilon-covering: a greedy optimal algorithm for simple shapes. Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada.

PDF Cite

(2016). Epsilon-covering is NP-complete. European Conference on Computational Geometry.

PDF Cite

(2014). Algorithms for Fast Digital Straight Segments Union. Discrete Geometry for Computer Imagery.

PDF Cite

(2013). Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment. Discrete Geometry for Computer Imagery.

PDF Cite

(2013). Optimal Covering of a Straight Line Applied to Discrete Convexity. Discrete Geometry for Computer Imagery.

PDF Cite

(2011). Measure of straight lines for digital contour analysis. International Journal of Imaging Systems and Technology.

PDF Cite

(2011). A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance. 16-th IAPR International Conference on Discrete Geometry for Computer Imagery (DGCI).

PDF Cite

(2010). Measure of circularity for parts of digital boundaries and its fast computation. Pattern Recognition.

PDF Cite

(2009). What Does Digital Straightness Tell About Digital Convexity. 13th International Workshop on Combinatorial Image Analysis (IWCIA).

PDF Cite

(2009). On Three Constrained Versions of the Digital Circular Arc Recognition Problem. 15-th IAPR International Conference on Discrete Geometry for Computer Imagery (DGCI).

PDF Cite

(2009). Minimum decomposition of a digital surface into digital plane segments is NP-Hard. Discrete Applied Mathematics.

PDF Cite

(2009). Measure of Straight Lines and its Applications in Digital Geometry. 13th International Workshop on Combinatorial Image Analysis (IWCIA).

PDF Cite

(2009). Hierarchical Discrete Medial Axis for Sphere-Tree Construction . 13th International Workshop on Combinatorial Image Analysis (IWCIA).

PDF Cite

(2009). Automatic computation of pebble roundness using digital imagery and discrete geometry. Computers and Geosciences.

PDF Cite

(2008). Robust Decomposition of a Digital Curve into Convex and Concave Parts. International Conference on Pattern Recognition (ICPR).

PDF Cite

(2008). Test and Measure of Circularity for Digital Curves.. International Conference on Image Processing, Computer Vision, and Pattern Recognition (IPCV).

PDF Cite

(2008). Finding a minimum medial axis of a discrete shape is NP-hard. Theoretical Computer Science.

PDF Cite

(2007). Reversible vectorisation of 3D digital planar curves and applications. Image and Vision Computing.

PDF Cite URL

(2007). Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis. International Conference on Image Analysis and Processing (ICIAP).

PDF Cite

(2006). Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification. 13th International Conference on Discrete Geometry for Computer Imagery (DGCI).

PDF Cite

(2006). Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard. 13th International Conference on Discrete Geometry for Computer Imagery (DGCI).

PDF Cite

(2005). Reversible Polygonalization of a 3D Planar Discrete Curve: Application on Discrete Surfaces. 12th International Conference on Discrete Geometry for Computer Imagery (DGCI).

PDF Cite

(2005). On digital plane preimage structure. Discrete Applied Mathematics.

PDF Cite URL

(2005). Discrete analytical curve reconstruction without patches. Image and Vision Computing.

PDF Cite URL

(2004). Reversible discrete volume polyhedrization using Marching-Cubes simplification. SPIE Vision Geometry XII.

PDF Cite

(2004). Discrete Surface Segmentation into Discrete Planes. 10th International Workshop on Combinatorial Image Analysis (IWCIA).

PDF Cite

(2004). Digital intersections~: minimal carrier, connectiviy and periodicity properties.. Graphical Models.

PDF Cite

(2004). Decomposition of a three-dimensional discrete object surface into discrete plane pieces.. Algorithmica.

PDF Cite

(2003). New Results about Digital Intersections. 11th International Conference on Discrete Geometry for Computer Imagery (DGCI).

PDF Cite

(2003). From digital plane Segmentation to Polyhedral representation. Theoretical Foundations of Computer Vision "Geometry, Morphology, and Computational Imaging.

PDF Cite

(2003). Digital Plane Preimage Structure. 9th International Workshop on Combinatorial Image Analysis (IWCIA).

PDF Cite