An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem. - Lilian Buzer (DGCI, 2002)

A linear incremental algorithm for naive and standard digital lines and planes recognition. - Lilian Buzer (Graph. Model., 2003)

The min-# problem, a hybrid error criterion for near linear time performance. - Lilian Buzer (CCCG, 2005)

Solving online feasibility problem in constant amortized time per update. - Lilian Buzer (CCCG, 2005)

An Elementary Algorithm for Digital Line Recognition in the General Case. - Lilian Buzer (DGCI, 2005)

A Composite and Quasi Linear Time Method for Digital Plane Recognition. - Lilian Buzer (DGCI, 2006)

Recognition of Blurred Pieces of Discrete Planes. - Laurent Provot; Lilian Buzer; Isabelle Debled-Rennesson (DGCI, 2006)

Digital Line Recognition, Convex Hull, Thickness, a Unified and Logarithmic Technique. - Lilian Buzer (IWCIA, 2006)

Optimal simplification of polygonal chain for rendering. - Lilian Buzer (SCG, 2007)

A simple algorithm for digital line recognition in the general case. - Lilian Buzer (Pattern Recognit., 2007)

An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition. - Emilie Charrier; Lilian Buzer (DGCI, 2008)

Digital Planar Surface Segmentation Using Local Geometric Patterns. - Yukiko Kenmochi; Lilian Buzer; Akihiro Sugimoto; Ikuko Shimizu (DGCI, 2008)

Reducing the Coefficients of a Two-Dimensional Integer Linear Constraint. - Emilie Charrier; Lilian Buzer (IWCIA, 2008)

Discrete plane segmentation and estimation from a point cloud using local geometric patterns. - Yukiko Kenmochi; Lilian Buzer; Akihiro Sugimoto; Ikuko Shimizu (Int. J. Autom. Comput., 2008)

Efficient Lattice Width Computation in Arbitrary Dimension. - Emilie Charrier; Lilian Buzer; Fabien Feschet (DGCI, 2009)

Optimal consensus set for digital plane fitting. - Rita Zrour; Yukiko Kenmochi; Hugues Talbot; Lilian Buzer; Yskandar Hamam; Ikuko Shimizu; Akihiro Sugimoto (ICCV Workshops, 2009)

Optimal Consensus Set for Digital Line Fitting. - Rita Zrour; Yukiko Kenmochi; Hugues Talbot; Lilian Buzer; Yskandar Hamam; Ikuko Shimizu; Akihiro Sugimoto (IWCIA Special Track on Applications, 2009)

Optimal simplification of polygonal chains for subpixel-accurate rendering. - Lilian Buzer (Comput. Geom., 2009)

Approximating a real number by a rational number with a limited denominator: A geometric approach. - Emilie Charrier; Lilian Buzer (Discret. Appl. Math., 2009)

Tangential cover for thick digital curves. - Alexandre Faure; Lilian Buzer; Fabien Feschet (Pattern Recognit., 2009)

Efficiently Computing Optimal Consensus of Digital Line Fitting. - Yukiko Kenmochi; Lilian Buzer; Hugues Talbot (ICPR, 2010)

Efficient Robust Digital Hyperplane Fitting with Bounded Error. - Dror Aiger; Yukiko Kenmochi; Hugues Talbot; Lilian Buzer (DGCI, 2011)

Optimal consensus set for digital line and plane fitting. - Rita Zrour; Yukiko Kenmochi; Hugues Talbot; Lilian Buzer; Yskandar Hamam; Ikuko Shimizu; Akihiro Sugimoto (Int. J. Imaging Syst. Technol., 2011)

Computing efficiently the lattice width in any dimension. - Emilie Charrier; Fabien Feschet; Lilian Buzer (Theor. Comput. Sci., 2011)

Small Work Space Algorithms for Some Basic Problems on Binary Images. - Tetsuo Asano; Sergey Bereg; Lilian Buzer (IWCIA, 2012)

A new algorithmic framework for basic problems on binary images. - Tetsuo Asano; Lilian Buzer; Sergey Bereg (Discret. Appl. Math., 2017)

Playout Optimization for Monte-Carlo Search Algorithms. Application to Morpion Solitaire. - Lilian Buzer; Tristan Cazenave (CoG, 2021)

An Algebraic Framework for Out-of-Core Hierarchical Segmentation Algorithms. - Jean Cousty; Benjamin Perret; Harold Phelippeau; Stela Carneiro; Pierre Kamlay; Lilian Buzer (DGMM, 2021)

GPU for Monte Carlo Search. - Lilian Buzer; Tristan Cazenave (LION, 2023)