2025
Untangling Segments in the Plane.
CoRR, January, 2025
2024
Shadoks Approach to Knapsack Polygonal Packing.
CoRR, 2024
Short Flip Sequences to Untangle Segments in the Plane.
Proceedings of the WALCOM: Algorithms and Computation, 2024
The Canadian Traveller Problem on Outerplanar Graphs.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
Shadoks Approach to Knapsack Polygonal Packing (CG Challenge).
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.
,
,
,
,
,
,
,
,
,
,
ACM J. Exp. Algorithmics, December, 2023
Complexity results on untangling red-blue matchings.
Comput. Geom., April, 2023
On the Longest Flip Sequence to Untangle Segments in the Plane.
Proceedings of the WALCOM: Algorithms and Computation, 2023
2022
Shadoks Approach to Low-Makespan Coordinated Motion Planning.
ACM J. Exp. Algorithmics, 2022
Greedy and Local Search Heuristics to Build Area-Optimal Polygons.
ACM J. Exp. Algorithmics, 2022
Reconstruction of Convex Sets from One or Two X-rays.
Fundam. Informaticae, 2022
About the Reconstruction of Convex Lattice Sets from One or Two X-rays.
CoRR, 2022
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings.
CoRR, 2022
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge).
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Efficient Algorithms for Battleship.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge).
Proceedings of the 37th International Symposium on Computational Geometry, 2021
2020
Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons.
J. Math. Imaging Vis., 2020
2019
Regular switching components.
Theor. Comput. Sci., 2019
Convex Aggregation Problems in \mathbb Z^2.
Proceedings of the Discrete Geometry for Computer Imagery, 2019
Efficient Algorithms to Test Digital Convexity.
Proceedings of the Discrete Geometry for Computer Imagery, 2019
Peeling Digital Potatoes.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019
2017
About the Decidability of Polyhedral Separability in the Lattice ℤ<sup>d</sup> - Recognizing Digital Polyhedra with a Prescribed Number of Faces.
J. Math. Imaging Vis., 2017
Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable in Dimension 3.
Proceedings of the Discrete Geometry for Computer Imagery, 2017
2016
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length.
Theor. Comput. Sci., 2016
Recognition of Digital Polyhedra with a Fixed Number of Faces.
Proceedings of the Discrete Geometry for Computer Imagery, 2016
2015
IEEE Trans. Pattern Anal. Mach. Intell., 2015
2014
Digital Level Layers for Digital Curve Decomposition and Vectorization.
Image Process. Line, 2014
About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length.
Proceedings of the Discrete Geometry for Computer Imagery, 2014
2013
Elementary algorithms for multiresolution geometric tomography with strip model of projections.
Proceedings of the 8th International Symposium on Image and Signal Processing and Analysis, 2013
2012
On template-based reconstruction from a single view: Analytical solutions and proofs of well-posedness for developable, isometric and conformal surfaces.
Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012
2011
Recognition of Digital Hyperplanes and Level Layers with Forbidden Points.
Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011
Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error.
Proceedings of the Discrete Geometry for Computer Imagery, 2011
Introduction to Digital Level Layers.
Proceedings of the Discrete Geometry for Computer Imagery, 2011
2009
Gift-wrapping based preimage computation algorithm.
Pattern Recognit., 2009
About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness.
Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009
2008
Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NP-Hard.
Proceedings of the Combinatorial Image Analysis, 12th International Workshop, 2008
2006
Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006
LP fitting approach for reconstructing parametric surfaces from points clouds.
Proceedings of the GRAPP 2006: Proceedings of the First International Conference on Computer Graphics Theory and Applications, 2006
2005
Reduction from three-dimensional discrete tomography to multicommodity flow problem.
Theor. Comput. Sci., 2005
Some necessary clarifications about the chords' problem and the Partial Digest Problem.
Theor. Comput. Sci., 2005
Application of a discrete tomography algorithm to computerized tomography.
Electron. Notes Discret. Math., 2005
An elementary digital plane recognition algorithm.
Discret. Appl. Math., 2005
Computerized Tomography with Digital Lines and Linear Programming.
Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005
2004
An elementary algorithm for digital arc segmentation.
Discret. Appl. Math., 2004
2003
A fast and elementary algorithm for digital plane recognition.
Electron. Notes Discret. Math., 2003
2002
Periodic graphs and connectivity of the rational digital hyperplanes.
Theor. Comput. Sci., 2002
Theor. Comput. Sci., 2002
2000
A Question of Digital Linear Algebra.
Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000
1999
Local Configurations of Digital Hyperplanes.
Proceedings of the Discrete Geometry for Computer Imagery, 1999