Yan Gérard

31 papers A* 1C 5Journal 14Unranked 11
YearRankTypeTitle / Venue / Authors
2019 — conf
Convex Aggregation Problems in \mathbb Z^2.
DGCI
Yan Gérard
2019 — conf
Efficient Algorithms to Test Digital Convexity.
DGCI
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
2019 J jnl
Efficient Algorithms to Test Digital Convexity.
CoRR
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
2018 J jnl
Peeling Digital Potatoes.
CoRR
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
2017 — conf
Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable in Dimension 3.
DGCI
Yan Gérard
2016 — conf
Recognition of Digital Polyhedra with a Fixed Number of Faces.
DGCI
Yan Gérard
2016 J jnl
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length.
Theor. Comput. Sci.
Yan Gérard, Antoine Vacavant, Jean-Marie Favreau
2015 J jnl
Shape-from-Template.
IEEE Trans. Pattern Anal. Mach. Intell.
Adrien Bartoli, Yan Gérard, François Chadebecq, Toby Collins, Daniel Pizarro
2014 J jnl
Digital Level Layers for Digital Curve Decomposition and Vectorization.
Image Process. Line
Laurent Provot, Yan Gérard, Fabien Feschet
2012 A* conf
On template-based reconstruction from a single view: Analytical solutions and proofs of well-posedness for developable, isometric and conformal surfaces.
CVPR
Adrien Bartoli, Yan Gérard, François Chadebecq, Toby Collins
2011 — conf
Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error.
DGCI
Laurent Provot, Yan Gérard
2011 — conf
Introduction to Digital Level Layers.
DGCI
Yan Gérard, Laurent Provot, Fabien Feschet
2011 C conf
Recognition of Digital Hyperplanes and Level Layers with Forbidden Points.
IWCIA
Laurent Provot, Yan Gérard
2009 C conf
About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness.
IWCIA
Yan Gérard
2009 J jnl
Gift-wrapping based preimage computation algorithm.
Pattern Recognit.
Yan Gérard, David Coeurjolly, Fabien Feschet
2008 — conf
Gift-Wrapping Based Preimage Computation Algorithm.
DGCI
Yan Gérard, Fabien Feschet, David Coeurjolly
2008 C conf
Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NP-Hard.
IWCIA
Yan Gérard
2006 C conf
Additive Subsets.
IWCIA
Yan Gérard
2006 — conf
LP fitting approach for reconstructing parametric surfaces from points clouds.
GRAPP
Thibault Marzais, Yan Gérard, Rémy Malgouyres
2005 J jnl
An elementary digital plane recognition algorithm.
Discret. Appl. Math.
Yan Gérard, Isabelle Debled-Rennesson, Paul Zimmermann
2005 J jnl
Application of a discrete tomography algorithm to computerized tomography.
Electron. Notes Discret. Math.
Yan Gérard, Fabien Feschet
2005 — conf
Computerized Tomography with Digital Lines and Linear Programming.
DGCI
Fabien Feschet, Yan Gérard
2005 J jnl
Reduction from three-dimensional discrete tomography to multicommodity flow problem.
Theor. Comput. Sci.
Yan Gérard
2005 J jnl
Some necessary clarifications about the chords' problem and the Partial Digest Problem.
Theor. Comput. Sci.
Alain Daurat, Yan Gérard, Maurice Nivat
2004 J jnl
An elementary algorithm for digital arc segmentation.
Discret. Appl. Math.
David Coeurjolly, Yan Gérard, Jean-Pierre Reveillès, Laure Tougne
2003 J jnl
A fast and elementary algorithm for digital plane recognition.
Electron. Notes Discret. Math.
Yan Gérard
2002 J jnl
Periodic graphs and connectivity of the rational digital hyperplanes.
Theor. Comput. Sci.
Yan Gérard
2002 J jnl
The chords' problem.
Theor. Comput. Sci.
Alain Daurat, Yan Gérard, Maurice Nivat
2001 C conf
An elementary algorithm for digital arc segmentation.
IWCIA
David Coeurjolly, Laure Tougne, Yan Gérard, Jean-Pierre Reveillès
2000 — conf
A Question of Digital Linear Algebra.
DGCI
Yan Gérard
1999 — conf
Local Configurations of Digital Hyperplanes.
DGCI
Yan Gérard